On the Admissible Convergence Curves for Restarted Gmres
نویسنده
چکیده
Abstract. This paper studies admissible convergence curves for restarted GMRES and their relation to the curves for full GMRES. It shows that stagnation at the end of a restart cycle is mirrored at the beginning of the next cycle. Otherwise, any non-increasing convergence curve is possible and pairs {A, b} are constructed such that when restarted GMRES is applied to Ax = b, prescribed residual norms and Ritz values for the individual cycles are generated. Additionally, A can have any spectrum. The constructed systems lead to full GMRES processes that can be generated with short recurrences and offer some insight into the phenomenon of larger restart lengths being able to result in slower convergence.
منابع مشابه
Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles
We show that any admissible cycle-convergence behavior is possible for restarted GMRES at a number of initial cycles, moreover the spectrum of the coefficient matrix alone does not determine this cycleconvergence. The latter can be viewed as an extension of the result of Greenbaum, Pták and Strakoš (SIAM Journal on Matrix Analysis and Applications 1996; 17(3):465–469) to the case of restarted G...
متن کاملWeighted Inner Products for GMRES and GMRES-DR
The convergence of the restarted GMRES method can be significantly improved, for some problems, by using a weighted inner product that changes at each restart. How does this weighting affect convergence, and when is it useful? We show that weighted inner products can help in two distinct ways: when the coefficient matrix has localized eigenvectors, weighting can allow restarted GMRES to focus o...
متن کاملThe Cycle-Convergence of Restarted GMRES for Normal Matrices Is Sublinear
We prove that the cycle–convergence of the restarted GMRES applied to a system of linear equations with a normal coefficient matrix is sublinear.
متن کاملOn the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
The solution of nonsymmetric systems of linear equations continues to be a diicult problem. A main algorithm for solving nonsymmetric problems is restarted GMRES. The algorithm is based on restarting full GMRES every s iterations, for some integer s>0. This paper considers the impact of the restart frequency s on the convergence and work requirements of the method. It is shown that a good choic...
متن کاملSome Remarks on the Restarted and Augmented Gmres Method
Starting from the residual estimates for GMRES formulated by many authors, usually in terms of the quotient of the Hermitian part and the norm of a matrix or by using the field of values of a matrix, we present more general estimates which hold also for restarted and augmented GMRES. Sufficient conditions for convergence are formulated. All estimates are independent on the choice of an initial ...
متن کامل