Nested dissection with balanced halo - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Nested dissection 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.
Fichier principal
Vignette du fichier
csc14.pdf (52.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00987099 , version 1 (05-05-2014)

Identifiers

  • HAL Id : hal-00987099 , version 1

Cite

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

Collections

CNRS INRIA INRIA2
100 View
277 Download

Share

Gmail Facebook X LinkedIn More