LSMR (Least Squares Minimal Residual) is an iterative method for the solution of the linear system of equations and least-squares problems. This paper presents a block version of the LSMR algorithm for solving linear systems with multiple right-hand...

linear systems with multiple right-hand sides. In general, the block solvers are more suitable for dense systems with preconditioner. In this paper, we present a novel block LSMR (least squares minimal residual) algorithm for solving non-symmetric linear...

In this paper, we propose a new method for solving general linear systems with several right-hand sides. This method is based on global least squares method and reduces the original matrix to the lower bidiagonal form. We ...

The global solvers are an attractive class of iterative solvers for solving linear systems with

multiple right-hand sides. In this paper, first, a new global method for solving general linear

systems with several right-hand sides...

Karimi and Toutounian [The block least squares method for solving nonsymmetric linear system with

multiple right-hand sides, Appl. Math. Comput. 177 (2006), pp. 852–862], proposed a block version of the

LSQR algorithm, say Bl...

. On dense matrices,

the CMRH method is less expensive and requires less storage than other Krylov methods.

This paper presents a block version of the CMRH algorithm for solving linear systems with

multiple right-hand sides. The new...

Block Krylov subspace methods are the most popular algorithms for solving large nonsymmetric

linear systems with multiple right-hand sides. One of them is the block CMRH

method. This method generates a (non orthogonal) basis...