Uniform Dense Blocking for Efficient Sparse LU Factorization in First-Principles Materials Simulation

doi:10.1007/978-3-031-99872-0_24

Uniform Dense Blocking for Efficient Sparse LU Factorization in First-Principles Materials Simulation

2026-01-01

0

PRE

AI

DOI：10.1007/978-3-031-99872-0_24

Original

Original request for help

Save

Abstract

En 中文

Sparse matrix LU factorization is a critical method in direct solvers, playing a significant role in the field of first-principles materials simulation. Matrices in quantum chemistry problems often exhibit locally dense properties, yet their spatial structural characteristics have been overlooked in previous efforts. This paper proposes a novel LU factorization algorithm that leverages application-specific locally dense structures by partitioning sparse matrices into uniform dense blocks. Through systematic integration of level-3 BLAS kernels, the method transforms traditionally memory-bound LU operations into compute-intensive tasks, achieving significant improvements in both computational efficiency and CPU utilization. We conducted performance tests on CPUs from three different vendors, including the x86-based Intel Xeon Platinum 8375C and AMD EPYC 7543, as well as the ARM-based Kunpeng 920. Experimental results demonstrate significant performance improvements compared to the state-of-the-art sparse direct solvers.

Keywords:

Sparse LU factorization

First-principles material simulation

Uniform dense block format

Uniform Dense Blocking for Efficient Sparse LU Factorization in First-Principles Materials Simulation

Abstract

Journal

Organization