Preconditioning iterative algorithm for the electromagnetic scattering from a large cavity. (English) Zbl 1224.65079

The paper deals with the electromagnetic scattering from an open cavity described by the two-dimensional Helmholtz equation with non-local transparent boundary conditions. This problem is discretized by the five-point finite difference scheme on a uniform mesh. The resulting algebraic system is solved by preconditioned Krylov subspace methods, namely by conjugate orthogonal CG, BiCGstab, and GMRES(m). The used vertically layered medium preconditioner was developed by G. Bao and W. Sun [SIAM J. Sci. Comput. 27, No. 2, 553–574 (2005; Zbl 1089.78024)]. Numerical experiments form a substantial part of the paper. The experiments show the efficiency of the preconditioner, study its dependence on the number mesh-points and on the wave-number, compare the preconditioner with ILU, and asses the performance of the three Krylov subspace methods.


65F08 Preconditioners for iterative methods
78A45 Diffraction, scattering


Zbl 1089.78024
Full Text: DOI


[1] Ammari, An integral equation method for the electromagnetic scattering from cavities, Mathematical Methods in the Applied Sciences 23 pp 1057– (2000) · Zbl 0991.78012
[2] Ammari, Analysis of the electromagnetic scattering from a cavity, Japan Journal of Industrial and Applied Mathematics 19 pp 301– (2002) · Zbl 1033.78005
[3] Bao, A fast algorithm for the electromagnetic scattering from a cavity, SIAM Journal on Scientific Computing 27 pp 553– (2005) · Zbl 1089.78024
[4] Liu, A special higher-order finite-element method for scattering by deep cavity, IEEE Transactions on Antennas and Propagation 48 pp 694– (2000)
[5] Liu, A highly effective preconditioner for solving the finite element-boundary integral matrix equation of 3-D scattering, IEEE Transactions on Antennas and Propagation 50 pp 1212– (2002)
[6] Ross, Hybrid finite element-modal analysis of jet engine inlet scattering, IEEE Transactions on Antennas and Propagation 43 pp 277– (1995)
[7] Rousseau, A hybrid approach for calculating the scattering from obstacles within large, open cavities, IEEE Transactions on Antennas and Propagation 43 pp 1068– (1995)
[8] Xiang, A hybrid BEM/WTM approach for analysis of the EM scattering from large open-ended cavities, IEEE Transactions on Antennas and Propagation 49 pp 165– (2001) · Zbl 1034.78518
[9] Anastassiu, A review of electromagnetic scattering analysis for inlets, cavities, and open ducts, IEEE Antennas and Propagation Magazine 45 pp 27– (2003)
[10] Jin, The Finite Element Method in Electromagnetics (2002) · Zbl 1001.78001
[11] Hawkins, On the influence of the wavenumber on compression in a wavelet boundary element method for the Helmholtz equation, International Journal of Numerical Analysis and Modeling 4 pp 48– (2007) · Zbl 1122.65121
[12] Elman, Efficient iterative solution of the three dimensional Helmholtz equation, Journal of Computational Physics 142 pp 163– (1998) · Zbl 0929.65089
[13] Erlangga, A novel multigrid based preconditioner for heterogeneous helmholtz problems, SIAM Journal on Scientific Computing 27 pp 1471– (2006) · Zbl 1095.65109
[14] Ernst, A domain decomposition approach to solving the Helmholtz equation with radiation boundary condition, Contemporary Mathematics 157 pp 177– (1994) · Zbl 0811.65109
[15] Wang Y. Preconditioning iterative algorithms for electromagnetic scattering from large cavities. Ph.D. Thesis, City University of Hong Kong, 2007.
[16] Wu, Toeplitz-type approximations to the Hadamard integral operators and their applications in electromagnetic cavity problems, Applied Numerical Mathematics 58 pp 101– (2008)
[17] Sun, Newton-Cotes formulas for numerical evaluation of certain hypersingular integrals, Computing 75 pp 297– (2005)
[18] Wu, The superconvergence of trapezoidal rule for Hadamard finite part integrals, Numerische Mathematik 102 pp 343– (2005) · Zbl 1092.65023
[19] Wu, The superconvergence of Newton-Cotes quadrature for Hadamard finite-part integrals on interval, Numerische Mathematik 109 pp 143– (2008)
[20] Saad, Iterative Methods for Sparse Linear Systems (2003) · Zbl 1031.65046
[21] van der Vorst, Iterative Krylov Methods for Large Linear Systems (2003)
[22] Ito, Preconditioned iterative methods on sparse subspaces, Applied Mathematical Letters 19 pp 1191– (2006) · Zbl 1176.65030
[23] Morgan, A restarted GMRES method augmented with eigenvectors, SIAM Journal on Matrix Analysis and Applications 16 pp 1154– (1995) · Zbl 0836.65050
[24] Morgan, Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations, SIAM Journal on Matrix Analysis and Applications 21 pp 1112– (2000) · Zbl 0963.65038
[25] Morgan, GMRES with deflated restarting, SIAM Journal on Scientific Computing 24 pp 20– (2002) · Zbl 1018.65042
[26] Niu Q, Lu L, Ng M. A new restarted GMRES using modified starting vector. Manuscript, 2006.
[27] Chapman, Deflated and augmented Krylov subspace techniques, Numerical Linear Algebra with Applications 4 pp 43– (1997) · Zbl 0889.65028
[28] van der Vorst, A Petrov-Galerkin type method for solving Ax=b, where A is symmetric complex, IEEE Transactions on Magnetics 26 pp 706– (1990)
[29] Freund, Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices, SIAM Journal on Statistical and Scientific Computing 13 pp 425– (1992) · Zbl 0761.65018
[30] Clemens M, Weiland T. Iterative methods for the solution of very large complex-symmetric linear systems of equations in electrodynamics. In Fourth Copper Mountain Conference on Iterative Methods, Part 2, Copper Mountain, CO, U.S.A., Manteuffel TA, McCormick SF (eds), 1996.
[31] Clemens, Comparison of Krylov-type methods for complex linear systems applied to high-voltage problems, IEEE Transactions on Magnetics 34 pp 3335– (1998)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.