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 language | English (US) |
|---|---|
| Pages | 851-858 |
| Number of pages | 8 |
| State | Published - Jan 1 2000 |
| Event | 16th Annual Review of Progress in Applied Computational Electromagnetics (ACES 2000) - Monterey, CA, USA Duration: Mar 20 2000 → Mar 24 2000 |
Other
| Other | 16th Annual Review of Progress in Applied Computational Electromagnetics (ACES 2000) |
|---|---|
| City | Monterey, CA, USA |
| Period | 3/20/00 → 3/24/00 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Donepudi, K. C., Song, J. M., Jin, J., Kang, G., & Chew, W. C. (2000). Novel implementation of multilevel fast multipole algorithm for higher-order Galerkin's method. 851-858. Paper presented at 16th Annual Review of Progress in Applied Computational Electromagnetics (ACES 2000), Monterey, CA, USA, .