A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- 1 September 1988
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 28 (3) , 659-670
- https://doi.org/10.1007/bf01941141
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed ProblemsSIAM Journal on Scientific and Statistical Computing, 1981
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a MatrixACM Transactions on Mathematical Software, 1981
- Some Superlinear Convergence Results for the Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1980
- A new look at the Lanczos algorithm for solving symmetric systems of linear equationsLinear Algebra and its Applications, 1980
- The block conjugate gradient algorithm and related methodsLinear Algebra and its Applications, 1980
- Generalized Cross-Validation as a Method for Choosing a Good Ridge ParameterTechnometrics, 1979
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed ProblemsSIAM Review, 1979
- Algorithms for the regularization of ill-conditioned least squares problemsBIT Numerical Mathematics, 1977
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric MatrixIMA Journal of Applied Mathematics, 1976