Parallel Sparse and Data-Sparse Factorization-based Linear Solvers
Abstract
Efficient solutions of large-scale, ill-conditioned and indefinite algebraic equations are ubiquitously needed in numerous computational fields, including multiphysics simulations, machine learning, and data science. Because of their robustness and accuracy, direct solvers are crucial components in building a scalable solver toolchain. In this chapter, we will review recent advances of sparse direct solvers along two axes: 1) reducing communication and latency costs in both task- and data-parallel settings, and 2) reducing computational complexity via low-rank and other compression techniques such as hierarchical matrix algebra. In addition to algorithmic principles, we also illustrate the key parallelization challenges and best practices to deliver high speed and reliability on modern heterogeneous parallel machines.
Cite
@article{arxiv.2602.14289,
title = {Parallel Sparse and Data-Sparse Factorization-based Linear Solvers},
author = {Xiaoye Sherry Li and Yang Liu},
journal= {arXiv preprint arXiv:2602.14289},
year = {2026}
}