Abstract
A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3960-3963 |
| Number of pages | 4 |
| Journal | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) |
| Volume | 4 |
| State | Published - Sep 28 2004 |
| Event | IEEE Antennas and Propagation Society Symposium 2004 Digest held in Conjunction with: USNC/URSI National Radio Science Meeting - Monterey, CA, United States Duration: Jun 20 2004 → Jun 25 2004 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering