Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition

Résumé

In the context of hybrid sparse linear solvers based on domain decomposition and Schur complement approaches, getting a domain decomposition tool leading to a good balancing of both the internal node set size and the interface node set size is a critical point for parallel computation. We propose several variations of the existing algorithms in the multilevel Scotch partitioner and we illustrate the improved results on a collection of graphs coming from numerical scientific applications.
Fichier non déposé

Dates et versions

hal-01100990 , version 1 (07-01-2015)

Identifiants

  • HAL Id : hal-01100990 , version 1

Citer

Astrid Casadei, Pierre Ramet, Jean Roman. Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition. Mini-Symposium on "Combinatorial Issues in Sparse Matrix Computation" at ICIAM'15 conference, Aug 2015, Beijing, China. ⟨hal-01100990⟩

Collections

CNRS INRIA INRIA2
96 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More