Nested dissection with balanced halo

Astrid Casadei 1, 2 Pierre Ramet 1, 2 Jean Roman 1, 2
Abstract : Nested Dissection has been introduced by A. George and is a well-known and very popular heuristic for sparse matrix ordering to reduce both the fill-in and the operation count during the numerical factorization. Considering now hybrid methods mixing both direct and iterative solvers, obtaining a domain decomposition leading to a good balancing of both the size of domain interiors and the size of interfaces is a key point for load balancing and efficiency in a parallel context. For this purpose, we revisit the algorithm introduced by Lipton, Rose and Tarjan which per- formed the recursion in a different manner.
Type de document :
Communication dans un congrès
Sixth SIAM Workshop on Combinatorial Scientific Computing, Jul 2014, Lyon, France. 2014
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00987099
Contributeur : Pierre Ramet <>
Soumis le : lundi 5 mai 2014 - 14:40:05
Dernière modification le : jeudi 11 janvier 2018 - 06:22:35
Document(s) archivé(s) le : mardi 5 août 2014 - 12:30:10

Fichier

csc14.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00987099, version 1

Collections

Citation

Astrid Casadei, Pierre Ramet, Jean Roman. Nested dissection with balanced halo. Sixth SIAM Workshop on Combinatorial Scientific Computing, Jul 2014, Lyon, France. 2014. 〈hal-00987099〉

Partager

Métriques

Consultations de la notice

228

Téléchargements de fichiers

280