Memory Optimization to Build a Schur Complement in an Hybrid Solver - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

Memory Optimization to Build a Schur Complement in an Hybrid Solver

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

Dates and versions

hal-00700053 , version 1 (22-05-2012)
hal-00700053 , version 2 (24-05-2012)

Identifiers

  • HAL Id : hal-00700053 , version 2

Cite

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⟩
183 View
202 Download

Share

Gmail Facebook X LinkedIn More