## Abstract The convergence properties of the conjugate gradient method are discussed in relation to relaxation methods and Chebyshev accelerated Jacobi iteration when applied to the solution of large sets of linear equations which have a sparse, symmetric and positive definite coefficient matrix.
โฆ LIBER โฆ
Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
โ Scribed by Munksgaard, N.
- Book ID
- 118013359
- Publisher
- Association for Computing Machinery
- Year
- 1980
- Tongue
- English
- Weight
- 726 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0098-3500
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The solution of sparse linear equations
โ
A. Jennings; G. M. Malik
๐
Article
๐
1978
๐
John Wiley and Sons
๐
English
โ 930 KB
Solving large and sparse linear least-sq
โ
Z. Zlatev; H.B. Nielsen
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 563 KB
The use of second degree normalized impl
โ
Elias A. Lipitakis
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 394 KB
Solving systems of elastic bar structure
โ
I. Arany
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 790 KB
For solving systems of linear equations derived from structural analysis by conjugate gradient method, a new efficient .incomplete factorization preconditioning was published by Saint-Georges et al. [1]. Here we present an algorithm for finding a starting point for the ordering applied in [1] based
A Parallel Preconditioned Block Conjugat
โ
Luis Vidal-Ascon; Thomas Grace; Perpetua Ruiz-Mostacero; Alberto Vidal-Ascon
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 595 KB
A normalized implicit conjugate gradient
โ
D.J. Evans; E.A. Lipitakis
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 1007 KB