HYLU: Hybrid Parallel Sparse LU Factorization
By: Xiaoming Chen
Potential Business Impact:
Solves math problems on computers much faster.
This article introduces HYLU, a hybrid parallel LU factorization-based general-purpose solver designed for efficiently solving sparse linear systems (Ax=b) on multi-core shared-memory architectures. The key technical feature of HYLU is the integration of hybrid numerical kernels so that it can adapt to various sparsity patterns of coefficient matrices. Tests on 34 sparse matrices from SuiteSparse Matrix Collection reveal that HYLU outperforms Intel MKL PARDISO in the numerical factorization phase by geometric means of 1.95X (for one-time solving) and 2.40X (for repeated solving). HYLU can be downloaded from https://github.com/chenxm1986/hylu.
Similar Papers
HYLU: Hybrid Parallel Sparse LU Factorization
Hardware Architecture
Solves math problems on computers much faster.
HYLU: Hybrid Parallel Sparse LU Factorization
Hardware Architecture
Solves math problems on computers much faster.
ShyLU node: On-node Scalable Solvers and Preconditioners Recent Progresses and Current Performance
Numerical Analysis
Solves hard math problems faster on computers.