Papers › Numerical Algorithms for the Computation of Generalized Prolate Spheroidal Functions

Numerical Algorithms for the Computation of Generalized Prolate Spheroidal Functions

8 Oct 2017arXiv:1710.02874links table onlyarchive 2025-07-28

Roy R. Lederman

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.

Generalized Prolate Spheroidal Functions (GPSF) are the eigenfunctions of the truncated Fourier transform, restricted to D-dimensional balls in the spatial domain and frequency domain. Despite their useful properties in many applications, GPSFs are often replaced by crude approximations. The purpose of this paper is to review the elements of computing GPSFs and associated eigenvalues. This paper is accompanied by open-source code.

PaperPDFCode

Code

lederman/Prol officialmentioned in papermentioned on GitHub report
GothamBatman/PSWF2 mentioned on GitHub report

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