Sparse Supernodal Solver Using Hierarchical Compression

Abstract : 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 (block low rank) and HODLR (hierarchically off-diagonal low-rank), we investigate to BDLR (boundary distance low-rank) method to preselect rows and columns in the low-rank approximation algorithm. We will also discuss ordering strategies to enhance data locality and compressibility.
Type de document :
Communication dans un congrès
Workshop on Fast Direct Solvers, Nov 2016, Purdue, United States. 〈http://www.math.purdue.edu/~xiaj/FastSolvers2016/index.html〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01421368
Contributeur : Pierre Ramet <>
Soumis le : jeudi 22 décembre 2016 - 10:21:54
Dernière modification le : mercredi 11 juillet 2018 - 14:44:01

Identifiants

  • HAL Id : hal-01421368, version 1

Citation

Grégoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman. Sparse Supernodal Solver Using Hierarchical Compression. Workshop on Fast Direct Solvers, Nov 2016, Purdue, United States. 〈http://www.math.purdue.edu/~xiaj/FastSolvers2016/index.html〉. 〈hal-01421368〉

Partager

Métriques

Consultations de la notice

206