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

DOI10.1016/S0010-4655(98)00110-6MaRDI QIDQ1808004zbMATH OpenOpenAlexWikidataFDO

Authors 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 formscombine-and-conquer strategiesdecimation in frequencydecimation in timedivide-and-conquer algorithmsfast Fourier transform

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3956396
• The Fast Fourier Transform
• The techniques of the generalized fast Fourier transform algorithm
• scientific article; zbMATH DE number 4024740

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• scientific article; zbMATH DE number 108391 (Why is no real title available?)
• scientific article; zbMATH DE number 1023682 (Why is no real title available?)
• In-place self-sorting fast Fourier transform algorithm with local memory references

Cited in

(3)

• scientific article; zbMATH DE number 4176354 (Why is no real title available?)
• Fast envelope algorithms
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy

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

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