The LSQR iterative method for solving least-squares problems may require many iterations to determine an approximate solution with desired accuracy. This often depends on the fact that singular vector components of the solution associated with small singular values of the matrix require many iterations to be determined. Augmentation of Krylov subspaces with harmonic Ritz vectors often makes it possible to determine the singular vectors associated with small singular values with fewer iterations than without augmentation. This paper describes how Krylov subspaces generated by the LSQR iterative method can be conveniently augmented with harmonic Ritz vectors. Computed examples illustrate the competitiveness of the augmented LSQR method propos...
There is a class of linear problems for which a matrix-vector product is very time consuming to comp...
Regularization of certain linear discrete ill-posed problems, as well as of certain regression probl...
summary:Hybrid LSQR represents a powerful method for regularization of large-scale discrete inverse ...
The LSQR iterative method for solving least-squares problems may require many iterations to determin...
The LSQR algorithm is a popular Krylov subspace method for obtaining solutions to large-scale least-...
The LSQR algorithm is a popular Krylov subspace method for obtaining solutions to large–scale least–...
The LSQR algorithm is a popular method for solving least-squares problems. For some matrices, LSQR m...
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and least-squares ...
We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {par...
In this paper we study how to update the solution of the linear system Ax = b after the matrix A is ...
Aggressive early deflation has proven to significantly enhance the convergence of the QR algorithm f...
AbstractWe describe a modification of the conjugate gradient method for the normal equations (CGNR) ...
The GMRES method is an iterative method that provides better solutions when dealing with large linea...
In recent years, a variety of preconditioners have been proposed for use in solving large sparse li...
AbstractThe solution of large linear discrete ill-posed problems by iterative methods continues to r...
There is a class of linear problems for which a matrix-vector product is very time consuming to comp...
Regularization of certain linear discrete ill-posed problems, as well as of certain regression probl...
summary:Hybrid LSQR represents a powerful method for regularization of large-scale discrete inverse ...
The LSQR iterative method for solving least-squares problems may require many iterations to determin...
The LSQR algorithm is a popular Krylov subspace method for obtaining solutions to large-scale least-...
The LSQR algorithm is a popular Krylov subspace method for obtaining solutions to large–scale least–...
The LSQR algorithm is a popular method for solving least-squares problems. For some matrices, LSQR m...
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and least-squares ...
We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {par...
In this paper we study how to update the solution of the linear system Ax = b after the matrix A is ...
Aggressive early deflation has proven to significantly enhance the convergence of the QR algorithm f...
AbstractWe describe a modification of the conjugate gradient method for the normal equations (CGNR) ...
The GMRES method is an iterative method that provides better solutions when dealing with large linea...
In recent years, a variety of preconditioners have been proposed for use in solving large sparse li...
AbstractThe solution of large linear discrete ill-posed problems by iterative methods continues to r...
There is a class of linear problems for which a matrix-vector product is very time consuming to comp...
Regularization of certain linear discrete ill-posed problems, as well as of certain regression probl...
summary:Hybrid LSQR represents a powerful method for regularization of large-scale discrete inverse ...