返回
LSMR: AN ITERATIVE ALGORITHM FOR SPARSE LEAST-SQUARES PROBLEMS
DOI:10.1137/10079687X.png)
摘要
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
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Photoelectrocatalytic activity PbO2 loaded highly oriented TiO2 nanotubes arrays光电催化活性PbO2负载高取向TiO2纳米管阵列
Effects of Electrode Deformation of Resistance Spot Welding on 304 Austenitic Stainless Steel Weld Geometry电阻点焊电极变形对304奥氏体不锈钢焊缝几何形状的影响

