Limiting Communication in Parallel Sparse Cholesky Factorization

DOI10.1137/0912063zbMath0733.65018OpenAlexW1996471375MaRDI QIDQ3359645

Laurie A. Hulbert, Earl Zmijewski

Publication date: 1991

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

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

zbMATH Keywords

hypercubeCholesky factorizationparallel algorithmlarge sparse symmetric positive definite matrixTest problemsmessage-passing 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 (2)

A survey of direct methods for sparse linear systems ⋮ Recurrent neural networks for LU decomposition and Cholesky factorization

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Limiting Communication in Parallel Sparse Cholesky Factorization