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

Parallelism and robustness in GMRES with the Newton basis and the deflated restarting

Désiré Nuentsa Wakam 1 Jocelyne Erhel 1 
1 SAGE - Simulations and Algorithms on Grids for Environment
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : The GMRES iterative method is widely used as Krylov subspace accelerator for solving sparse linear systems when the coefficient matrix is nonsymmetric and indefinite. The Newton basis implementation has been proposed on distributed memory computers as an alternative to the classical approach with the Arnoldi process. The aim of our work here is to introduce a modification based on deflation techniques. This approach builds an augmented subspace in an adaptive way to accelerate the convergence of the restarted formulation. In our numerical experiments, we show the benefits of using this implementation with hybrid direct/iterative methods to solve large linear systems.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Desire Nuentsa Wakam Connect in order to contact the contributor
Submitted on : Monday, October 1, 2012 - 5:48:45 PM
Last modification on : Thursday, October 27, 2022 - 3:45:42 AM
Long-term archiving on: : Friday, December 16, 2016 - 7:24:11 PM


Files produced by the author(s)


  • HAL Id : inria-00638247, version 2


Désiré Nuentsa Wakam, Jocelyne Erhel. Parallelism and robustness in GMRES with the Newton basis and the deflated restarting. [Research Report] RR-7787, 2011, pp.30. ⟨inria-00638247v2⟩



Record views


Files downloads