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 sche
Practical Implementation of Krylov Subspace Spectral Methods
β Scribed by James V. Lambers
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 551 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0885-7474
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this
In this paper we consider the problem of approximating the solution of infinite linear systems, finitely expressed by a sparse coefficient matrix. We analyse an algorithm based on Krylov subspace methods embedded in an adaptive enlargement scheme. The management of the algorithm is not trivial, due