Abstract
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 language | English |
|---|---|
| Pages (from-to) | 1730-1733 |
| Number of pages | 4 |
| Journal | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) |
| Volume | 3 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 AP-S International Symposium & URSI Radio Science Meeting. Part 1 (of 3) - Baltimore, MD, USA Duration: Jul 21 1996 → Jul 26 1996 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering