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

Abstract : 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 strategies are used to reduce the overall complexity of a solver. In this talk, we present a preliminary study of the use of H-Matrix arithmetic in a supernodal solver. We also present a new feature in PaStiX, a reordering strategy to reduce the number of off-diagonal blocks in the symbolic factorization. It allows BLAS kernels to be more efficient, and those ideas could be explored in the context of a low-rank strategy.
Complete list of metadatas

https://hal.inria.fr/hal-01187882
Contributor : Pierre Ramet <>
Submitted on : Thursday, August 27, 2015 - 8:43:43 PM
Last modification on : Thursday, December 13, 2018 - 6:48:02 PM

Identifiers

  • HAL Id : hal-01187882, version 1

Collections

Citation

Mathieu Faverge, Grégoire Pichon, Pierre Ramet, Jean Roman. On the use of H-Matrix Arithmetic in PaStiX: a Preliminary Study. Workshop on Fast Direct Solvers, Jun 2015, Toulouse, France. ⟨hal-01187882⟩

Share

Metrics

Record views

358