Fast algorithms for spherical harmonic expansions. III (Q995237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms for spherical harmonic expansions. III |
scientific article; zbMATH DE number 5784795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for spherical harmonic expansions. III |
scientific article; zbMATH DE number 5784795 |
Statements
Fast algorithms for spherical harmonic expansions. III (English)
0 references
13 September 2010
0 references
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)].
0 references
butterfly
0 references
algorithm
0 references
spherical harmonic
0 references
transform
0 references
interpolative decomposition
0 references
0.8691540956497192
0 references
0.8543375730514526
0 references
0.8406225442886353
0 references
0.8382771015167236
0 references
0.8248310089111328
0 references
