Maximum-Weighted Matching Strategies and the Application to Symmetric Indefinite Systems
Maximum-Weighted Matching Strategies and the Application to Symmetric Indefinite Systems
复制标题
最大加权匹配策略及其在对称不定系统中的应用
DOI：
10.1007/11558958_97
复制
发表时间：
2004
期刊：
影响因子：
2.1
通讯作者：
O. Schenk
中科院分区：
文献类型：
--
作者：
S. Röllin;O. Schenk
研究了对称不定方程组求解的数值预处理问题。特别强调的是对称的最大加权匹配策略。目的是将矩阵的大元素置换为对角块。几个变量的块大小进行检查和解决方案的精度进行了比较。结果表明，最大加权匹配提高稀疏直接线性求解器的精度。使用称为全循环的策略可以实现准确可靠的因式分解。数值实验验证了这些结论。
The problem of finding good numerical preprocessing methods for the solution of symmetric indefinite systems is considered. Special emphasis is put on symmetric maximum-weighted matching strategies. The aim is to permute large elements of the matrix to diagonal blocks. Several variants for the block sizes are examined and the accuracies of the solutions are compared. It is shown that maximum-weighted matchings improve the accuracy of sparse direct linear solvers. The use of a strategy called full cycles results in an accurate and reliable factorization. Numerical experiments validate these conclusions.