Search NASA⌕ Search

DOE OSTI · 2000278

SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization

Abstract

Decomposing sparse matrices into lower and upper triangular matrices (sparse LU factorization) is a key operation in many computational scientific applications. We developed SparseLU, a sparse linear algebra library that implements a new algorithm for LU factorization on general sparse matrices. The new algorithm divides the input matrix into tiles to which OpenMP tasks are created for factorization computation, where only tiles that contain nonzero elements are computed. For comparative performance analysis, we used the reference library SuperLU. Testing was performed on synthetically generated matrices which replicate the conditions of the real-world matrices. SparseLU is able to reach a mean speedup of ~29× compared to SuperLU.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valero Lara, Pedro, Greenwalt, Cameron, Vetter, Jeffrey. 2022-11-01. SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization. https://doi.org/10.1109/ia356718.2022.00010. https://searchnasa.com/record/osti%3A2000278/sparselu-a-novel-algorithm-and-math-library-for-sparse-lu-factorization

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.