Novel implementation of multilevel fast multipole algorithm for higher-order Galerkin's method

K. C. Donepudi, J. M. Song, J. M. Jin, G. Kang, W. C. Chew

Research output: Contribution to conferencePaperpeer-review

Abstract

A new approach is proposed to enhance the efficiency and reduce the memory requirements of the multilevel fast multipole algorithm (MLFMA) when applied to the higher-order Galerkin's method. This approach represents higher-order basis functions by a set of point sources such that a matrix-vector multiply is equivalent to calculating the fields at a number of points from given current sources at these points. The MLFMA is then applied to calculate the point-to-point interactions. This permits the use of more levels in MLFMA than applying MLFMA to basis-to-basis interactions directly and thus reduces the memory requirements significantly.

Original languageEnglish (US)
Pages851-858
Number of pages8
StatePublished - 2000
Event16th Annual Review of Progress in Applied Computational Electromagnetics (ACES 2000) - Monterey, CA, USA
Duration: Mar 20 2000Mar 24 2000

Other

Other16th Annual Review of Progress in Applied Computational Electromagnetics (ACES 2000)
CityMonterey, CA, USA
Period3/20/003/24/00

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Novel implementation of multilevel fast multipole algorithm for higher-order Galerkin's method'. Together they form a unique fingerprint.

Cite this