On evaluating elimination tree based parallel sparse cholesky factorizations
From MaRDI portal
The computation of the Cholesky factorization of sparse matrices by parallel methods is investigated. On the basis of the elimination tree model, the four widely adopted parallel methods -- the column-, row-, submatrix-Cholesky-, and multifrontal method -- are compared with respect to the computational costs. The theoretical result that the multifrontal method is superior to the other three Cholesky factorization methods is apparently confirmed by the experimental results.
Recommendations
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- scientific article; zbMATH DE number 434523
- A parallel algorithm for elimination tree computation and symbolic factorization
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- scientific article; zbMATH DE number 833696
Cites work
- A Data Structure for Parallel L/U Decomposition
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A New Implementation of Sparse Gaussian Elimination
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Highly Parallel Sparse Cholesky Factorization
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 833702 (Why is no real title available?)
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Parallel Algorithms for Sparse Linear Systems
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Parallel implementation of multifrontal schemes
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
Cited in
(7)- Parallel implementation of multifrontal schemes
- The average parallel complexity of Cholesky factorization
- A parallel algorithm for elimination tree computation and symbolic factorization
- A compact row storage scheme for Cholesky factors using elimination trees
- A study of the factorization fill‐in for a parallel implementation of the finite element method
- Parallel and fully recursive multifrontal supernodal sparse Cholesky
- A survey of direct methods for sparse linear systems
This page was built for publication: On evaluating elimination tree based parallel sparse cholesky factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955154)