估计最小二乘与最小范数问题中类CG算法的误差
Estimating the error in CG-like algorithms for least-squares and least-norm problems
AI总结:
本研究将此前提出的CG方法误差能量范数自适应估计,扩展到求解最小二乘与最小范数问题的多种类CG算法(含CGLS、CGNE、LSQR、CRAIG及预条件变体),证明其低成本且数值可靠,实验验证了鲁棒性。
摘要:
在[Meurant、Papež、Tichý;《Numerical Algorithms》第88卷,2021年]的研究中,我们提出了共轭梯度(CG)方法误差能量范数的自适应估计。本文将该估计扩展到求解含一般(可能为矩形)矩阵的线性逼近问题的算法,这类算法基于将CG应用于由原矩阵构造的正(半)定矩阵系统。我们证明所得估计保留了其关键特性:计算成本极低,且在有限精度算术下,满足一些温和假设时具备数值可靠性。我们讨论了基于类Hestenes-Stiefel实现(文献中常称为CGLS和CGNE)以及基于双对角化(LSQR和CRAIG)的算法,涵盖无预条件和带预条件的变体。数值实验证实了该估计的鲁棒性和非常令人满意的表现。
英文摘要:
In [Meurant, Papež, Tichý; Numerical Algorithms 88, 2021], we presented an adaptive estimate for the energy norm of the error in the conjugate gradient (CG) method. In this paper, we extend the estimate to algorithms for solving linear approximation problems with a general, possibly rectangular matrix that are based on applying CG to a system with a positive (semi-)definite matrix build from the original matrix. We show that the resulting estimate preserves its key properties: it can be very cheaply evaluated, and it is numerically reliable in finite-precision arithmetic under some mild assumptions. We discuss algorithms based on Hestenes-Stiefel-like implementation (often called CGLS and CGNE in the literature) as well as on bidiagonalization (LSQR and CRAIG), and both unpreconditioned and preconditioned variants. The numerical experiments confirm the robustness and very satisfactory behaviour of the estimate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。