Published in

Association for Computing Machinery (ACM), ACM Transactions on Mathematical Software, 4(47), p. 1-24, 2021

DOI: 10.1145/3458470

Links

Tools

Export citation

Search in Google Scholar

Algorithm 1018: FaVeST—Fast Vector Spherical Harmonic Transforms

Journal article published in 2021 by Quoc T. Le Gia, Ming Li ORCID, Yu Guang Wang ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Vector spherical harmonics on the unit sphere of ℝ 3 have broad applications in geophysics, quantum mechanics, and astrophysics. In the representation of a tangent vector field, one needs to evaluate the expansion and the Fourier coefficients of vector spherical harmonics. In this article, we develop fast algorithms (FaVeST) for vector spherical harmonic transforms on these evaluations. The forward FaVeST evaluates the Fourier coefficients and has a computational cost proportional to N log √ N for N number of evaluation points. The adjoint FaVeST, which evaluates a linear combination of vector spherical harmonics with a degree up to ⊡ M for M evaluation points, has cost proportional to M log √ M . Numerical examples of simulated tangent fields illustrate the accuracy, efficiency, and stability of FaVeST.