Projects per year
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 language | English |
---|---|
Journal | Numerical Algorithms |
Volume | 52 |
Issue number | 3 |
Pages (from-to) | 355-384 |
Number of pages | 30 |
ISSN | 1017-1398 |
DOIs | |
Publication status | Published - 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.Projects
- 1 Finished
-
Graduate School GSC 235: Graduate School for Computing in Medicine and Life Sciences
Schweikard, A., Anders, S., Barkhausen, J., Buzug, T., Erdmann, J., Fischer, B., Fischer, S., Habermann, J. K., Hartmann, E., Hilgenfeld, R., Hofmann, U., Klein, C., Kruse, C., Marshall, L., Martinetz, T., Mertins, A., Münte, T., Oltmanns, K., Schneider, S., Schunkert, H., Sczakiel, G., Tronnier, V. M., Vogel, A., Westermann, J. & Zillikens, D.
01.11.07 → 31.12.14
Project: DFG Projects › DFG Joint Research: Research Training Groups