We discuss a class of deflated block Krylov subspace methods for solving large scale matrix eigenvalue problems. The efficiency of an Arnoldi-type method is examined in computing partial or closely clustered eigenvalues of large matrices. As an improvement, we also propose a refined variant of the A
Deflated Krylov subspace methods for nearly singular linear systems
โ Scribed by J. C. Meza; W. W. Symes
- Book ID
- 105012848
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 956 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Consider the linear system Ax = b, where A โ C NรN is a singular matrix. In the present work we propose a general framework within which Krylov subspace methods for Drazininverse solution of this system can be derived in a convenient way. The Krylov subspace methods known to us to date treat only th