A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods
A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods
复制标题
DOI：
10.1145/1486525.1486526
复制
发表时间：
2009-03
期刊：
影响因子：
--
通讯作者：
Jan Mayer
中科院分区：
文献类型：
--
作者：
Jan Mayer
最近的进展，在多层次LU分解和新的预处理技术，导致了非常大的数量的可能性预处理稀疏，非对称线性系统的迭代方法求解。然而，并非所有组合都适用于所有系统，因此做出正确的选择对于获得高效的求解器至关重要。本文给出的256个矩阵的数值结果表明了哪些方法适用于哪些矩阵（基于不同的标准，如总计算时间或填充）以及方法之间的差异。
Recent advances in multilevel LU factorizations and novel preprocessing techniques have led to an extremely large number of possibilities for preconditioning sparse, unsymmetric linear systems for solving with iterative methods. However, not all combinations work well for all systems, so making the right choices is essential for obtaining an efficient solver. The numerical results for 256 matrices presented in this article give an indication of which approaches are suitable for which matrices (based on different criteria, such as total computation time or fill-in) and of the differences between the methods.