A fast algorithm for nonequispaced Fourier transforms on the rotation group

Daniel Potts*, Jürgen Prestin, Antje Vollrath

*Corresponding author for this work
22 Citations (Scopus)

Abstract

In this paper we present algorithms to calculate the fast Fourier synthesis and its adjoint on the rotation group SO(3) for arbitrary sampling sets. They are based on the fast Fourier transform for nonequispaced nodes on the three-dimensional torus. Our algorithms evaluate the SO(3) Fourier synthesis and its adjoint, respectively, of B-bandlimited functions at M arbitrary input nodes in O(M+B4) or even O(M + B3 log2 B) flops instead of O(MB3). Numerical results will be presented establishing the algorithm's numerical stability and time requirements.

Original languageEnglish
JournalNumerical Algorithms
Volume52
Issue number3
Pages (from-to)355-384
Number of pages30
ISSN1017-1398
DOIs
Publication statusPublished - 01.10.2009

Fingerprint

Dive into the research topics of 'A fast algorithm for nonequispaced Fourier transforms on the rotation group'. Together they form a unique fingerprint.

Cite this