Adaptive solution of infinite linear systems by Krylov subspace methods
β Scribed by P. Favati; G. Lotti; O. Menchi; F. Romani
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 238 KB
- Volume
- 210
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
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 to the irregular convergence behaviour frequently displayed by Krylov subspace methods for nonsymmetric systems. Numerical experiments, carried out on several test problems, indicate that the more robust methods, such as GMRES and QMR, embedded in the adaptive enlargement scheme, exhibit good performances.
π SIMILAR VOLUMES
It is well known that a number of solutions may coexist in non-linear systems. Therefore, a complete solution diagram is very important in solving non-linear vibration problems in order to ensure that all possible solutions have been sought. This paper is aimed at seeking solution diagrams by means