๐”– Bobbio Scriptorium
โœฆ   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

## 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.

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