A three-dimensional (3-D) version of the nested equivalent principle algorithm (NEPAL) is presented. In 3-D, a scatterer is first decomposed into N subscatterers. Then, spherical wave functions are used to represent the scattered field of the subscatterers. Subscatterers are divided into different levels of groups in a nested manner. For example, each group consists of eight subgroups, and each subgroup contains eight sub-subgroups, and so on. For each subgroup, the scattering solution is first solved and the number of subscatterers of the subgroup is then reduced by replacing the interior subscatterers with boundary subscatterers using Huygens’ equivalence principle. As a result, when the subgroups are combined to form a higher level group, the group will have a smaller number of subscatterers. This process is repeated for each level, and in the last level, the number of subscatterers is proportional to that of boundary size of the scatterers. This algorithm has a computational complexity of O(N2) in three dimensions for all excitations and has the advantage of solving large scattering problems for multiple excitations. This is in contrast to Gaussian elimination which has a computational complexity of O(V3).
|Number of pages||8|
|Journal||IEEE Transactions on Antennas and Propagation|
|State||Published - May 1995|
Bibliographical noteFunding Information:
Manuscript received July 7, 1994; revised November 30, 1994. This work was supported in part by Office of Naval Research Grant N00014-89-51286, the Army Research Office Contract DAAL03-91-G-0339, The National Science Foundation Grant NSF ECS 92-24466, NASA Grant NASA NAG 2-871, and the National Center for Supercomputing Applications (NCSA) at the University of Illinois, Urbana-Champaign. The authors are with the Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL 61801 USA. IEEE Log Number 9410725.
ASJC Scopus subject areas
- Electrical and Electronic Engineering