A Parallel Algorithm for Large Sparse Cholesky Factorization on a Multiprocessor

A Parallel Algorithm for Large Sparse Cholesky Factorization on a Multiprocessor
复制标题

多处理器上大稀疏Cholesky分解的并行算法

DOI：
--
复制
发表时间：
1986
期刊：
影响因子：
--
通讯作者：
J. Gilbert
J. Gilbert
中科院分区：
--
文献类型：
--
作者：
Earl Zmijewski;J. Gilbert

文献摘要

被引文献

相似文献

给出了一个计算大型稀疏对称正定矩阵符号和数值Cholesky分解的算法。该算法适用于消息传递多处理器系统，例如超立方体，并且基于消除森林的概念。此外，我们还给出了一个计算这些森林的算法，并讨论了算法的复杂性，并证明了算法的正确性。我们还研究了负载平衡的相关问题。
We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness. We also examine the related issue of load balancing.