A Global Interpolator With Low Sample Rate for Multilevel Fast Multipole Algorithm
A new, improved version of a global interpolator utilizing trigonometric polynomials is presented for the high-frequency multilevel fast multipole algorithm. The number of required points to sample the outgoing and incoming field patterns is low, almost half in some levels, compared with the earlier...
Saved in:
Published in | IEEE transactions on antennas and propagation Vol. 61; no. 3; pp. 1291 - 1300 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.03.2013
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A new, improved version of a global interpolator utilizing trigonometric polynomials is presented for the high-frequency multilevel fast multipole algorithm. The number of required points to sample the outgoing and incoming field patterns is low, almost half in some levels, compared with the earlier published versions. Compared with local interpolators based on Lagrange interpolating polynomials, the proposed technique performs even more favorably and reduces the number of sample points by a factor of eight. The numerical examples demonstrate that the interpolator allows full numerical accuracy control during the aggregation and disaggregation phases, regardless of the number of the levels in the octree. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0018-926X 1558-2221 |
DOI: | 10.1109/TAP.2012.2231927 |