The fast Fourier transform method and ill-conditioned matrices

DOI10.1016/S0096-3003(99)00171-XzbMath1023.65021OpenAlexW2064496219MaRDI QIDQ5931680

David W. Kammler, Boon Yi Soon, Paul W. Eloe

Publication date: 25 April 2001

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(99)00171-x

zbMATH Keywords

comparison of methodslinear systemcondition numberGaussian eliminationfast Fourier transform methodill-conditioned matrixQR methodsingular value decomposition method

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for discrete and fast Fourier transforms (65T50) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpretation and solution of ill-conditioned equations arising in parameter estimation and system identification
• Accelerated Landweber iterations for the solution of ill-posed equations
• A unified approach to solving ill-conditioned matrix problems
• Theory and Methods Related to the Singular-Function Expansion and Landweber’s Iteration for Integral Equations of the First Kind
• Parallel algorithm for householder transformation with applications to Ill-conditioned problems
• On solving linear algebraic equations with an ill-conditioned matrix
• An Algorithm for the Machine Calculation of Complex Fourier Series