Limiting Communication in Parallel Sparse Cholesky Factorization

DOI10.1137/0912063zbMATH Open0733.65018OpenAlexW1996471375MaRDI QIDQ3359645FDOQ3359645

Authors: 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

Recommendations

• Publication:4860191
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Publication:4860184
• A Fan-In Algorithm for Distributed Sparse Numerical Factorization
• Communication results for parallel sparse Cholesky factorization on a hypercube

zbMATH Keywords

Cholesky factorizationparallel algorithmhypercubelarge sparse symmetric positive definite matrixTest problemsmessage-passing multiprocessor

Mathematics Subject Classification ID

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

Cited In (7)

• A survey of direct methods for sparse linear systems
• Recurrent neural networks for LU decomposition and Cholesky factorization
• A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
• Title not available (Why is that?)
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Minimum communication cost reordering for parallel sparse Cholesky factorization
• Symbolic Cholesky factorization on a local-memory multiprocessor

Uses Software

• Harwell-Boeing sparse matrix collection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359645)