CONVERGENCE OF RESTARTED KRYLOV SUBSPACE METHODS FOR STIELTJES FUNCTIONS OF MATRICES

To approximate f(A)b-the action of a matrix function on a vector-by a Krylov subspace method, restarts may become mandatory due to storage requirements for the Arnoldi basis or due to the growing computational complexity of evaluating f on a Hessenberg matrix of growing size. A number of restarting methods have been proposed in the literature in recent years and there has been substantial algorithmic advancement concerning their stability and computational efficiency. However, the question under which circumstances convergence of these methods can be guaranteed has remained largely unanswered. In this paper we consider the class of Stieltjes functions and a related class, which contain important functions like the (inverse) square root and the matrix logarithm. For these classes of functions we present new theoretical results which prove convergence for Hermitian positive definite matrices A and arbitrary restart lengths. We also propose a modification of the Arnoldi approximation which guarantees convergence for the same classes of functions and any restart length if A is not necessarily Hermitian but positive real (i.e., has its field of values in the right half-plane).