What is it about?

In this paper we present an algorithm for the fast Fourier transform on the rotation group SO(3) which is based on the fast Fourier transform for nonequispaced nodes on the three-dimensional torus. This algorithm allows to evaluate the SO(3) Fourier transform of B-band-limited functions at M arbitrary input nodes in O(M + B3 log2 B) flops instead of O(MB3). Some numerical results will be presented establishing the algorithm's numerical stability and time requirements.

Featured Image

Read the Original

This page is a summary of: A fast algorithm for nonequispaced Fourier transforms on the rotation group, Numerical Algorithms, March 2009, Springer Science + Business Media,
DOI: 10.1007/s11075-009-9277-0.
You can read the full text:

Read

Contributors

The following have contributed to this page