Multilevel fast multipole algorithm (MLFMA) for complex objects

J. M. Song, C. C. Lu, W. C. Chew

Research output: Contribution to journalConference articlepeer-review


In this study, multilevel fast multipole algorithm (MLFMA) is implemented for both flat triangular patch and curvilinear patch geometry descriptions to speed up the matrix-vector multipliers. Both memory requirements and CPU time per iteration are of 0(NlogN). Using block diagonal preconditioner, near singularity extraction, and phase correction for the initial guess, it is possible to solve electromagnetic scattering problems from large complex 3D objects.

Original languageEnglish
Pages (from-to)1730-1733
Number of pages4
JournalIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
StatePublished - 1996
EventProceedings of the 1996 AP-S International Symposium & URSI Radio Science Meeting. Part 1 (of 3) - Baltimore, MD, USA
Duration: Jul 21 1996Jul 26 1996

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Multilevel fast multipole algorithm (MLFMA) for complex objects'. Together they form a unique fingerprint.

Cite this