Some issues related to the novel spectral acceleration method for the fast computation of radiation/scattering from one-dimensional extremely large scale quasi-planar structures

[1] The novel spectral acceleration (NSA) algorithm has been shown to produce an (Ntot) efficient iterative method of moments for the computation of radiation/scattering from both one-dimensional (1-D) and two-dimensional large-scale quasi-planar structures, where Ntot is the total number of unknowns to be solved. This method accelerates the matrix-vector multiplication in an iterative method of moments solution and divides contributions between points into “strong” (exact matrix elements) and “weak” (NSA algorithm) regions. The NSA method is based on a spectral representation of the electromagnetic Green's function and appropriate contour deformation, resulting in a fast multipole-like formulation in which contributions from large numbers of points to a single point are evaluated simultaneously. In the standard NSA algorithm the NSA parameters are derived on the basis of the assumption that the outermost possible saddle point, ϕs,max, along the real axis in the complex angular domain is small. For given height variations of quasi-planar structures, this assumption can be satisfied by adjusting the size of the strong region Ls. However, for quasi-planar structures with large height variations, the adjusted size of the strong region is typically large, resulting in significant increases in computational time for the computation of the strong-region contribution and degrading overall efficiency of the NSA algorithm. In addition, for the case of extremely large scale structures, studies based on the physical optics approximation and a flat surface assumption show that the given NSA parameters in the standard NSA algorithm may yield inaccurate results. In this paper, analytical formulas associated with the NSA parameters for an arbitrary value of ϕs,max are presented, resulting in more flexibility in selecting Ls to compromise between the computation of the contributions of the strong and weak regions. In addition, a “multilevel” algorithm, decomposing 1-D extremely large scale quasi-planar structures into more than one weak region and appropriately choosing the NSA parameters for each weak region, is incorporated into the original NSA method to improve its accuracy.

[1]  Jiming Song,et al.  Multilevel fast‐multipole algorithm for solving combined field integral equations of electromagnetic scattering , 1995 .

[2]  Joel T. Johnson,et al.  A novel acceleration algorithm for the computation of scattering from two-dimensional large-scale perfectly conducting random rough surfaces with the forward-backward method , 2000, IEEE Trans. Geosci. Remote. Sens..

[3]  Weng Cho Chew,et al.  Fast algorithm for the analysis of scattering by dielectric rough surfaces , 1998 .

[4]  John L. Volakis,et al.  Scattering from planar structures containing small features using the adaptive integral method (AIM) , 1998 .

[5]  Joel T. Johnson,et al.  On the canonical grid method for two-dimensional scattering problems , 1998 .

[6]  G. Brown,et al.  A new numerical method for rough-surface scattering calculations , 1996 .

[7]  Joel T. Johnson,et al.  The forward–backward method with a novel spectral acceleration algorithm (FB/NSA) for the computation of scattering from two‐dimensional large‐scale impedance random rough surfaces , 2001 .

[8]  Joel T. Johnson,et al.  An Improved Fb/Nsa Algorithm for the Computation of Scattering From Two-Dimensional Large-Scale Rough Surfaces , 2001 .

[9]  Joel T. Johnson,et al.  A novel acceleration algorithm for the computation of scattering from rough surfaces with the forward‐backward method , 1998 .

[10]  R. Rojas,et al.  Fast analysis of electromagnetic scattering from finite strip gratings on a grounded dielectric slab , 2000 .

[11]  Leung Tsang,et al.  Monte-Carlo simulations of large-scale problems of random rough surface scattering and applications to grazing incidence with the BMIA/canonical grid method , 1995 .

[12]  A. Brandt Multilevel computations of integral transforms and particle interactions with oscillatory kernels , 1991 .

[13]  Joel T. Johnson,et al.  Formulation of forward-backward method using novel spectral acceleration for the modeling of scattering from impedance rough surfaces , 2000, IEEE Trans. Geosci. Remote. Sens..

[14]  D. Jackson,et al.  The validity of the perturbation approximation for rough surface scattering using a Gaussian roughness spectrum , 1988 .

[15]  Gary S. Brown,et al.  On the discretization of the integral equation describing scattering by rough conducting surfaces , 1998 .

[16]  D Torrungrueng,et al.  Numerical studies of backscattering enhancement of electromagnetic waves from two-dimensional random rough surfaces with the forward-backward/novel spectral acceleration method. , 2001, Journal of the Optical Society of America. A, Optics, image science, and vision.

[17]  Weng Cho Chew,et al.  A multilevel algorithm for solving a boundary integral equation of wave scattering , 1994 .

[18]  Weng Cho Chew,et al.  A combined steepest descent-fast multipole algorithm for the analysis of three-dimensional scattering by rough surfaces , 1997, IEEE Antennas and Propagation Society International Symposium 1997. Digest.

[19]  Weng Cho Chew,et al.  Fast inhomogeneous plane wave algorithm for electromagnetic solutions in layered medium structures: Two‐dimensional case , 2000 .

[20]  D. Holliday,et al.  Forward-backward: a new method for computing low-grazing angle scattering , 1996 .

[21]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .