Skip to Main content Skip to Navigation

Memory Optimization to Build a Schur Complement in an Hybrid Solver

Astrid Casadei 1, 2 Pierre Ramet 1, 2 
2 BACCHUS - Parallel tools for Numerical Algorithms and Resolution of essentially Hyperbolic problems
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : Solving linear system $Ax=b$ in parallel where $A$ is a large sparse matrix is a very recurrent problem in numerical simulations. One of the state-of-the-art most promising algorithm is the hybrid method based on domain decomposition and Schur complement. In this method, a direct solver is used as a subroutine on each subdomain matrix. This approach is subject to serious memory overhead. In this paper, we investigate new techniques to reduce memory consumption during the build of the Schur complement by a direct solver. Our method allows memory peak reduction from 10% to 30% on each processus for typical test cases.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Pierre Ramet Connect in order to contact the contributor
Submitted on : Thursday, May 24, 2012 - 4:24:33 PM
Last modification on : Saturday, June 25, 2022 - 7:46:18 PM
Long-term archiving on: : Friday, March 31, 2017 - 8:34:24 AM


Files produced by the author(s)


  • HAL Id : hal-00700053, version 2



Astrid Casadei, Pierre Ramet. Memory Optimization to Build a Schur Complement in an Hybrid Solver. [Research Report] RR-7971, INRIA. 2012, pp.11. ⟨hal-00700053v2⟩



Record views


Files downloads