A parallel algorithm for elimination tree computation and symbolic factorization

DOI10.1016/0167-8191(92)90031-2MaRDI QIDQ1200993zbMATH OpenOpenAlexFDO

Authors 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

elimination treelocal memory multiprocessorparallel algorithmssparse Cholesky decompositionsymbolic factorization

Mathematics Subject Classification ID

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

Recommendations

• On evaluating elimination tree based parallel sparse cholesky factorizations
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Parallel symbolic factorization of sparse linear systems
• Parallel implementation of multifrontal schemes
• Parallel algorithms for sparse triangular system solution

Cited in

(4)

• Parallel implementation of multifrontal schemes
• On evaluating elimination tree based parallel sparse cholesky factorizations
• A survey of direct methods for sparse linear systems
• Parallel symbolic factorization of sparse linear systems

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

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