𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for nonequispaced Fourier transforms on the rotation group

✍ Scribed by Daniel Potts; Jürgen Prestin; Antje Vollrath

Publisher
Springer US
Year
2009
Tongue
English
Weight
536 KB
Volume
52
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A high-performance fast Fourier transfor
A high-performance fast Fourier transform algorithm for the Cray-2
✍ David H. Bailey 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 660 KB

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d

Algorithms for solving Hermite interpola
Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform
✍ Elías Berriochoa; Alicia Cachafeiro 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 297 KB

We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of pro