One can point out several applications to the solution of consecutive linear systems with symmetric positive-definite matrices. Such problems arise, for instance, in signal processing, modellization of grid systems, stress analysis and automatic control. We describe in this paper an efficient and ro
The preconditioned variational methods for solving large linear systems
โ Scribed by I.C. Demetriou; D.J. Evans
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 634 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
โฆ Synopsis
The c S nstant parameter, involves the spectra2 bounds of some matrices and can be obtained in O(N ) sine function evakations, where I/N is the discretization mesh size. It is shown that this parameter can be chosen in a stable manner in O(l) operations per iteration, if it is a22owed to vam with the iteration index from information derived from the gradient parameters.
๐ SIMILAR VOLUMES
## a b s t r a c t In this paper, we present the preconditioned generalized accelerated overrelaxation (GAOR) method for solving linear systems based on a class of weighted linear least square problems. Two kinds of preconditioning are proposed, and each one contains three preconditioners. We comp
This article surveys preconditioning techniques for the iterative solution of large linear systems, with a focus on algebraic methods suitable for general sparse matrices. Covered topics include progress in incomplete factorization methods, sparse approximate inverses, reorderings, parallelization i