1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

IEEE Transactions on Antennas and Propagation
Volume 46 Number 8, August 1998

Numerically Efficient Solution of Dense Linear System of Equations Arising in a Class of Electromagnetic Scattering Problems

Page 1169.

Abstract:

In this paper we present an efficient technique for solving dense complex-symmetric linear system of equations arising in the method of moments (MoM) formulation. To illustrate the application of the method, we consider a finite array of scatterers, which gives rise to a large number of unknowns. The solution procedure utilizes preconditioned transpose-free QMR (PTFQMR) iterations and computes the matrix-vector products by employing a compressed impedance matrix. The compression is achieved by reduced-rank representation of the off-diagonal blocks, based on a partial-QR decomposition, which is followed by an iterative refinement. Both the preconditioning and the compression steps take advantage of the block structure of the matrix. The convergence of the iterative procedure is investigated and the performance of the proposed algorithm is compared to that achieved by other schemes. The effectiveness of the preconditioner and the degree of matrix compression are quantified. Finite arrays of variable shape and sizes are considered, and it is demonstrated that the ability to solve large problems using this technique enables one to evaluate the edge effects in the finite array. Such array is basically flat and periodic, but the algorithm is still efficient when variation with strict periodicity or flatness exists.

References

1. R. W. Freund, "A transpose-free quasiminimal residual algorithm for non-Hermitian linear systems," SIAM J. Sci. Comput., vol. J4, pp. 470-482, 1993.
2. V. Varadarajan and R. Mittra, "Numerically efficient solution of dense linear system arising in electromagnetic scattering problems," in Workshop Approx. Numer. Methods Solution Maxwell Equations Proc., Oxford, U.K., Mar. 1995.
3. S. M. Rao, D. R. Wilton, and A. W. Glisson "Electromagnetic scattering by surfaces of arbitrary shape," IEEE Trans. Antennas Propagat., vol. AP-30, pp. 409-418, May 1982.
4. G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed.Baltimore, MD: Johns Hopkins Univ. Press, 1989.
5. D. G. Luenberger, Introduction to Linear and Nonlinear Programming.New York: Addison-Wesley, 1973.
6. Y. Saad, Iterative Methods for Sparse Linear Systems.Boston, MA: PWS, 1996.
7. Y. Saad and M. H. Schultz, "EGMRES: A generalized minimal residual algorithm for solving nonsymetric linear systems," SIAM J. Stat. Comput., vol. 7, no. 3, July 1986.
8. R. W. Freund, "Conjugate gradient-type methods for linear systems with complex symmetric linear systems," SIAM J. Stat. Comput., vol. 13, no. 1, Jan. 1992.
9. P. G. Ciarlet, "Introduction a` l'analyze numerique matricielle et a` l'optimization," Masson, Oct. 1990.
10. R. Coifman, V. Rokhlin, and S. Wandzura, "The fast multipole method for the wave equation: A pedestrian description," IEEE Antennas Propagat. Mag., vol. 35, June 1993.
11. J. Song, C. Lu, and W. C. Chew, "Multilevel fast multipole algorithm for electromagnetic scattering by large complex objects," IEEE Trans. Antennas Propagat., vol. 45, pp. 1488-1493, Oct. 1997.