Abstract
The Fast Inhomogeneous Plane Wave Algorithm was extended to solve the buried object problems. As such, the multi-level algorithm was successfully implemented and the memory and computational complexity were shown to be O(NlogN). Comparing the algorithm with its free-space counterpart, it was shown that the increase of the computational resource required for the buried object problems was small.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 560-563 |
| Number of pages | 4 |
| Journal | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) |
| Volume | 3 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
ASJC Scopus subject areas
- Electrical and Electronic Engineering