2007
DOI: 10.2528/pier06121902
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Algorithm for Em Scattering by Electrically Large Dielectric Objects Using MR-Qeb Iterative Scheme and Cg-FFT Method

Abstract: Abstract-In this paper, an efficient algorithm is presented to analyze the electromagnetic scattering by electrically large-scale dielectric objects. The algorithm is based on the multi-region and quasiedge buffer (MR-QEB) iterative scheme and the conjugate gradient (CG) method combined with the fast Fourier transform (FFT). This algorithm is done by dividing the computational domain into small sub-regions and then solving the problem in each sub-region with buffer area using the CG-FFT method. Considering the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2008
2008
2014
2014

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 26 publications
(23 reference statements)
0
12
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%
“…We consider an OFDM system implemented by the inverse fast Fourier transform (IFFT) and fast Fourier transform (FFT) [24]. The N symbols are modulated where N is the number of sub-carriers.…”
Section: System Model Descriptionmentioning
confidence: 99%
“…The MoM requires O(N 2 ) computer memory and O(N 3 ) computation time because of the need to store and invert the MoM matrix [3], where N is the number of unknowns in the problem. An important improvement over the MoM is conjugate gradient -fast Fourier transform method (CG-FFT) [4][5][6][7][8][9][10][11][12][13][14]. It uses conjugate gradient algorithm (CG), one of the Krylov subspace iterative approaches [15], to solve the integral equation, and the required matrix-vector product during the iteration is efficiently evaluated by using the fast Fourier transform (FFT) scheme.…”
Section: Introductionmentioning
confidence: 99%