Some convergence results for the Newton-GMRES algorithm

Rémi Choquet 1 Jocelyne Erhel 1
1 ALADIN - Algorithms Adapted to Intensive Numerical Computing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In this paper, we consider both local and global convergence of the Newton algorithm to solve nonlinear problems when GMRES is used to invert the Jacobian at each Newton iteration. Under weak assumptions, we give a sufficient condition for an inexact solution of GMRES to be a descent direction in order to apply a backtracking technique. Moreover, we extend this result to a finite difference scheme considering also the use of preconditioners. Then we show the impact of the condition number of the Jacobian on the local convergence of the Newton-GMRES algorithm.
Type de document :
[Research Report] RR-2065, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:53:29
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:20:33



  • HAL Id : inria-00074607, version 1


Rémi Choquet, Jocelyne Erhel. Some convergence results for the Newton-GMRES algorithm. [Research Report] RR-2065, INRIA. 1993. 〈inria-00074607〉



Consultations de la notice


Téléchargements de fichiers