2002
DOI: 10.1007/s00190-002-0216-2
|View full text |Cite
|
Sign up to set email alerts
|

A unified approach to the Clenshaw summation and the recursive computation of very high degree and order normalised associated Legendre functions

Abstract: Abstract. Spherical harmonic expansions form partial sums of fully normalised associated Legendre functions (ALFs). However, when evaluated increasingly close to the poles, the ultra-high degree and order (eg. 2700) ALFs range over thousands of orders of magnitude. This causes existing recursion techniques for computing values of individual ALFs and their derivatives to fail. A common solution in geodesy is to evaluate these expansions using Clenshaw's (1955) method, which does not compute individual ALFs or t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
102
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 168 publications
(102 citation statements)
references
References 13 publications
0
102
0
Order By: Relevance
“…The numerical stability and accuracy of the normalized associated Legendre functions presented in Eq. 1 is a critical computing problem (Bosch 2000, Claessens 2005, Montenbruck and Gill 2000, especially in the case of very high degree and order (Wittwer et al 2008, Holmes andFeatherstone 2002). The numerical stability is treated here by implementing appropriate recurrence relations into our source code that are recommended for this purpose (Montenbruck and Gill 2000).…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…The numerical stability and accuracy of the normalized associated Legendre functions presented in Eq. 1 is a critical computing problem (Bosch 2000, Claessens 2005, Montenbruck and Gill 2000, especially in the case of very high degree and order (Wittwer et al 2008, Holmes andFeatherstone 2002). The numerical stability is treated here by implementing appropriate recurrence relations into our source code that are recommended for this purpose (Montenbruck and Gill 2000).…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…This strategy of biasing the EXPONENT is independent of the colatitude θ which is very important in this context. The literature on computing very high degree spherical harmonics contains numerous strategies such as using the Clenshaw summation approach [13], preconditioning the variable with 10 280 sinθ in SHTools [19], modifying the recursion to avoid high powers of sinθ [14], and others. These modifications have been reported to achieve degrees around 2700-2800 in synthesis computations [13,14] and in synthesis and analysis [19].…”
Section: Numerical Preconditioning and Optimizationmentioning
confidence: 99%
“…The literature on computing very high degree spherical harmonics contains numerous strategies such as using the Clenshaw summation approach [13], preconditioning the variable with 10 280 sinθ in SHTools [19], modifying the recursion to avoid high powers of sinθ [14], and others. These modifications have been reported to achieve degrees around 2700-2800 in synthesis computations [13,14] and in synthesis and analysis [19]. Notice that in synthesis only computations, it is only necessary to avoid underflows and set the corresponding incremental contributions to zero while in synthesis and analysis computations, the numerical recovery of the input spectral coefficients is expected in addition to avoiding possible underflows.…”
Section: Numerical Preconditioning and Optimizationmentioning
confidence: 99%
See 2 more Smart Citations