Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition

Abstract

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-01100985 , version 1

Cite

Astrid Casadei, Pierre Ramet, Jean Roman. Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition. SIAM Conference on Computational Science and Engineering (SIAM CSE 2015), Mar 2015, Salt Lake City, United States. ⟨hal-01100985⟩

Collections

CNRS INRIA INRIA2
205 View
0 Download

Share

Gmail Facebook X LinkedIn More