The conjugate gradient method is an ingenious method for iterative solution of sparse linear equations. It is now a standard benchmark for parallel scientific computing. In the author's opinion, the apparent mystery of this method is largely due to the inadequate way in which it is presented in text
โฆ LIBER โฆ
A constrained conjugate gradient method and the solution of linear equations
โ Scribed by M.H.B.M. Shariff
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 618 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Conjugate gradient solution of linear eq
โ
BRINCH HANSEN, PER
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 142 KB
๐ 1 views
The solution of sparse linear equations
โ
A. Jennings; G. M. Malik
๐
Article
๐
1978
๐
John Wiley and Sons
๐
English
โ 930 KB
## 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.
Generalized method of conjugate gradient
โ
G. V. Savinov
๐
Article
๐
1985
๐
Springer US
๐
English
โ 255 KB
Conjugate gradient type methods for unsy
โ
Owe Axelsson
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 811 KB
The solution of higher order integration
โ
A. L. Carter; G. R. Shiflett; A. J. Laub
๐
Article
๐
1984
๐
John Wiley and Sons
๐
English
โ 483 KB
Solution to unsymmetric finite element d
โ
Giuseppe Gambolati
๐
Article
๐
1979
๐
Elsevier Science
๐
English
โ 694 KB