2000
DOI: 10.1002/(sici)1098-2760(20000320)24:6<385::aid-mop8>3.0.co;2-w
|Get access via publisher |Summarize |Cite
The conjugate-gradient nonuniform fast Fourier transform (CG-NUFFT) method for one- and two-dimensional media
Abstract: A novel method combining the conjugate‐gradient and nonuniform fast Fourier transform (CG–NUFFT) algorithms for solving integral equations in electromagnetics is presented. The CG–NUFFT method has been applied to one‐ and two‐dimensional inhomogeneous media. Numerical results show the advantages of the CG–NUFFT method over the CG–FFT method for problems with both electrically large and small regions. © 2000 John Wiley & Sons, Inc. Microwave Opt Technol Lett 24: 385–389, 2000.
Search citation statements
Paper Sections
Select...
4
2
0
0
Citation Types
0
7
0
0
Year Published
2001
2009
Publication Types
Select...
5
1
Relationship
0
6
Authors
Journals
Cited by 6 publications
(7 citation statements)
References 4 publications
0
7
0
0
Smart CitationsHow this paper cites the one you are viewing
“…In order to validate our 3D NUFFT algorithms, the cuboid is discretized with 16 16 32 × × grids, nonuniformly distributed in both x and y directions and uniformly in z direction. Some data for the RCS of the cuboid are given in Figure 1, and the solutions from the weak-form CG-FFT [2] are also displayed. As compared in Figure 1(a), our numerical results have an excellent agreement with the CG-FFT.…”
Section: Numerical Results
mentioning
confidence: 99%
Smart CitationsHow this paper cites the one you are viewing
“…In order to validate our 3D NUFFT algorithms, the cuboid is discretized with 16 16 32 × × grids, nonuniformly distributed in both x and y directions and uniformly in z direction. Some data for the RCS of the cuboid are given in Figure 1, and the solutions from the weak-form CG-FFT [2] are also displayed. As compared in Figure 1(a), our numerical results have an excellent agreement with the CG-FFT.…”
Section: Numerical Results
mentioning
confidence: 99%
“…To overcome this limitation, the nonuniform fast Fourier transform (NUFFT) algorithm is introduced. In [2], the NUFFT is combined with the CG method for one-and two-dimensional problems. With NUFFT algorithms, the CG-NUFFT method gives the important flexibility of nonuniform sampling and maintains the computational efficiency of the conventional CG-FFT method.…”
mentioning
confidence: 99%
Abstract
Smart CitationsHow this paper cites the one you are viewing
“…The generalization to 2D and 3D is straightforward using separable interpolators as described previously, e.g., [2][3][4]. Given samples {F(ν m )}, m = 1, …, M of the Fourier transform of an object f(x), one can estimate f by an approximate inverse Fourier transform as follows:…”
Section: Introduction
mentioning
confidence: 99%
“…Defining ω m ≜ 2πν m Δ x and the phase modulated spectrum (3) the essence of the gridding reconstruction method is to evaluate summations of the following form: (4) This is a "type 1" NUFFT as defined for example in [6].…”
Section: Introduction
mentioning
confidence: 99%
