Restarted GMRES preconditioned by deflation

This paper presents a new preconditioning technique for the restarted GMRES algorithm. It is based on an invariant subspace approximation which is updated at each cycle. Numerical examples show that this deflation technique gives a more robust scheme than the restarted algorithm, at a low cost of op...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics Vol. 69; no. 2; pp. 303 - 318
Main Authors: Erhel, Jocelyne, Burrage, Kevin, Pohl, Bert
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 23.05.1996
Elsevier
Subjects:
ISSN:0377-0427, 1879-1778
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a new preconditioning technique for the restarted GMRES algorithm. It is based on an invariant subspace approximation which is updated at each cycle. Numerical examples show that this deflation technique gives a more robust scheme than the restarted algorithm, at a low cost of operations and memory.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/0377-0427(95)00047-X