𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conjugate gradient solution of linear equations

✍ Scribed by BRINCH HANSEN, PER

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
142 KB
Volume
10
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

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 textbooks. This tutorial explains conjugate gradients by deriving the computational steps from elementary mathematical concepts. The computation is illustrated by a numerical example and an algorithmic outline.

πŸ“œ SIMILAR VOLUMES

Using preconditioned conjugate gradient
Using preconditioned conjugate gradient for solving consecutive linear systems
✍ Blanc, J. Y. ;Comon, P. ;Trystram, D. πŸ“‚ Article πŸ“… 1990 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 481 KB πŸ‘ 1 views

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

Solving the finite difference linearized
Solving the finite difference linearized Poisson-Boltzmann equation: A comparison of relaxation and conjugate gradient methods
✍ M. E. Davis; J. A. McCammon πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 485 KB πŸ‘ 1 views

Comparisons have been made between relaxation methods and certain preconditioned conjugate gradient techniques for solving the system of linear equations arising from the finite-difference form of the linearized Poisson-Boltzmann equation. The incomplete Cholesky conjugate gradient (ICCG) method of