On the convergence of the Bl-LSQR algorithm for solving matrix equations

DOI10.1080/00207160903365883zbMath1220.65039OpenAlexW2002245462MaRDI QIDQ5391474

Faezeh Toutounian, Saeed Karimi

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903365883

zbMATH Keywords

iterative methodblock methodsmultiple right-hand sidesLSQRBl-LSQR

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

A novel class of block methods based on the blockAA^T-Lanczos bi-orthogonalization process for matrix equations

Cites Work

• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• The block conjugate gradient algorithm and related methods
• Smoothing iterative block methods for linear systems with multiple right-hand sides
• The block Lanczos method for linear systems with multiple right-hand sides
• The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• A Stabilized QMR Version of Block BiCG
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme