2014 IEEE Electrical Design of Advanced Packaging &Amp; Systems Symposium (EDAPS) 2014
DOI: 10.1109/edaps.2014.7030822
|View full text |Cite
|
Sign up to set email alerts
|

Null field preconditioner for fast 3D full-wave MoM package-board extraction

Abstract: In this paper, a preconditioning technique based on the null field method is presented to accelerate the convergence of fast near-linear complexity iterative Method of Moments (MoM) solution. For large-scale package-board 3D fullwave parasitic extraction, the solution time is often prohibitive for use in a design-cycle which might necessitate several analysis stages. The bottleneck is often the slow-convergence of the Krylov subspace-based iterative solution. Since the null field method scales the near field i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…where, I 11 , I 22, I 33, and I 44 are the identity block matrices. In the null-field method [9,10], either left-or right-hand scaling is performed for the near-field scaling to diagonal blocks ignoring the fill-in blocks. In contrast, in the proposed Schur's complement method, both left-and right-hand scaling are performed simultaneously, considering fill-in blocks for complete farfield scaling to diagonal blocks.…”
Section: A Preparing For Power Series Computationmentioning
confidence: 99%
See 1 more Smart Citation
“…where, I 11 , I 22, I 33, and I 44 are the identity block matrices. In the null-field method [9,10], either left-or right-hand scaling is performed for the near-field scaling to diagonal blocks ignoring the fill-in blocks. In contrast, in the proposed Schur's complement method, both left-and right-hand scaling are performed simultaneously, considering fill-in blocks for complete farfield scaling to diagonal blocks.…”
Section: A Preparing For Power Series Computationmentioning
confidence: 99%
“…It is well known that an ill-conditioned matrix will lead to a high number of iterations, thus increasing the overall solution time. To improve the condition number of the matrix, researchers have suggested various types of matrix preconditioning methods like incomplete LU factorized ILUT [8], diagonal blockbased Null-Field [9,10] and Schur complement [11,12]. But the effectiveness of these preconditioners is limited by precondition computation time and condition number improvement of the entire matrix.…”
Section: Introductionmentioning
confidence: 99%
“…Right scaling coefficient false[bold-italicα1false] for scaling the first row blocks Z11 and Z13 can be represented as: false[bold-italicα1false]=][1em4ptIthickmathspace11α121em4ptα1300I221em4pt0thickmathspacethickmathspacethickmathspacethickmathspace01em4pt001em4pt001em4pt1em4ptI3301em4pt0I44 where 1em4pt1em4ptI11I22I33 and I44thickmathspace are the identity block matrices. In the null‐field method [25, 26] either left or right scaling is performed for the near‐field scaling to diagonal blocks ignoring the fill‐in blocks. In contrast, in the proposed Schur's complement method both left and right scaling are performed simultaneously considering fill‐in blocks for complete near‐field scaling to diagonal block.…”
Section: Schur's Complement Preconditionermentioning
confidence: 99%
“…Typically, an inverse of the near‐field MoM blocks can act as a good preconditioner. Block diagonal forms of preconditioner is proposed in [25, 26] where the null‐field method is used to scale the symmetric near‐field matrix to diagonal blocks. In the case of the null‐field method, the fill‐in blocks for scaling is not considered which limits the effective scaling of the near‐field to diagonal block thus giving high storage and matrix–vector product time.…”
Section: Introductionmentioning
confidence: 99%
“…The near-field matrix [21] of a fast solver can also be used as a preconditioner, but the high factorization cost limits the application as a preconditioner. A scaled near-field block-diagonal preconditioner is presented in [22]- [25], but the diagonalization process is complex. The preconditioner should be simple and low-cost in computation, and effective in improving the condition number of the matrix.…”
Section: Introductionmentioning
confidence: 99%