𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Computational Schemes of the Conjugate Gradient Method for Solving Linear Systems

✍ Scribed by Stepan G. Mulyarchik; Stanislav S. Bielawski; Andrew V. Popov


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
444 KB
Volume
110
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


CONJUGATE GRADIENT METHODS FOR SOLVING T
✍ Y. T. FENG; D. R. J. OWEN πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1000 KB

In this paper, a detailed description of CG for evaluating eigenvalue problems by minimizing the Rayleigh quotient is presented from both theoretical and computational viewpoints. Three variants of CG together with their asymptotic behaviours and restarted schemes are discussed. In addition, it is s

Solving the finite difference linearized
✍ 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

Parallel Multigrid Preconditioning of th
✍ Leesa Brieger; Giuditta Lecca πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 186 KB

Parallel preconditioners are considered for improving the convergence rate of the conjugate gradient method for solving sparse symmetric positive definite systems generated by finite element models of subsurface flow. The difficulties of adapting effective sequential preconditioners to the parallel

A note on the efficiency of the conjugat
✍ Xing Cai; BjΓΈrn Fredrik Nielsen; Aslak Tveito πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 1 views

## Abstract We discuss the efficiency of the conjugate gradient (CG) method for solving a sequence of linear systems; __Au__^__n__+1^ = __u__^__n__^, where __A__ is assumed to be sparse, symmetric, and positive definite. We show that under certain conditions the Krylov subspace, which is generated