Implicitly restarting the LSQR algorithm

zbMath1295.65040MaRDI QIDQ2510849

Daniel J. Richmond, James Baglama

Publication date: 4 August 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol42/abstract_vol42_pp85-105.html

zbMATH Keywords

convergencenumerical examplesiterative methodharmonic Ritz valuesKrylov subspaceGolub-Kahan bidiagonalizationlarge-scale computationimplicit restartingleast squares restarted algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items (1)

Hybrid iterative refined restarted Lanczos bidiagonalization methods

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection
• LSMR

This page was built for publication: Implicitly restarting the LSQR algorithm