The fast Fourier transform method and ill-conditioned matrices
DOI10.1016/S0096-3003(99)00171-XzbMath1023.65021MaRDI 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
comparison of methods; linear system; condition number; Gaussian elimination; fast Fourier transform method; ill-conditioned matrix; QR method; singular value decomposition method
65F22: Ill-posedness and regularization problems in numerical linear algebra
65F35: Numerical computation of matrix norms, conditioning, scaling
65T50: Numerical methods for discrete and fast Fourier transforms
65F05: Direct numerical methods for linear systems and matrix inversion
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item