Papers › Fast Summation on the Sphere with Applications to the Barotropic Vorticity Equation
Fast Summation on the Sphere with Applications to the Barotropic Vorticity Equation
Anthony Chen, Christiane Jablonowski
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Fast summation refers to a family of techniques for approximating O(N²) sums in O(NlogN) or O(N) time. These techniques have traditionally found wide use in astrophysics and electrostatics in calculating the forces in a N-body problem. In this work, we present a spherical tree code, and apply it to the problem of efficiently solving the barotropic vorticity equation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections