✦ LIBER ✦

The use of symmetry with the fast Fourier algorithm

✍ Scribed by Bantz, D. A. ;Zwick, M.

Book ID: 114521600
Publisher: International Union of Crystallography
Year: 1974
Weight: 467 KB
Volume: 30
Category: Article
ISSN: 0567-7394
DOI: 10.1107/s0567739474000520

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multidimensional fast Fourier transform

Multidimensional fast Fourier transform algorithm for signals with arbitrary symmetries

✍ Bernardini, R.; Cortelazzo, G.; Mian, G. A. 📂 Article 📅 1999 🏛 Optical Society of America 🌐 English ⚖ 324 KB

A comparison of the fast Fourier and tri

A comparison of the fast Fourier and trigonometric Fourier algorithms

✍ Hubbard, C. R. ;Quicksall, C. O. ;Jacobson, R. A. 📂 Article 📅 1972 🏛 International Union of Crystallography 🌐 English ⚖ 217 KB

The re-discovery of the fast Fourier tra

The re-discovery of the fast Fourier transform algorithm

✍ Cooley, James W. 📂 Article 📅 1987 🏛 Springer-Verlag ⚖ 940 KB

Fractional-Fourier-transform calculation

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm

✍ García, Javier ;Mas, David ;Dorsch, Rainer G. 📂 Article 📅 1996 🏛 The Optical Society 🌐 English ⚖ 327 KB

Reduction to the magnetic pole using a f

Reduction to the magnetic pole using a fast fourier series algorithm

✍ C. Patrick Ervin 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 411 KB

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