Fast algorithms for spherical harmonic expansions. III
type: Item
instance of: scholarly article
title: Fast algorithms for spherical harmonic expansions. III
zbMATH Open document ID: 1201.65037
author: Mark Tygert
published in: Journal of Computational Physics
publication date: 2010-09-13T00:00:00Z
review text: The butterfly algorithm was introduced by \textit{E. Michielsson} and \textit{A. Boag} [IEEE Trans. Antennas Propag., 44, No. 8, 1086--1093 (1996)] and by \textit{M. O'Neil}, \textit{F. Woolfe} and \textit{V. Rokhkin} [Appl. Comput. Harmon. Anal. 28, No. 2, 203--226 (2010; Zbl 1191.65016)]. The present paper uses the butterfly method in order to accelerate spherical harmonic transforms. This method does not require the use of extended precision arithmetic in order to attain accuracy very close to the machine precision, not even in its precomputations, unlike the alternative approach taken in its predecessor [J. Comput. Phys. 227, No. 8, 4260--4279 (2008; Zbl 1147.65111)].
reviewed by: Ferenc Móricz
Mathematics Subject Classification ID: 65D20
zbMATH DE Number: 5784795
zbMATH Keywords: butterfly
zbMATH Keywords: algorithm
zbMATH Keywords: spherical harmonic
zbMATH Keywords: transform
zbMATH Keywords: interpolative decomposition
describes a project that uses: SPHEREPACK
MaRDI profile type: Publication
full work available at URL: j.jcp.2010.05.004
OpenAlex ID: W4233363368
cites work: Q3331506
cites work: A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators
cites work: On the Compression of Low Rank Matrices
cites work: The maximal-volume concept in approximation by low-rank matrices
cites work: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
cites work: On interpolation and integration in finite-dimensional spaces of bounded functions
cites work: An algorithm for the rapid evaluation of special function transforms
cites work: Generalized discrete spherical harmonic transforms
cites work: Fast algorithms for spherical harmonic expansions. II.
cites work: Incomplete cross approximation in the mosaic-skeleton method
cites work: Sparse Fourier Transform via Butterfly Algorithm
DOI: 10.1016/J.JCP.2010.05.004
description: scientific article; zbMATH DE number 5784795