On the discrete dynamic nature of the conjugate gradient method

Authors:
Y. T. Feng
Affiliations:
Civil and Computational Engineering Centre, School of Engineering, University of Wales Swansea, Singleton Park, Swansea Wales SA2 8PP, UK
Venue:
Journal of Computational Physics
Year:
2006

Citing 3
Cited 3

CGS, a fast Lanczos-type solver for nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Preconditioning techniques for large linear systems: a survey

Journal of Computational Physics

Discrete thermal element modelling of heat conduction in particle systems: Basic formulations

Journal of Computational Physics
Variable Relaxation Solve for Nonlinear Thermal Conduction

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A directed Monte Carlo solution of linear stochastic algebraic system of equations

Finite Elements in Analysis and Design

Quantified Score

Hi-index	31.45

Visualization

Abstract

The primary objective of this technical note is to establish an equivalence between the (preconditioned) conjugate gradient (PCG) algorithm and a special central difference based DR procedure, thereby revealing a discrete dynamic nature of the CG iterative procedure. This may therefore provide an alterative viewpoint to gain a further understanding of the CG method and its variants.