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

Application of FFT and the conjugate gradient method for the solution of electromagnetic radiation from electrically large and small conducting bodies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
91
0

Year Published

2000
2000
2014
2014

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 298 publications
(93 citation statements)
references
References 7 publications
1
91
0
Order By: Relevance
“…At last, the spatial domain dyadic Green's function can be represented in series of spherical waves via Sommerfeld identity in (5).…”
Section: Two-level Discrete Complex Image Methods and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…At last, the spatial domain dyadic Green's function can be represented in series of spherical waves via Sommerfeld identity in (5).…”
Section: Two-level Discrete Complex Image Methods and Discussionmentioning
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%
“…During the past several decades, many fast integral equation solvers have been developed to expedite the iterative solution of integral equation, such as conjugate gradient fast Fourier transform (CG-FFT) [3], multilevel fast multipole algorithm (MLFMA) [4,5], adaptive integral method (AIM) [6,7], precorrected fast Fourier transform (P-FFT) [8,9], Green's function interpolation with fast Fourier transform (GIFFT) [10], integral equation fast Fourier transform (IE-FFT) [11,12] and multilevel Green's function interpolation method (MLGFIM) [13]. The MLFMA has a low complexity of O(N log N ) for arbitrary geometry shape, but it is a kennel dependent method and also has a low frequency breakdown problem.…”
Section: Introductionmentioning
confidence: 99%
“…There exist a lot of fast integral equation methods that can be used to enhance the efficiency of the solution, for instance, FMM [12,[19][20][21], CGFFT [22,23], Pre-corrected FFT [24], SMCG [25], AIM [26], IceCube [27], IMLMQRF [11,28], and MLGFIM [1,2] and so on. In them, 1) FMM is the fastest method with O(N ) complexity for quasistatic problems; 2) SMCG, CGFFT, Pre-corrected FFT, SMCG, and AIM are FFT based methods with O(N log N ) complexity; 3) Ice Cube and IMLMQRF are the methods based on matrix compression technique, i.e., QR factorization, matrix merging, and matrix column and row sampling techniques; 4) MLGFIM is based on a hierarchical structure that is similar to FMM but using the Green's function matrix interpolation method with QR factorization technique.…”
Section: Introductionmentioning
confidence: 99%