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.
Type de document :
Communication dans un congrès
Workshop on Fast Direct Solvers, Jun 2015, Toulouse, France
Liste complète des métadonnées

https://hal.inria.fr/hal-01187882
Contributeur : Pierre Ramet <>
Soumis le : jeudi 27 août 2015 - 20:43:43
Dernière modification le : mercredi 11 juillet 2018 - 14:44:01

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

323