Efficient Computation of Slepian Functions for Arbitrary Regions on the Sphere
Alice P. Bates, Zubair Khalid, Rodney A. Kennedy

TL;DR
This paper introduces a fast, memory-efficient method for computing Slepian functions on the sphere for arbitrary regions, enabling analysis of large-band datasets with reduced computational resources.
Contribution
It develops an approximate computation technique for Slepian functions over arbitrary regions based on polar cap solutions, supported by a fast algorithm and accuracy analysis.
Findings
Faster computation of Slepian functions demonstrated.
Reduced memory storage requirements achieved.
Accurate approximation for large band-limits shown.
Abstract
In this paper, we develop a new method for the fast and memory-efficient computation of Slepian functions on the sphere. Slepian functions, which arise as the solution of the Slepian concentration problem on the sphere, have desirable properties for applications where measurements are only available within a spatially limited region on the sphere and/or a function is required to be analyzed over the spatially limited region. Slepian functions are currently not easily computed for large band-limits for an arbitrary spatial region due to high computational and large memory storage requirements. For the special case of a polar cap, the symmetry of the region enables the decomposition of the Slepian concentration problem into smaller subproblems and consequently the efficient computation of Slepian functions for large band-limits. By exploiting the efficient computation of Slepian functions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
