arrow
返回

LSMR: AN ITERATIVE ALGORITHM FOR SPARSE LEAST-SQUARES PROBLEMS

delete2011-01-01
delete339
delete
OA
AI
D
David Chin-Lung Fong *
M
Michael A. Saunders
DOI:10.1137/10079687Xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
An iterative method LSMR is presented for solving linear systems Ax - b and least-squares problems min parallel to Ax-b parallel to(2), with A being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation A(T)Ax = A(T)b, so that the quantities parallel to A(T)r(k)parallel to are monotonically decreasing (where r(k) = b - Ax(k) is the residual for the current iterate x(k)). We observe in practice that parallel to r(k)parallel to also decreases monotonically, so that compared to LSQR (for which only parallel to r(k)parallel to is monotonic) it is safer to terminate LSMR early. We also report some experiments with reorthogonalization.
Keyword:
least-squares problem
sparse matrix
LSQR
MINRES
Krylov subspace method
Golub-Kahan process
conjugate-gradient method
minimum-residual method
iterative method

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

S
Stanford University
学者数:
9.6W
论文数: 8.2W
被引数: 17.0W
引用论文

引用论文

err1997-01-01
err0
PREAI
errUte Volbehr; Eike Rachor
err分享
err收藏
Solution-Focused Brief Therapy in Schools
err
IF0
err2008-04-24
err0
PREAI
errMichael S. Kelly; Johnny S. Kim; Cynthia Franklin
err分享
err收藏
err分享
err收藏
err分享
err收藏
Fundus flavimaculatus et néovascularisation choroïdienne
err2006-02-01
err0
PREAI
errD. Pawlak; E. Souied; G. Mimoun; M. Papp-Pawlak; G. Coscas; G. Soubrane
err分享
err收藏
学者 查看更多内容