稀疏非对称矩阵高斯消去的并行算法
A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices
摘要：
我们描述了一个新的算法高斯消除适合一般（不对称和可能奇异）稀疏矩阵，任何条目类型，它有一个自然的并行和分布式内存制定，但优雅地退化到顺序执行。我们提出了一个示例MPI实现的程序计算的稀疏整数矩阵的秩使用所提出的算法。一些初步的性能测量和讨论，并比较相应的国家的最先进的浮点和整数矩阵的算法的算法的性能。
英文摘要：
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices, of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some preliminary performance measurements are presented and discussed, and the performance of the algorithm is compared to corresponding state-of-the-art algorithms for floating-point and integer matrices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
