In this paper, we investigate a method for restarting the Lanczos method for approximating the matrix-vector product *f(A)b*, where *A ∈ ℝn×n* is a symmetric matrix. For analytic *f* we derive a novel restart function that identifies the error in the Lanczos approximation. The restart procedure is then generated by a restart formula using a sequence of these restart functions. We present an error bound for the proposed restart scheme. We also present an error bound for the restarted Lanczos approximation of *f(A)b* for symmetric positive definite *A* when *f* is in a particular class of completely monotone functions. We illustrate for some important matrix function applications the usefulness of these bounds for terminating the restart proc...
In this paper, we propose a restarted variant of the Lanczos method for symmetric eigenvalue problem...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...
In this paper, we investigate a method for restarting the Lanczos method for approximating the matri...
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm...
The Lanczos algorithm is a well known technique for approximating a few eigenvalues and correspondin...
Matrix functions of the form $f(A)v$, where $A$ is a large symmetric matrix, $f$ is afunction, and $...
The threeterm Lanczos process for a symmetric matrix leads to bases for Krylov subspaces of incre...
Abstract. The three-term Lanczos process for a symmetric matrix leads to bases for Krylov subspaces ...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
The Lanczos process constructs a sequence of orthonormal vectors $v_m$ spanning a nested sequence of...
AbstractLet A be a square symmetric n × n matrix, φ be a vector from Rn, and f be a function defined...
AbstractA new implementation of restarted Krylov subspace methods for evaluating f(A)b for a functio...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
The 3-term Lanczos process leads, for a symmetric matrix, to bases for Krylov subspaces of increasin...
In this paper, we propose a restarted variant of the Lanczos method for symmetric eigenvalue problem...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...
In this paper, we investigate a method for restarting the Lanczos method for approximating the matri...
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm...
The Lanczos algorithm is a well known technique for approximating a few eigenvalues and correspondin...
Matrix functions of the form $f(A)v$, where $A$ is a large symmetric matrix, $f$ is afunction, and $...
The threeterm Lanczos process for a symmetric matrix leads to bases for Krylov subspaces of incre...
Abstract. The three-term Lanczos process for a symmetric matrix leads to bases for Krylov subspaces ...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
The Lanczos process constructs a sequence of orthonormal vectors $v_m$ spanning a nested sequence of...
AbstractLet A be a square symmetric n × n matrix, φ be a vector from Rn, and f be a function defined...
AbstractA new implementation of restarted Krylov subspace methods for evaluating f(A)b for a functio...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
The 3-term Lanczos process leads, for a symmetric matrix, to bases for Krylov subspaces of increasin...
In this paper, we propose a restarted variant of the Lanczos method for symmetric eigenvalue problem...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...
Breakdown in Lanczos-type algorithms is a common phenomenon which is due to the non-existence of som...