Towards Domain Decomposition with Balanced Halo

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
Workshop Celebrating 40 Years of Nested Dissection, Jul 2013, Waterloo, Canada. 2013
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00924977
Contributeur : Pierre Ramet <>
Soumis le : mardi 7 janvier 2014 - 13:23:29
Dernière modification le : jeudi 11 janvier 2018 - 06:22:35
Document(s) archivé(s) le : lundi 7 avril 2014 - 23:22:29

Fichier

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

Identifiants

  • HAL Id : hal-00924977, version 1

Citation

Astrid Casadei, Luc Giraud, Pierre Ramet, Jean Roman. Towards Domain Decomposition with Balanced Halo. Workshop Celebrating 40 Years of Nested Dissection, Jul 2013, Waterloo, Canada. 2013. 〈hal-00924977〉

Partager

Métriques

Consultations de la notice

299

Téléchargements de fichiers

356