Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Polynomial approximation for fast generation of associated Legendre functions
Abstract Today high-speed computers have simplified many computational problems, but fast techniques and algorithms are still relevant. In this study, the Hermitian polynomial approximation is used for fast evaluation of the associated Legendre functions (ALFs). It has lots of applications in geodesy and geophysics. This method approximates the ALFs instead of computing them by recursive formulae and generate them several times faster. The approximated ALFs by the Newtonian polynomials are compared with Hermitian ones and their differences are discussed. Here, this approach is applied for computing a global geoid model point-wise from EGM08 to degree and order 2160 and in propagating the orbit of a low Earth orbiting satellite. Our numerical results show that the CPU-time decreases at least two times for orbit propagation, and five times for geoid computation comparing to the case where recursive formulae for generation of ALFs are used. The approximation error in the orbit computation is at a sub-millimeter level over two weeks and that the computed geoid 0.01 mm, with a maximum of 1 mm.
Polynomial approximation for fast generation of associated Legendre functions
Abstract Today high-speed computers have simplified many computational problems, but fast techniques and algorithms are still relevant. In this study, the Hermitian polynomial approximation is used for fast evaluation of the associated Legendre functions (ALFs). It has lots of applications in geodesy and geophysics. This method approximates the ALFs instead of computing them by recursive formulae and generate them several times faster. The approximated ALFs by the Newtonian polynomials are compared with Hermitian ones and their differences are discussed. Here, this approach is applied for computing a global geoid model point-wise from EGM08 to degree and order 2160 and in propagating the orbit of a low Earth orbiting satellite. Our numerical results show that the CPU-time decreases at least two times for orbit propagation, and five times for geoid computation comparing to the case where recursive formulae for generation of ALFs are used. The approximation error in the orbit computation is at a sub-millimeter level over two weeks and that the computed geoid 0.01 mm, with a maximum of 1 mm.
Polynomial approximation for fast generation of associated Legendre functions
Seif, M. R. (Autor:in) / Sharifi, M. A. (Autor:in) / Eshagh, M. (Autor:in)
2018
Aufsatz (Zeitschrift)
Englisch
Best Polynomial Approximation in Sobolev-Laguerre and Sobolev-Legendre Spaces
British Library Online Contents | 2002
|Sine series expansion of associated Legendre functions
Online Contents | 2015
|Recurrence relations for integrals of Associated Legendre functions
Online Contents | 1978
|The integral formulas of the associated Legendre functions
Online Contents | 2011
|The integral formulas of the associated Legendre functions
Online Contents | 2011
|