Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

DOI10.1016/0167-8191(93)90045-MMaRDI QIDQ1208511zbMATH OpenOpenAlexFDO

Authors Esmond G. Ng

Publication date 16 May 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90045-m

zbMATH Keywords

sparse matricesCholesky factorizationparallel computationtest problemsIntel iPSC/2large sparse symmetric positive definite matrixlocal- memory multiprocessorsymbolic factorization algorithm

Mathematics Subject Classification ID

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

Recommendations

• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• Symbolic Cholesky factorization on a local-memory multiprocessor
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Parallel Cholesky factorization on a shared-memory multiprocessor
• scientific article; zbMATH DE number 2087095
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Parallel Cholesky factorization on orthogonal multiprocessors
• scientific article; zbMATH DE number 1424208
• Near optimal Cholesky factorization on orthogonal multiprocessors.

Cited in

(5)

• A survey of direct methods for sparse linear systems
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• Hypermatrix oriented supernode amalgamation
• Theww^Tfactorization of dense and sparse matrices
• Symbolic Cholesky factorization on a local-memory multiprocessor

This page was built for publication: Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

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