A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor

DOI10.1016/0167-8191(88)90039-7zbMath0654.65025OpenAlexW2023521505MaRDI QIDQ1108738

John R. Gilbert, Earl Zmijewski

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90039-7

zbMATH Keywords

complexityparallel algorithmelimination forestslarge sparse symmetric positive definite matrixmessage-passing hypercube multiprocessorparallel symbolic Cholesky factorization algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

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 ⋮ Task scheduling for parallel sparse Cholesky factorization ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor