✦ LIBER ✦

Fast and stable algorithms for discrete spherical Fourier transforms

✍ Scribed by Daniel Potts; Gabriele Steidl; Manfred Tasche

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 829 KB
Volume: 275-276
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10013-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast and numerically stable algorithms f

Fast and numerically stable algorithms for discrete cosine transforms

✍ Gerlind Plonka; Manfred Tasche 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 477 KB

New algorithms for calculating discrete

New algorithms for calculating discrete fourier transforms

✍ A.M. Grigoryan 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 516 KB

Fast mersenne number transforms for the

Fast mersenne number transforms for the computation of discrete fourier transforms

✍ Wan-Chi Siu; A.G. Constantinides 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Fast computation algorithm for the discr

Fast computation algorithm for the discrete Fourier transform of a real-valued sequence

✍ Mamoru Tsuchiya 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 986 KB

Vector coding algorithms for multidimens

Vector coding algorithms for multidimensional discrete Fourier transform

✍ Zhaodou Chen; Lijing Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Coole

A fast algorithm for the discrete laplac

A fast algorithm for the discrete laplace transformation

✍ V Rokhlin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 785 KB