arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.14979math.NAcs.NA
收藏

块共轭梯度算法的误差范数估计

Error norm estimates for the block conjugate gradient algorithm

Gérard Meurant, Petr Tichý

AI总结:

该研究将共轭梯度算法误差A-范数估计的核心公式推广到块情形,推导块CG变体、块求积规则及误差上下界,通过数值实验验证了界的实际表现。

摘要:

在[Meurant and Tichy, SIAM, 2024]一书中,我们讨论了用于求解对称正定矩阵A对应的线性方程组Ax=b(其中b和x为向量)的共轭梯度(CG)算法的误差范数估计问题。本文将估计误差的A-范数的最重要公式推广到块情形。首先,我们详细讨论了从块Lanczos算法推导块CG(BCG)算法各类变体的过程。随后我们研究了BCG,并推导了相关的块高斯与块高斯-拉奥求积规则。我们展示了如何获取每个方程组误差的A-范数的上下界,这些上下界既可以用BCG中计算的量表示,也可以用底层的块Lanczos算法的相关量表示。数值实验验证了这些界在实际计算中的表现。

英文摘要:

In the book [Meurant and Tichy, SIAM, 2024] we discussed the estimation of error norms in the conjugate gradient (CG) algorithm for solving linear systems $Ax=b$ with a symmetric positive definite matrix $A$, where $b$ and $x$ are vectors. In this paper, we generalize the most important formulas for estimating the $A$-norm of the error to the block case. First, we discuss in detail the derivation of various variants of the block CG (BCG) algorithm from the block Lanczos algorithm. We then consider BCG and derive the related block Gauss and block Gauss-Radau quadrature rules. We show how to obtain lower and upper bounds on the $A$-norm of the error of each system, both in terms of the quantities computed in BCG and in terms of the underlying block Lanczos algorithm. Numerical experiments demonstrate the behavior of the bounds in practical computations.

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

↑