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.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-00924977
Contributor : Pierre Ramet <>
Submitted on : Tuesday, January 7, 2014 - 1:23:29 PM
Last modification on : Thursday, May 9, 2019 - 11:58:12 AM
Long-term archiving on : Monday, April 7, 2014 - 11:22:29 PM

File

abstract1_HiePACS.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨hal-00924977⟩

Share

Metrics

Record views

382

Files downloads

462