Improved polynomial bounds and acceleration of GMRES by solving a min-max problem on rectangles, and by deflating

Abstract Polynomial convergence bounds are considered for left, right and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system ${\mathbf{A}}{\mathbf{x}}={\mathbf{b}}$. In particular, the case of positive definite ${\mathbf{A}}$ is considered. The well-known polynomial bounds are generalized to the cases considered, and then reduced to solving a min-max problem on rectangles on the complex plane. Several approaches are considered and compared. The new bounds can be improved by using specific deflation spaces and preconditioners. This in turn accelerates the convergence of GMRES. Numerical examples illustrate the results obtained.