Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
From MaRDI portal
Publication:2507839
DOI10.1016/j.amc.2005.11.065zbMath1100.65039MaRDI QIDQ2507839
Faezeh Toutounian, Saeed Karimi
Publication date: 5 October 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.065
numerical experiments; iterative methods; sparse matrices; recurrence formula; multiple right-hand sides; bidiagonalization; LSQR method
65F50: Computational methods for sparse matrices
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
LSQR iterative method for generalized coupled Sylvester matrix equations, LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\), The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense, A solver combining reduced basis and convergence acceleration with applications to non‐linear elasticity
Uses Software
Cites Work
- Unnamed Item
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Global FOM and GMRES algorithms for matrix equations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Block Krylov subspace methods for solving large Sylvester equations