1995
DOI: 10.1002/mop.4650090408
|View full text |Cite
|
Sign up to set email alerts
|

An FFT T‐matrix method for 3D microwave scattering solutions from random discrete scatterers

Abstract: An efficient method to solve the scattering by a cluster of randomly located discrete scatterers is described. The scatterers can have an arbitrary shape, and only their T matrices need be known. An iterative method is suggested to solve this problem. To expedite the matrix‐vector multiply, we first aggregate the random scattering centers of the scatterers into centers that reside on a regular array. Then, the FFT method is used to perform the matrix‐vector multiply in O(N log N) operations. This method can so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
14
0

Year Published

1998
1998
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(14 citation statements)
references
References 2 publications
0
14
0
Order By: Relevance
“…Over the past few decades, some theories and numerical methods have been developed to study the light scattering by random discrete particles [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][48]. In this section, we introduce a hybrid finite element-boundary integral-characteristic basis function method (FE-BI-CBFM) to simulate the light scattering by random discrete particles [49].…”
Section: Light Scattering By Random Discrete Particlesmentioning
confidence: 99%
“…Over the past few decades, some theories and numerical methods have been developed to study the light scattering by random discrete particles [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][48]. In this section, we introduce a hybrid finite element-boundary integral-characteristic basis function method (FE-BI-CBFM) to simulate the light scattering by random discrete particles [49].…”
Section: Light Scattering By Random Discrete Particlesmentioning
confidence: 99%
“…computational complexity is O N log N , and the memory Figure 1. A T 2, 2, 2 matrix the type produced in 3 . the solution to the example in Section III would be similar, 3 Ž .…”
Section: Introductionmentioning
confidence: 99%
“…A T 2, 2, 2 matrix the type produced in 3 . the solution to the example in Section III would be similar, 3 Ž . Figure 1 Example of a A s T 2, 2, 2 asymmetric MBT matrix.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Their translation formulas [2][3][4][5][6][7][8][9], which express a spherical multipole field in one coordinate system in terms of the spherical multipole fields of another coordinate system that is related to the former by translation, have been a powerful analytic tool in many areas of electromagnetics. Early applications of the formulas include the plane-wave scattering from two metal spheres [10], which was later generalized to the scattering from many dielectric spheres in arbitrary configurations [11]; probe correction for spherical near-field scanning [12]; modeling of wave propagation through random discrete media [13]; extension of the Tmatrix technique for many scatterers [9] and its efficient numerical implementation using FFT [16,17]. As noted in [15], the cost of computing translation coefficients was found to be high and thus their recurrence relations [7,14,15] were derived in an attempt to contain this high cost.…”
Section: Introductionmentioning
confidence: 99%