Fast algorithms for spherical harmonic expansions, II

JOURNAL OF COMPUTATIONAL PHYSICS

卷:227

Article

Tygert, Mark

关键词: fast;    algorithm;    spherical harmonic;    transform;    special function;    FFT;    recurrence;    spectral;   

DOI  :  10.1016/j.jcp.2007.12.019

来源: Elsevier

【 摘 要 】

We provide an efficient algorithm for calculating, at appropriately chosen points on the two-dimensional surface of the unit sphere in R-3, the values of functions that are specified by their spherical harmonic expansions (a procedure known as the inverse spherical harmonic transform). We also provide an efficient algorithm for calculating the coefficients in the spherical harmonic expansions of functions that are specified by their values at these appropriately chosen points (a procedure known as the forward spherical harmonic transform). The algorithms are numerically stable, and, if the number of points in our standard tensor-product discretization of the surface of the sphere is proportional to l(2), then the algorithms have costs proportional to l(2) ln(l) at any fixed precision of computations. Several numerical examples illustrate the performance of the algorithms. (C) 2007 Elsevier Inc. All rights reserved.

【 授权许可】

Free