Indexing in the Good-Thomas fast Fourier transform algorithm

DOI10.1134/S0965542524702099MaRDI QIDQ6986227zbMATH OpenFDO

Authors M. S. Bespalov

Publication date 12 May 2025

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542524702099

zbMATH Keywords

array indexingdiscrete Fourier transformfast algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cites work

• A note on prime factor FFT algorithms
• An in-place, in-order prime factor FFT algorithm
• Generalization of the fast Fourier transform with a constant structure
• scientific article; zbMATH DE number 3140885 (Why is no real title available?)
• scientific article; zbMATH DE number 3155184 (Why is no real title available?)
• scientific article; zbMATH DE number 3928865 (Why is no real title available?)
• scientific article; zbMATH DE number 1111784 (Why is no real title available?)
• New Good's type Kronecker power expansions
• On the properties of a new tensor product of matrices

This page was built for publication: Indexing in the Good-Thomas fast Fourier transform algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986227)