Experiments with sparse Cholesky using a sequential task-flow implementation

DOI10.3934/naco.2018014zbMath1405.65036OpenAlexW2800639968WikidataQ129788598 ScholiaQ129788598MaRDI QIDQ1713223

Florent Lopez, Jonathan Hogg, Iain S. Duff

Publication date: 24 January 2019

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2018014

zbMATH Keywords

OpenMPruntime systemssparse CholeskySPD systemsstarPU

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting

Uses Software

• AMD
• SparseMatrix
• MAGMA
• PLASMA
• HSL_MA87
• StarPU
• qr_mumps

Cites Work

• Task scheduling for parallel sparse Cholesky factorization
• Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
• The university of Florida sparse matrix collection
• Modification of the minimum-degree algorithm by multiple elimination
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• An Approximate Minimum Degree Ordering Algorithm
• Design of a Multicore Sparse Cholesky Factorization Using DAGs
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Algorithm 837
• PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems

This page was built for publication: Experiments with sparse Cholesky using a sequential task-flow implementation