Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
✍ Scribed by Martin Afanasjew; Michael Eiermann; Oliver G. Ernst; Stefan Güttel
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 511 KB
- Volume
- 429
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
A new implementation of restarted Krylov subspace methods for evaluating f (A)b for a function f, a matrix A and a vector b is proposed. In contrast to an implementation proposed previously, it requires constant work and constant storage space per restart cycle. The convergence behavior of this scheme is discussed and a new stopping criterion based on an error indicator is given. The performance of the implementation is illustrated for three parabolic initial value problems, requiring the evaluation of exp(A)b.
📜 SIMILAR VOLUMES
Discretization of boundary integral equations leads, in general, to fully populated complex valued non-Hermitian systems of equations. In this paper we consider the e cient solution of these boundary element systems by preconditioned iterative methods of Krylov subspace type. We devise preconditione
In this paper we consider an underdetermined system of equations Lx ϭ b so m Ͻ n. However, the methods given We present an iterative method of preconditioned Krylov type for the solution of large least squares problems. We prove that the in Section 3 can also be used for overdetermined systems. me
We analyze the behavior of Krylov subspace methods for the solution of the symmetric system Mx = (Mγ I )v when γ is close to some of the extreme eigenvalues of M. We show that a stagnation phase may occur if the structure of the right-hand side is not taken into account, and we analyze the occurrenc