Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
linear systemslow-rank approximationsnumerical linear algebracommunication avoiding algorithmstriangular solveblock low-rank matricesdata sparse matricesLu factorization
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Improving multifrontal methods by means of block low-rank representations
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
- On the complexity of the block low-rank multifrontal factorization
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
This page was built for publication: Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139654)