arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.02033math.NAcs.NA
收藏

具一般系数的稀疏线性系统解的验证方法

Method for Verifying Solutions of Sparse Linear Systems with General Coefficients

Takeshi Terao, Katsuhisa Ozaki

AI总结:

针对稀疏线性系统 $Ax=b$,提出基于 $LDL^T$ 分解的解验证方法以减少填充,并辅以高效迭代精化方法获取精确解。

摘要:

本文提出了一种针对具有一般非奇异系数的稀疏线性系统 $Ax=b$ 的验证方法。验证方法为给定的近似解产生误差界。传统方法采用两种途径之一。一种途径是利用对称正定性验证正规方程 $A^TAx=A^Tb$ 的计算解;然而,$A^TA$ 的条件数是 $A$ 的条件数的平方。另一种途径使用系数的近似逆矩阵;然而,即使 $A$ 是稀疏的,近似逆也可能是稠密的。在此,我们提出一种基于 $LDL^T$ 分解的稀疏线性系统解的验证方法。所提方法能减少填充并适用于许多问题。此外,还提出了一种高效的迭代精化方法以获得精确解。

英文摘要:

This paper proposes a verification method for sparse linear systems $Ax=b$ with general and nonsingular coefficients. A verification method produces the error bound for a given approximate solution. Conventional methods use one of two approaches. One approach is to verify the computed solution of the normal equation $A^TAx=A^Tb$ by exploiting symmetric and positive definiteness; however, the condition number of $A^TA$ is the square of that for $A$. The other approach uses an approximate inverse matrix of the coefficient; however, the approximate inverse may be dense even if $A$ is sparse. Here, we propose a method for the verification of solutions of sparse linear systems based on $LDL^T$ decomposition. The proposed method can reduce the fill-in and is applicable to many problems. Moreover, an efficient iterative refinement method is proposed for obtaining accurate solutions.

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

↑