A new algorithm for the nonequispaced fast Fourier transform on the rotation group
DOI10.1137/110835232zbMATH Open1259.65224OpenAlexW2025757772MaRDI QIDQ4903733FDOQ4903733
Authors: Jens Keiner, Antje Vollrath 
Publication date: 24 January 2013
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/767e0903358a57481a140901f17239994f3c6860
Recommendations
numerical examplesfast Fourier transformnonequispaced fast Fourier transformrotation groupdivide-and-conquer algorithmsemiseparable matrixfast and numerically stable algorithmnonequispaced discrete SO(3) Fourier transformsymmetric semiseparable eigenproblemWigner-\(d\) functions
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical methods for discrete and fast Fourier transforms (65T50) Other transformations of harmonic type (42C20)
Cited In (7)
- Nonuniform Fourier transforms for rigid-body and multidimensional rotational correlations
- Irregular sampling of band-limited functions on the sphere
- Fast global optimization on the torus, the sphere, and the rotation group
- Stability results for scattered data interpolation on the rotation group
- Algorithms for fast convolutions on motion groups
- On the equivalence of non-iterative transformation methods based on scaling and spiral groups
- The concept of resolution in the domain of rotations
Uses Software
This page was built for publication: A new algorithm for the nonequispaced fast Fourier transform on the rotation group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903733)
