Low-Rank Compression

On the use of low rank approximations for sparse direct solvers

In this talk, we describe a preliminary fast direct solver using HODLR library to compress large blocks appearing in the symbolic structure of the PaStiX sparse direct solver. We …

g.-pichon
•

Exploiting H-Matrices in Sparse Direct Solvers

In this talk, we describe a preliminary fast direct solver using HODLR library to compress large blocks appearing in the symbolic structure of the PaStiX sparse direct solver. We …

g.-pichon
•

On the use of H-Matrix Arithmetic in PaStiX: a Preliminary Study

When solving large sparse linear systems, both the amount of memory needed and the computational cost represent a burden to efficiency. In order to solve larger systems, low-rank …

m.-faverge
•