Fast algorithms for spherical harmonic expansions, III

Details Fast algorithms for spherical harmonic expansions, III Fast algorithms for spherical harmonic expansions, III

2009-10-28

arxiv.org/abs/0910.5435v6

Fast algorithms for spherical harmonic expansions, III, Journal of Computational Physics, 229 (18): 6181-6192, 2010

Computer Science

Numerical Analysis

14 pages, 1 figure, 6 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast algorithms for spherical harmonic expansions, III does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast algorithms for spherical harmonic expansions, III, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast algorithms for spherical harmonic expansions, III will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718527