A fast preconditioned iterative algorithm for the electromagnetic scattering from a large cavity

Chenliang Li, Zhonghua Qiao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)

Abstract

In this paper, a fast preconditioned Krylov subspace iterative algorithm is proposed for the electromagnetic scattering from a rectangular large open cavity embedded in an infinite ground plane. The scattering problem is described by the Helmholtz equation with a nonlocal artificial boundary condition on the aperture of the cavity and Dirichlet boundary conditions on the walls of the cavity. Compact fourth order finite difference schemes are employed to discretize the bounded domain problem. A much smaller interface discrete system is reduced by introducing the discrete Fourier transformation in the horizontal and a Gaussian elimination in the vertical direction, presented in Bao and Sun (SIAM J. Sci. Comput. 27:553, 2005). An effective preconditioner is developed for the Krylov subspace iterative solver to solve this interface system. Numerical results demonstrate the remarkable efficiency and accuracy of the proposed method.
Original languageEnglish
Pages (from-to)435-450
Number of pages16
JournalJournal of Scientific Computing
Volume53
Issue number2
DOIs
Publication statusPublished - 1 Nov 2012

Keywords

  • Compact finite difference scheme
  • Electromagnetic scattering
  • Preconditioned Krylov subspace

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • General Engineering
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'A fast preconditioned iterative algorithm for the electromagnetic scattering from a large cavity'. Together they form a unique fingerprint.

Cite this