We study nonstationary iterative methods for solving preconditioned systems arising from discretizations of the convection-diffusion equation. The preconditioners arise from Gauss-Seidel methods applied to the original system. It is shown that the performance of the iterative solvers is affected by
On a variable smoothing procedure for Krylov subspace methods
β Scribed by M. Heyouni; H. Sadok
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 601 KB
- Volume
- 268
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
It is known that the convergence behavior of Galerkin-Krylov subspace methods for solving linear systems can be very erratic. A smoothing technique or a minimal residual seminorm variant of these Galerkin methods can be proposed to eliminate this problem. In this paper we examine a class of minimal residual seminorm methods, and show that this class of methods can be obtained from a variable smoothing technique applied to Galerkin methods.
π SIMILAR VOLUMES
## Abstract Many different techniques to reduce the dimensions of a model have been proposed in the near past. Krylov subspace methods are relatively cheap, but generate nonβoptimal models. In this paper a combination of Krylov subspace methods and orthonormal vector fitting (OVF) is proposed. In t
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