An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
From MaRDI portal
Recommendations
- The design and implementation of a new out-of-core sparse cholesky factorization method
- A Cholesky out-of-core factorization
- An out-of-core sparse Cholesky solver
- An out-of-core sparse symmetric-indefinite factorization method
- Out-of-Core Implementations of Cholesky Factorization: Loop-Based versus Recursive Algorithms
Cited in
(14)- Scheduling series-parallel task graphs to minimize peak memory
- A Cholesky out-of-core factorization
- An out-of-core sparse Cholesky solver
- An out-of-core sparse symmetric-indefinite factorization method
- Out-of-Core Implementations of Cholesky Factorization: Loop-Based versus Recursive Algorithms
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- scientific article; zbMATH DE number 2152756 (Why is no real title available?)
- Efficient Methods for Out-of-Core Sparse Cholesky Factorization
- The design and implementation of the parallel out-of-core ScaLAPACK LU, QR, and Cholesky factorization routines
- scientific article; zbMATH DE number 1424322 (Why is no real title available?)
- The design and implementation of a new out-of-core sparse cholesky factorization method
- A survey of direct methods for sparse linear systems
- Key concepts for parallel out-of-core LU factorization
This page was built for publication: An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773171)