Fast algorithms through divide- and combine-and-conquer strategies

DOI10.1016/S0010-4655(98)00110-6zbMath1001.65149OpenAlexW1988834137WikidataQ126850109 ScholiaQ126850109MaRDI QIDQ1808004

José M. Pérez-Jordá

Publication date: 30 November 1999

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4655(98)00110-6

zbMATH Keywords

canonical formsfast Fourier transformdecimation in frequencydivide-and-conquer algorithmscombine-and-conquer strategiesdecimation in time

Mathematics Subject Classification ID

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

Cites Work

• In-place self-sorting fast Fourier transform algorithm with local memory references
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms through divide- and combine-and-conquer strategies