AbstractConsider the linear least squares problem minx‖Ax−b‖2. When A is large and sparse, then often only the R-factor in the QR factorization of A is known.The solution x can then be computed from the seminormal equations RTRx = ATb. For this method the error in x is shown to be of the same order as for the method of normal equations. We show that by adding a correction step using only single precision we get a method which under mild conditions is as accurate as the QR method. The application of this method to the updating of a sparse R-factor of A when appending a column is discussed
AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse m...
The minimal 2-norm solution to an underdetermined system $Ax = b$ of full rank can be computed using...
Abstract In this article, we present a QR updating procedure as a solution approach for linear least...
AbstractWe examine a direct method based on an LU decomposition of the rectangular coefficient matri...
AbstractWe describe a direct method for solving sparse linear least squares problems. The storage re...
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and least-squares ...
Iterative refinement is a well-known technique for improving the quality of an approximate solution ...
We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {par...
The solution of nearly square overdetermined linear systems is studied. The sparse QR technique is c...
In this paper we study how to update the solution of the linear system Ax = b after the matrix A is ...
International audienceIn this paper, we are interested in computing the solution of an overdetermine...
In recent years, a variety of preconditioners have been proposed for use in solving large sparse li...
Iterative refinement is a long-standing technique for improving the accuracy of a computed solution ...
The efficient solution of the normal equations corresponding to a large sparse linear least squares ...
We address the problem of solving linear least-squares problems min——Ax−b—— when A is a sparse m-by-...
AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse m...
The minimal 2-norm solution to an underdetermined system $Ax = b$ of full rank can be computed using...
Abstract In this article, we present a QR updating procedure as a solution approach for linear least...
AbstractWe examine a direct method based on an LU decomposition of the rectangular coefficient matri...
AbstractWe describe a direct method for solving sparse linear least squares problems. The storage re...
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and least-squares ...
Iterative refinement is a well-known technique for improving the quality of an approximate solution ...
We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {par...
The solution of nearly square overdetermined linear systems is studied. The sparse QR technique is c...
In this paper we study how to update the solution of the linear system Ax = b after the matrix A is ...
International audienceIn this paper, we are interested in computing the solution of an overdetermine...
In recent years, a variety of preconditioners have been proposed for use in solving large sparse li...
Iterative refinement is a long-standing technique for improving the accuracy of a computed solution ...
The efficient solution of the normal equations corresponding to a large sparse linear least squares ...
We address the problem of solving linear least-squares problems min——Ax−b—— when A is a sparse m-by-...
AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse m...
The minimal 2-norm solution to an underdetermined system $Ax = b$ of full rank can be computed using...
Abstract In this article, we present a QR updating procedure as a solution approach for linear least...