A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors

DOI10.1137/0914048zbMath0785.65014OpenAlexW2094542090MaRDI QIDQ3140138

Barry W. Peyton, Esmond G. Ng

Publication date: 14 April 1994

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

Full work available at URL: https://doi.org/10.1137/0914048

zbMATH Keywords

algorithmnumerical resultsparallel algorithmssparse Cholesky factorizationsupernodesshared- memory multiprocessor

Mathematics Subject Classification ID

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

Related Items (4)

Fast Cholesky factorization for interior point methods of linear programming ⋮ ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices ⋮ Sparse matrix tools for Gaussian models on lattices ⋮ A survey of direct methods for sparse linear systems

Uses Software

• LAPACK
• BLAS
• Harwell-Boeing sparse matrix collection

This page was built for publication: A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors