Low-rank compression

Sparse supernodal solver using block low-rank compression: Design, performance and analysis

Utilisation de la compression Block Low-Rank pour accélérer un solveur direct creux supernodal

Supernodes ordering to enhance Block Low-Rank compression in sparse direct solvers

In this talk, we present new ordering heuristics to perform block low-rank clustering in supernodes issued from the nested dissection. As kway partitioning within supernodes does not take into account interactions between supernodes, there is room …

Sparse Supernodal Solver Using Block Low-Rank Compression: design, performance and analysis

Sparse supernodal solver with low-rank compression for solving the frequency-domain Maxwell equations discretized by a high order HDG method

Sparse Supernodal Solver exploiting Low-Rankness Property

In this talk, we will present recent advances on PaStiX, a supernodal sparse direct solver, which has been enhanced by the introduction of Block Low-Rank compression. We will describe different strategies leading to memory consumption gain and/or …

Sparse Supernodal Solver Using Block Low-Rank Compression

Utilisation de la compression Block Low-Rank pour accélérer un solveur direct creux supernodal

Sparse Supernodal Solver Using Block Low-Rank Compression

Sparse Supernodal Solver Using Hierarchical Compression

In this talk, we present the PaStiX sparse supernodal solver, using hierarchical compression to reduce the burden on large blocks appearing during the nested dissection process. To improve the efficiency of our sparse update kernel for both BLR …