Beitrag in einem Tagungsband
Argument-Recursive Computation of Legendre Polynomials with Applications in Computational Electromagnetics
Details zur Publikation
Autor(inn)en: | Adam, J.; Klinkenbusch, L. |
Herausgeber: | IEEE Antennas and Propagation Society |
Verlag: | IEEE Operations Center |
Verlagsort / Veröffentlichungsort: | Piscataway, NJ |
Publikationsjahr: | 2006 |
Zeitschrift: | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) |
Seitenbereich: | 3917-3920 |
Buchtitel: | IEEE Antennas and Propagation Society international symposium 2006 : 9 - 14 July 2006, [Albuquerque, NM ; 2006 IEEE AP-S international symposium and USNC/URSI and AMEREM meetings |
ISBN: | 1-4244-0123-2 |
ISSN: | 1522-3965 |
DOI-Link der Erstveröffentlichung: |
URN / URL: |
Zusammenfassung, Abstract
We introduce an efficient t-recursive algorithm to compute Legendre polynomials Pn(t) and their derivatives Pn(t) on the interval (0, 1) with fixed order n ∈ N. The numerical properties are discussed and related examples in Computational Electromagnetics are given. In particular, this method is well suited to enhance a recently proposed spherical-multipole based time-domain near-to-far-field transformation algorithm.
We introduce an efficient t-recursive algorithm to compute Legendre polynomials Pn(t) and their derivatives Pn(t) on the interval (0, 1) with fixed order n ∈ N. The numerical properties are discussed and related examples in Computational Electromagnetics are given. In particular, this method is well suited to enhance a recently proposed spherical-multipole based time-domain near-to-far-field transformation algorithm.
