Parallel pivoting algorithms for sparse symmetric matrices

DOI10.1016/S0167-8191(84)90446-0zbMath0554.65017MaRDI QIDQ760156

Frans J. Peters

Publication date: 1984

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

parallel computationnumerical stabilityLU-decompositionMIMD computerminimum-degree orderingparallel pivoting algorithmssparse symmetric matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A survey of the advances in the exploitation of the sparsity in the solution of large problems, A parallel graph partitioning algorithm for a message-passing multiprocessor, Design and Implementation of a Parallel Markowitz Threshold Algorithm, A survey of direct methods for sparse linear systems