scientific article; zbMATH DE number 3581612

MaRDI QIDQ4151158zbMATH OpenFDO

Authors

Publication date 1975

zbMATH Keywords

computational complexityCooley-Tukey algorithm of fast Fourier transformations (FFT)system of linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Computational Complexity and Numerical Stability of Linear Problems
• Computational aspects of fast Fourier transformation
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Complexity of Solving Linear Systems in Different Models of Computation
• On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems

Cited in

(1)

• Computational Complexity and Numerical Stability of Linear Problems

This page was built for publication:

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