1996
DOI: 10.1029/96rs02504
|View full text |Cite
|
Sign up to set email alerts
|

AIM: Adaptive integral method for solving large‐scale electromagnetic scattering and radiation problems

Abstract: Lagrange interpolation, the new formula provides relatively higher accuracy and larger grid step size and also makes it simpler to implement higher-order basis functions in IE-FFT. frequency and the slotline radiation loss. In addition, high radiation loss of a transition is undesired in high density circuits due to that it will cause unwanted crosstalk. Furthermore, for a low characteristic impedance of the slotline and easy matching to a 50 ⍀ microstrip line, they are all fabricated on high dielectric con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
503
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 810 publications
(504 citation statements)
references
References 16 publications
1
503
0
Order By: Relevance
“…There exist several fast algorithms for matrix-vector multiplication that can be used to enhance the efficiency of the solution, such as fast multipole method (FMM) [7][8][9], conjugate gradient fast Fourier transform (CGFFT) [10,11], precorrected FFT (PFFT) [12], the sparse matrix/canonical grid (SMCG) method [13], adaptive integral method (AIM) [14], and MLGFIM [15,16] and so on. Among them, FMM is a fast algorithm with O(N ) complexity, CGFFT, PFFT, SMCG, and AIM are FFT based methods with O(N log N ) complexity, while MLGFIM is based on a hierarchical structure which is similar to FMM but using the Green's function matrix interpolation method with QR [17] factorization technique.…”
Section: Introductionmentioning
confidence: 99%
“…There exist several fast algorithms for matrix-vector multiplication that can be used to enhance the efficiency of the solution, such as fast multipole method (FMM) [7][8][9], conjugate gradient fast Fourier transform (CGFFT) [10,11], precorrected FFT (PFFT) [12], the sparse matrix/canonical grid (SMCG) method [13], adaptive integral method (AIM) [14], and MLGFIM [15,16] and so on. Among them, FMM is a fast algorithm with O(N ) complexity, CGFFT, PFFT, SMCG, and AIM are FFT based methods with O(N log N ) complexity, while MLGFIM is based on a hierarchical structure which is similar to FMM but using the Green's function matrix interpolation method with QR [17] factorization technique.…”
Section: Introductionmentioning
confidence: 99%
“…The adaptive integral method (AIM) or precorrected-FFT algorithm (pFFT) [Bleszynski et al, 1996;Phillips and White, 1997] separates the computations of the near and far field interactions. The near field interactions are directly computed by using (26) and the far field interactions are approximated with the interpolation and the FFT.…”
Section: Acceleration With the Fftmentioning
confidence: 99%
“…It can find various applications in geophysics exploring [1], unexploded objects characterizing, and microwave integrated circuit analyzing, etc. This structure can be efficiently and rigorously analyzed by the method of moments (MoM) [2][3][4] and fast algorithms based on MoM, such as the conjugate gradient fast Fourier transform method [5], the adaptive integral method [6], the fast multipole method [7]. Either for the conventional MoM or fast algorithms, dyadic Green's function for layered media should be computed.…”
Section: Introductionmentioning
confidence: 99%