Communication results for parallel sparse Cholesky factorization on a hypercube

DOI10.1016/0167-8191(89)90101-4zbMath0687.65024OpenAlexW1968235986MaRDI QIDQ1263230

K. Appert

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90101-4

zbMATH Keywords

numerical experimentsCholesky factorizationparallel algorithmselimination treeallocation schemesparse positive definite systemstask assignment strategy

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 (6)

A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ Solution of sparse positive definite systems on a hypercube ⋮ A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions ⋮ Task scheduling for parallel sparse Cholesky factorization ⋮ A survey of direct methods for sparse linear systems ⋮ Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations

This page was built for publication: Communication results for parallel sparse Cholesky factorization on a hypercube