期刊
SIAM JOURNAL ON SCIENTIFIC COMPUTING
卷 33, 期 5, 页码 2950-2971出版社
SIAM PUBLICATIONS
DOI: 10.1137/10079687X
关键词
least-squares problem; sparse matrix; LSQR; MINRES; Krylov subspace method; Golub-Kahan process; conjugate-gradient method; minimum-residual method; iterative method
资金
- Office of Naval Research [N00014-08-1-0191]
- U.S. Army Research Laboratory through the Army High Performance Computing Research Center [W911NF-07-0027]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据