arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.0758cs.MScs.NAmath.NA
收藏

LSMR: 一种用于稀疏最小二乘问题的迭代算法

LSMR: An iterative algorithm for sparse least-squares problems

Stanford University(斯坦福大学)

David Fong, Michael Saunders

AI总结:

提出LSMR算法,基于Golub-Kahan双对角化过程求解稀疏线性系统与最小二乘问题,保证残差范数单调递减,相比LSQR可更安全地提前终止。

摘要:

提出了一种迭代方法LSMR,用于求解线性系统$Ax=b$和最小二乘问题$\min orm{Ax-b}_2$,其中$A$是稀疏的或快速线性算子。LSMR基于Golub-Kahan双对角化过程。它在解析上等价于应用于正规方程$A\T Ax = A\T b$的MINRES方法,因此量$ orm{A\T r_k}$单调递减(其中$r_k = b - Ax_k$是当前迭代$x_k$的残差)。在实践中我们观察到$ orm{r_k}$也单调递减。与仅$ orm{r_k}$单调的LSQR相比,LSMR可以更安全地提前终止。还探讨了在额外可用内存情况下对新迭代方法的改进。

英文摘要:

An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\min \norm{Ax-b}_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 $\norm{A\T r_k}$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). In practice we observe that $\norm{r_k}$ also decreases monotonically. Compared to LSQR, for which only $\norm{r_k}$ is monotonic, it is safer to terminate LSMR early. Improvements for the new iterative method in the presence of extra available memory are also explored.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑