An Augmented Subspace Conjugate Gradient

Jocelyne Erhel 1 Frédéric Guyomarc'H 1
1 ALADIN - Algorithms Adapted to Intensive Numerical Computing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Many scientific applications require to solve successively linear systems Ax=b with different right-hand sides b and a symmetric positive definite matrix A. The Conjugate Gradient method applied to the first system generates a Krylov subspace which can be efficiently recycled thanks to orthogonal projections in subsequent systems. A modified Conjugate Gradient method is then applied with a specific initial guess and initial descent direction and a modified descent direction during the iterations. This paper gives new theoretical results for this method and proposes a new version which seems robust as far as loss of orthogonality is concerned. Numerical experiments show the efficacy of our method even for quite different right-hand sides.
Type de document :
[Research Report] RR-3278, INRIA. 1997
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:44:20
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:45:39



  • HAL Id : inria-00073411, version 1


Jocelyne Erhel, Frédéric Guyomarc'H. An Augmented Subspace Conjugate Gradient. [Research Report] RR-3278, INRIA. 1997. 〈inria-00073411〉



Consultations de la notice


Téléchargements de fichiers