12
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

On sparse and compact preconditioned conjugate gradient methods for partial differential equations

, &
Pages 55-80 | Received 01 Dec 1979, Published online: 19 Mar 2007
 

Abstract

This paper generalises the preconditioning techniques, introduced by Evans [2], and defines sparse and compact preconditioned iterative methods for the numerical solution of the linear system Au = b.The difference between the methods is shown to depend on whether a conditioning matrix R consists of components derived from a splitting or factorization of A. Some theoretical results for the iterative schemes are given when A has particular properties such as consistent ordering, irreducibility, diagonal dominance, positive definiteness, etc., when derived from the finite difference discretisation of a 2nd order self-adjoint elliptic partial differential equation. Finally, the application of both forms of preconditioning to the Conjugate Gradient method is presented and computational results compared.

†Unit of Applied Mathematics. University of Athens. Greece.

†Unit of Applied Mathematics. University of Athens. Greece.

Notes

†Unit of Applied Mathematics. University of Athens. Greece.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.