Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
DOI10.1137/23m1568600OpenAlexW4367171414MaRDI QIDQ6139654
Alfredo Buttari, Fabienne Jézéquel, Jean-Yves L'Excellent, Unnamed Author, Theo A. Mary, Patrick R. Amestoy, Olivier Boiteau
Publication date: 19 January 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/23m1568600
linear systemsnumerical linear algebralow-rank approximationscommunication avoiding algorithmstriangular solveblock low-rank matricesdata sparse matricesLu factorization
Computational methods for sparse matrices (65F50) Parallel algorithms in computer science (68W10) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Approximation algorithms (68W25) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- On the Complexity of the Block Low-Rank Multifrontal Factorization
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
