1996
DOI: 10.1109/22.508651
|View full text |Cite
|
Sign up to set email alerts
|

BiCG-FFT T-Matrix method for solving for the scattering solution from inhomogeneous bodies

Abstract: A BiCG-FFT T-Matrix algorithm is proposed to efficiently solve three-dimensional scattering problems of inhomogeneous bodies. The memory storage is of O ( N ) ( N is the number of unknowns) and each iteration in BiCG requires O(AJ log N ) operations. A good agreement between the numerical and exact solutions is observed. The convergence rate for lossless and lossy bodies of various sizes are shown. It is also demonstrated that the matrix condition number for fine grids is the same as that for coarse grids.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…The condition number of matrix S as defined in (7) increases rapidly with T [16]. This implies that the iterative solution of (6) via a Krylov technique is efficient only if some preconditioner is employed.…”
Section: Solution Of the Mie Systemmentioning
confidence: 99%
See 4 more Smart Citations
“…The condition number of matrix S as defined in (7) increases rapidly with T [16]. This implies that the iterative solution of (6) via a Krylov technique is efficient only if some preconditioner is employed.…”
Section: Solution Of the Mie Systemmentioning
confidence: 99%
“…For DDM2, systems M i c i = a i can be solved independently for each subdomain. These techniques can be extended to 3D problems (see, e.g., [16,22,23]) to compute, e.g., the statistics of the RCS of the wake created by a hypersonic vehicle during its atmospheric reentry, or else by a satellite in the ionosphere. (11).…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations