FFT-Based Preconditioners for Toeplitz-Block Least Squares Problems
- 1 December 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 30 (6) , 1740-1768
- https://doi.org/10.1137/0730089
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Circulant preconditioners for Toeplitz-block matricesNumerical Algorithms, 1994
- Circulant Preconditioned Toeplitz Least Squares IterationsSIAM Journal on Matrix Analysis and Applications, 1994
- A Family of Block Preconditioners for Block SystemsSIAM Journal on Scientific and Statistical Computing, 1992
- Circulant Preconditioners Constructed from KernelsSIAM Journal on Numerical Analysis, 1992
- Design and analysis of Toeplitz preconditionersIEEE Transactions on Signal Processing, 1992
- Accelerated Landweber iterations for the solution of ill-posed equationsNumerische Mathematik, 1991
- Iterative methods for image deblurringProceedings of the IEEE, 1990
- An Optimal Circulant Preconditioner for Toeplitz SystemsSIAM Journal on Scientific and Statistical Computing, 1988
- On the rate of convergence of the preconditioned conjugate gradient methodNumerische Mathematik, 1986
- An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1984