An implicit shift bidiagonalization algorithm for ill-posed systems
- 1 December 1994
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 34 (4) , 510-534
- https://doi.org/10.1007/bf01934265
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problemsNumerical Algorithms, 1994
- Analysis of Discrete Ill-Posed Problems by Means of the L-CurveSIAM Review, 1992
- Accelerated Landweber iterations for the solution of ill-posed equationsNumerische Mathematik, 1991
- Accurate Singular Values of Bidiagonal MatricesSIAM Journal on Scientific and Statistical Computing, 1990
- A fast ?Monte-Carlo cross-validation? procedure for large least squares problems with noisy dataNumerische Mathematik, 1989
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equationsBIT Numerical Mathematics, 1988
- CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR COMPACT OPERATORSPublished by Elsevier ,1987
- ON ILL-POSED PROBLEMS AND THE METHOD OF CONJUGATE GRADIENTSPublished by Elsevier ,1987
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a MatrixACM Transactions on Mathematical Software, 1981
- Generalized Cross-Validation as a Method for Choosing a Good Ridge ParameterTechnometrics, 1979