On evaluating elimination tree based parallel sparse cholesky factorizations
DOI10.1080/00207160008804948zbMath0962.65025OpenAlexW2086720083WikidataQ114101727 ScholiaQ114101727MaRDI QIDQ4955154
Chuen-Liang Chen, Wen-Yang Lin
Publication date: 14 June 2001
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160008804948
numerical examplesparallel computationCholesky factorizationsparse matricesmultifrontal methodelimination treeequivalent reordering
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Parallel implementation of multifrontal schemes
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A Data Structure for Parallel L/U Decomposition
- A New Implementation of Sparse Gaussian Elimination
- Parallel Algorithms for Sparse Linear Systems
- Highly Parallel Sparse Cholesky Factorization
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
This page was built for publication: On evaluating elimination tree based parallel sparse cholesky factorizations