2011
DOI: 10.2528/pierm10103104
|View full text |Cite
|
Sign up to set email alerts
|

Floating Interpolation Stencil Topology-Based Ie-FFT Algorithm

Abstract: Abstract-The integral equation fast Fourier transform (IE-FFT)is a fast algorithm for 3D electromagnetic scattering and radiation problems based on the interpolation of the Green's function. In this paper, a novel floating interpolation stencil topology is used to improve the IE-FFT algorithm. Compared to the traditional interpolation stencil topology, it can further reduce the storage and CPU time for the IE-FFT algorithm. The reduction is especially significant for volume integral equations. Furthermore, the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 20 publications
(24 reference statements)
0
9
0
Order By: Relevance
“…can be approximately written as (20) Substituting (20) into (18), we can have (21) where is a sparse matrix. The detailed steps for acquiring are similar to those in the next subsection.…”
Section: A the Center Difference Quotient Scheme (Cdqs)mentioning
confidence: 99%
See 2 more Smart Citations
“…can be approximately written as (20) Substituting (20) into (18), we can have (21) where is a sparse matrix. The detailed steps for acquiring are similar to those in the next subsection.…”
Section: A the Center Difference Quotient Scheme (Cdqs)mentioning
confidence: 99%
“…The expression (20) has implicitly given us an approach that the Green's function's values at the nodes within a box can be used to fit the gradient of the Green's function. We are now going to transform the discrete Gradient function in (18) into the discrete Green's function.…”
Section: B the Two-step Fitting Scheme (Tsfs)mentioning
confidence: 99%
See 1 more Smart Citation
“…7 Nevertheless, due to the singular nature of the GF, parts of G that are associated with near interactions produce inaccurate results and this effect has to be corrected by means of corrections applied to the NF matrix Z near . 32,39 To alleviate any ambiguity, we define the NF interactions as (1) those occurring between the currents inside a box and themselves (2) those occurring between the currents inside a box and currents residing in its immediate neighboring boxes. The definition is easily generalized to include boxes not just in the immediate but also farther neighborhood.…”
Section: Comparison To Ie-fftmentioning
confidence: 99%
“…The traditional fast algorithms of MoM include three categories: methods based on the addition theorem [2][3][4], methods based on Fast Fourier Transformation (the FFT-based methods) [5][6][7], and the methods based on matrix-compression algorithm [8][9][10]. Due to its high universality, the FFT-based methods are widely used and studied in depth [11,12].…”
Section: Introductionmentioning
confidence: 99%