Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer

DOI10.1137/0916054zbMath0829.68103OpenAlexW1975124102MaRDI QIDQ4842591

Hjálmtýr Hafsteinsson, Fredrik Manne

Publication date: 15 August 1995

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/084f1347f13e873371fabd4617d4494782a830d2

zbMATH Keywords

Cholesky factorizationsparse matrixparallel algorithmgraph coloring techniques

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05) Distributed algorithms (68W15)

Related Items

SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER ⋮ A survey of direct methods for sparse linear systems