• DocumentCode
    2704530
  • Title

    Argument-Recursive Computation of Legendre Polynomials with Applications in Computational Electromagnetics

  • Author

    Adam, John D. ; Klinkenbusch, L.

  • Author_Institution
    Comput. Electromagn. Group, Kiel Univ.
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    3917
  • Lastpage
    3920
  • 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 nisinN. 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
  • Keywords
    Legendre polynomials; computational electromagnetics; time-domain analysis; transforms; Legendre polynomials; argument-recursive computation; computational electromagnetics; spherical multipole; t-recursive algorithm; time-domain near-to-far-field transformation algorithm; Algorithm design and analysis; Computational efficiency; Computational electromagnetics; Differential equations; Finite difference methods; Linear systems; Mathematics; Numerical stability; Polynomials; Time domain analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Antennas and Propagation Society International Symposium 2006, IEEE
  • Conference_Location
    Albuquerque, NM
  • Print_ISBN
    1-4244-0123-2
  • Type

    conf

  • DOI
    10.1109/APS.2006.1711481
  • Filename
    1711481
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2704530