Pith. sign in

REVIEW 1 cited by

Fast algorithms for spherical harmonic expansions, III

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0910.5435 v6 pith:ARNSWBX4 submitted 2009-10-28 cs.NA cs.NA

classification cs.NA
keywords harmonicsphericalalgorithmsexpansionsfasttraversalacceleratealternative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the second paper from this series on "Fast algorithms for spherical harmonic expansions." The requisite precomputations become manageable when organized as a "depth-first traversal" of the program's control-flow graph, rather than as the perhaps more natural "breadth-first traversal" that processes one-by-one each level of the multilevel procedure. We illustrate the results via several numerical examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simulating Partial Sky Cosmic Microwave Background Maps with 3D Fast Fourier Transforms

    astro-ph.CO 2025-07 conditional novelty 6.0 of 10

    A 3D fast Fourier transform method with a linear-programming-derived power spectrum simulates CMB maps on partial-sky patches, with operation-count scaling suggesting speed advantages over HEALPix for some survey sizes.

Pith tools