Design of a multicore sparse Cholesky factorization using DAGs
From MaRDI portal
Recommendations
- Experiments with sparse Cholesky using a sequential task-flow implementation
- An out-of-core sparse Cholesky solver
- Sparse direct solution on parallel computers
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- New parallel sparse direct solvers for multicore architectures
Cited in
(22)- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- H-LU factorization on many-core systems
- Experiments with sparse Cholesky using a sequential task-flow implementation
- New parallel sparse direct solvers for multicore architectures
- Sparse Cholesky factorization on FPGA using parameterized model
- Solving large linear least squares problems with linear equality constraints
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- HSL_MA87
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
- Towards an efficient tile matrix inversion of symmetric positive definite matrices on multicore architectures
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Multilevel balancing domain decomposition at extreme scales
- Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic
- A parallel sparse direct solver via hierarchical DAG scheduling
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Reordering strategy for blocking optimization in sparse linear solvers
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A survey of direct methods for sparse linear systems
- Approximating sparse Hessian matrices using large-scale linear least squares
- Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems
- Sparse linear least-squares problems
Describes a project that uses
Uses Software
This page was built for publication: Design of a multicore sparse Cholesky factorization using DAGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200267)
