2011
DOI: 10.1109/tap.2011.2165474
|View full text |Cite
|
Sign up to set email alerts
|

Fast-Factorization Acceleration of MoM Compressive Domain-Decomposition

Abstract: Domain-decomposition (DD) for Integral Equation can be achieved by aggregating standard basis functions into specialized basis functions on each sub-domain; this results in a strong compression of the MoM matrix, which allows an iteration-free (e.g., LU decomposition) solution also for electrically large problems. Fast matrix-vector product algorithms can be used in the matrix filling and compression process of the employed aggregate-functions approach: this hybrid approach has received considerable attention … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 45 publications
(20 citation statements)
references
References 19 publications
(70 reference statements)
0
20
0
Order By: Relevance
“…We obtain which, in turn, gives us the expression of as (30) where This expression for is then substituted alongside the expression of into the last row of (20), which helps to solve for , (31) where (32) Now for the solution to the system given by (20), once (31) is solved for , it is substituted into (30) to solve for , and finally the solution is obtained from (29). It can be seen from (29)-(31) that none involves an inversion of a matrix comprising contributions from both magnetic vector potential and electric scalar potential.…”
Section: B Derivation Of a Well-conditioned Reduced System Matrix Sumentioning
confidence: 99%
“…We obtain which, in turn, gives us the expression of as (30) where This expression for is then substituted alongside the expression of into the last row of (20), which helps to solve for , (31) where (32) Now for the solution to the system given by (20), once (31) is solved for , it is substituted into (30) to solve for , and finally the solution is obtained from (29). It can be seen from (29)-(31) that none involves an inversion of a matrix comprising contributions from both magnetic vector potential and electric scalar potential.…”
Section: B Derivation Of a Well-conditioned Reduced System Matrix Sumentioning
confidence: 99%
“…During the execution of the algorithm, the matrices B1 and B2 do not need to be explicitly generated. For the multisubdomain case, the global model equation (12) does not have to be fully constructed when such a fast algorithm as the MLFMA is applied. Note that all the matrix elements in (12) are from proper integrals and/or convergent improper integrals, where all the singularities are accurately processed by using the method in [17].…”
Section: B Building the Global Model Equationmentioning
confidence: 99%
“…For instance, the works [20], [21] include the precorrected-FFT to speed up matrix-vector multiplications in iterative solutions. The authors of [22] proposed and demonstrated the use of the adaptive integral method (AIM) fast factorization to accelerate the synthetic function expansion (SFX) domain decomposition by exploiting the convolutional nature of the Toeplitz kernel using a 3-D FFT. This method is demonstrated to be efficient for volume and quasi-planar problems.…”
Section: Introductionmentioning
confidence: 99%