A note on communication analysis of parallel sparse Cholesky factorization on a hypercube

DOI10.1016/0167-8191(90)90158-6MaRDI QIDQ751753zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90158-6

zbMATH Keywords

Cholesky factorizationhypercubeparallel algorithmscommunication analysisnested-dissection method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Limiting Communication in Parallel Sparse Cholesky Factorization
• Publication:4860191
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Publication:4860184

Cited in

(3)

• A survey of direct methods for sparse linear systems
• A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes
• Communication results for parallel sparse Cholesky factorization on a hypercube

This page was built for publication: A note on communication analysis of parallel sparse Cholesky factorization on a hypercube

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