Modified adaptive cross approximation algorithm for analysis of electromagnetic problems

Z. N. Jiang, R. S. Chen*, Z. H. Fan, Y. Y. An, M. M. Zhu, K. W. Leung

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

12 Citations (Scopus)

Abstract

In order to efficiently analyze the large dense complex linear system arising from electric field integral equations (EFIE) formulation of electromagnetic scattering problems, the adaptive cross approximation (ACA) is applied to accelerate the matrix-vector multiplication operations. Although the ACA is already efficient compared with the direct method, this paper utilizes a novel technique to further reduce the setup time and storage memory. This method applies the predetermined interaction list supported oct tree (PILOT) to form a new far field interaction list. Using the new far field interaction list, less setup time representation of the far field matrix is obtained. The numerical results of complex objects are used to demonstrate that the memory requirement of the modified ACA is also less than that of the traditional ACA. An efficient preconditioning technique is combined into the inner-outer flexible generalized minimal residual (FGMRES) solver to further speed up the matrix-vector multiplication. © 2011 ACES.
Original languageEnglish
Pages (from-to)160-169
JournalApplied Computational Electromagnetics Society Journal
Volume26
Issue number2
Publication statusPublished - Feb 2011
Externally publishedYes

Research Keywords

  • Adaptive cross approximation (ACA)
  • Flexible generalized minimal residual (FGMRES)
  • Predetermined interaction list supported oct tree (PILOT)

Fingerprint

Dive into the research topics of 'Modified adaptive cross approximation algorithm for analysis of electromagnetic problems'. Together they form a unique fingerprint.

Cite this