The Effect of Symmetric Permutations on the Convergence of a Restarted GMRES Solver with ILU-Type Preconditioners

Author(s):  
Sanderson L. Gonzaga de Oliveira ◽  
Claudio Carvalho ◽  
Carla Osthoff
Keyword(s):  
1996 ◽  
Vol 69 (2) ◽  
pp. 303-318 ◽  
Author(s):  
Jocelyne Erhel ◽  
Kevin Burrage ◽  
Bert Pohl
Keyword(s):  

PAMM ◽  
2008 ◽  
Vol 8 (1) ◽  
pp. 10837-10838
Author(s):  
Jan Zítko
Keyword(s):  
The Real ◽  

Author(s):  
Gerard L. G. Sleijpen ◽  
Jasper van den Eshof ◽  
Martin B. van Gijzen

2012 ◽  
Vol 34 (2) ◽  
pp. A714-A736 ◽  
Author(s):  
Henri Calandra ◽  
Serge Gratton ◽  
Julien Langou ◽  
Xavier Pinel ◽  
Xavier Vasseur
Keyword(s):  

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Jiangzhou Lai ◽  
Linzhang Lu ◽  
Shiji Xu

Many large and sparse linear systems can be solved efficiently by restarted GMRES and CMRH methods Sadok 1999. The CMRH(m) method is less expensive and requires slightly less storage than GMRES(m). But like GMRES, the restarted CMRH method may not converge. In order to remedy this defect, this paper presents a polynomial preconditioner for CMRH-based algorithm. Numerical experiments are given to show that the polynomial preconditioner is quite simple and easily constructed and the preconditioned CMRH(m) with the polynomial preconditioner has better performance than CMRH(m).


1998 ◽  
Vol 19 (1) ◽  
pp. 15-26 ◽  
Author(s):  
Andreas Frommer ◽  
Uwe Glässner

Sign in / Sign up

Export Citation Format

Share Document