A new algorithm for the nonequispaced fast Fourier transform on the rotation group

DOI10.1137/110835232zbMATH Open1259.65224OpenAlexW2025757772MaRDI QIDQ4903733FDOQ4903733

Antje Vollrath, Jens Keiner

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

• A fast algorithm for nonequispaced Fourier transforms on the rotation group
• Fast Fourier transforms for nonequispaced data. II
• FFTs on the rotation group
• scientific article; zbMATH DE number 1284007
• Fast summation of functions on the rotation group

zbMATH Keywords

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

Mathematics Subject Classification ID

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 (4)

• Irregular sampling of band-limited functions on the sphere
• Algorithms for fast convolutions on motion groups
• Fast Global Optimization on the Torus, the Sphere, and the Rotation Group
• On the equivalence of non-iterative transformation methods based on scaling and spiral groups

Uses Software

• FFTW
• NFFT3
• MPACK

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)