A New Algorithm for the Nonequispaced Fast Fourier Transform on the Rotation Group
DOI10.1137/110835232zbMath1259.65224MaRDI QIDQ4903733
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
numerical examples; fast Fourier transform; rotation group; nonequispaced fast Fourier transform; divide-and-conquer algorithm; semiseparable matrix; fast and numerically stable algorithm; nonequispaced discrete SO(3) Fourier transform; symmetric semiseparable eigenproblem; Wigner-\(d\) functions
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
42C10: Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.)
65T50: Numerical methods for discrete and fast Fourier transforms
42C20: Other transformations of harmonic type
Related Items
Uses Software