Convergence in Backward Error of Relaxed GMRES
نویسندگان
چکیده
منابع مشابه
Convergence in Backward Error of Relaxed GMRES
This work is the follow-up of the experimental study presented in [3]. It is based on and extends some theoretical results in [15, 18]. In a backward error framework we study the convergence of GMRES when the matrixvector products are performed inaccurately. This inaccuracy is modeled by a perturbation of the original matrix. We prove the convergence of GMRES when the perturbation size is propo...
متن کاملA note on relaxed and flexible GMRES
We consider the solution of a linear system of equations using the GMRES iterative method. In [3], a strategy to relax the accuracy of the matrix-vector product is proposed for general systems and illustrated on a large set of numerical experiments. This work is based on some heuristic considerations and proposes a strategy that often enables a convergence of the GMRES iterates xk within a rela...
متن کاملComputable Convergence Bounds for GMRES
The purpose of this paper is to derive new computable convergence bounds for GMRES. The new bounds depend on the initial guess and are thus conceptually different from standard “worst-case” bounds. Most importantly, approximations to the new bounds can be computed from information generated during the run of a certain GMRES implementation. The approximations allow predictions of how the algorit...
متن کاملConvergence of GMRES for Tridiagonal Toeplitz Matrices
Abstract. We analyze the residuals of GMRES [9], when the method is applied to tridiagonal Toeplitz matrices. We first derive formulas for the residuals as well as their norms when GMRES is applied to scaled Jordan blocks. This problem has been studied previously by Ipsen [5], Eiermann and Ernst [2], but we formulate and prove our results in a different way. We then extend the (lower) bidiagona...
متن کاملHow Descriptive Are Gmres Convergence Bounds?
Eigenvalues with the eigenvector condition number, the eld of values, and pseu-dospectra have all been suggested as the basis for convergence bounds for minimum residual Krylov subspace methods applied to non-normal coeecient matrices. This paper analyzes and compares these bounds, illustrating with six examples the success and failure of each one. Reened bounds based on eigenvalues and the eld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2007
ISSN: 1064-8275,1095-7197
DOI: 10.1137/040608416