scientific article
From MaRDI portal
Publication:3974366
zbMATH Open0753.65102MaRDI QIDQ3974366
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmcomputational efficiencymultidimensional discrete Fourier transformnumber of multiplicationsmultidimensional fast Fourier transform
Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
On computing the discrete Fourier and cosine transforms ⋮ A new multidimensional FFT based on one-dimensional decompositions
This page was built for publication:
