Parallel Algorithms for Sparse Linear Systems
Parallel Algorithms for Sparse Linear Systems
复制标题
DOI：
10.1137/1033099
复制
发表时间：
1991-08
期刊：
影响因子：
--
通讯作者：
M. Heath;E. Ng;B. Peyton
中科院分区：
文献类型：
--
作者：
M. Heath;E. Ng;B. Peyton
本文调查了用于解决具有多个处理器的计算机架构上的稀疏线性系统的并行算法开发的最新进展。注意力集中在求解稀疏的对称正定确定系统的直接方法上，特别是通过Cholesky分解。在解决方案过程的所有阶段，包括订购，符号分解，数字分解和三角形溶液的所有阶段，对平行算法的最新进展进行了调查。
This paper surveys recent progress in the development of parallel algorithms for solving sparse linear systems on computer architectures having multiple processors. Attention is focused on direct methods for solving sparse symmetric positive definite systems, specifically by Cholesky factorization. Recent progress on parallel algorithms is surveyed for all phases of the solution process, including ordering, symbolic factorization, numeric factorization, and triangular solution.