A parallel algorithm for elimination tree computation and symbolic factorization

DOI10.1016/0167-8191(92)90031-2zbMath0757.65023OpenAlexW1987223347MaRDI QIDQ1200993

S. Singh

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90031-2

zbMATH Keywords

parallel algorithmselimination treelocal memory multiprocessorsymbolic factorizationsparse Cholesky decomposition

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

This page was built for publication: A parallel algorithm for elimination tree computation and symbolic factorization