Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Optimal memory minimization algorithms for the multifrontal method

Abdou Guermouche 1, 2 Jean-Yves L'Excellent 1, 2 
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We are interested in the active and total memory usage of the multifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of active memory. Significant gains are obtained compared to Liu's approach. We also study the problem of minimizing the total memory and compare various new schemes. A number of experiments shows the interest of these approaches.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:20:46 PM
Last modification on : Wednesday, October 26, 2022 - 8:14:07 AM


  • HAL Id : inria-00071409, version 1


Abdou Guermouche, Jean-Yves L'Excellent. Optimal memory minimization algorithms for the multifrontal method. [Research Report] RR-5179, LIP RR-2204-26, INRIA, LIP. 2004. ⟨inria-00071409⟩



Record views


Files downloads