Optimized sparse Cholesky factorization on hybrid multicore architectures
Authors:
- 1 May 2018
- journal article
- conference paper
- Published by Elsevier in Journal of Computational Science
- Vol. 26, 246-253
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation
This publication has 11 references indexed in Scilit:
- Accelerating sparse Cholesky factorization on GPUsParallel Computing, 2016
- A survey of direct methods for sparse linear systemsActa Numerica, 2016
- Towards dense linear algebra for hybrid GPU accelerated manycore systemsParallel Computing, 2010
- Algorithm 887ACM Transactions on Mathematical Software, 2008
- Algorithm 837ACM Transactions on Mathematical Software, 2004
- Algorithm 836ACM Transactions on Mathematical Software, 2004
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory MultiprocessorsSIAM Journal on Scientific Computing, 1993
- On Finding Supernodes for Sparse Matrix ComputationsSIAM Journal on Matrix Analysis and Applications, 1993
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- Algorithms and software for in-core factorization of sparse symmetric positive definite matricesComputers & Structures, 1980