Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

DOI10.1016/0167-8191(93)90045-MzbMath0767.65011OpenAlexW2042303567MaRDI QIDQ1208511

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

parallel computationCholesky factorizationsparse matricestest problemsIntel iPSC/2large sparse symmetric positive definite matrixlocal- memory multiprocessorsymbolic factorization algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Theww^Tfactorization of dense and sparse matrices ⋮ A survey of direct methods for sparse linear systems

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