Experiments with sparse Cholesky using a sequential task-flow implementation
From MaRDI portal
Recommendations
- Design of a multicore sparse Cholesky factorization using DAGs
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Sparse direct solution on parallel computers
- Task scheduling for parallel sparse Cholesky factorization
- Parallel solution of hierarchical symmetric positive definite linear systems
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Algorithm 837
- An Approximate Minimum Degree Ordering Algorithm
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- Design of a multicore sparse Cholesky factorization using DAGs
- Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Modification of the minimum-degree algorithm by multiple elimination
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Task scheduling for parallel sparse Cholesky factorization
- The University of Florida sparse matrix collection
Cited in
(4)
This page was built for publication: Experiments with sparse Cholesky using a sequential task-flow implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713223)
