Skip to Main content Skip to Navigation
New interface
Conference papers

Nested dissection with balanced halo

Astrid Casadei 1, 2 Pierre Ramet 1, 2 Jean Roman 1, 2 
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 metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Pierre Ramet Connect in order to contact the contributor
Submitted on : Monday, May 5, 2014 - 2:40:05 PM
Last modification on : Saturday, June 25, 2022 - 7:42:18 PM
Long-term archiving on: : Tuesday, August 5, 2014 - 12:30:10 PM


Files produced by the author(s)


  • HAL Id : hal-00987099, version 1



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



Record views


Files downloads