A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing

DOI10.1007/s002110050074zbMath0808.65145OpenAlexW2037026538WikidataQ56235046 ScholiaQ56235046MaRDI QIDQ1338818

Markus Hegland

Publication date: 21 November 1994

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050074

zbMATH Keywords

parallel processingmatrix factorizationmatrix multiplicationmixed-radix representationfast Fourier transform algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Related Items (2)

Superfast Fourier transform using QTT approximation ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references

This page was built for publication: A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing