Generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. [Solution of sparse, symmetric, positive-definite systems of linear equations arising from discretization of boundary-value problems for elliptic partial differential equations]
A generalized conjugate gradient method is considered for solving sparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations. The method is based on splitting off from the original coefficient matrix a symmetric, positive-definite one which corresponds to a more easily solvable system of equations, and then accelerating the associated iteration by using conjugate gradients. Optimality and convergence properties are presented, and the relation to other methods is discussed. Several splittings for which the method seems particularly effective are also discussed; and for some, numerical examples are given. 1 figure, 1 table. (auth)
- Research Organization:
- Stanford Univ., Calif. (USA). Dept. of Computer Science
- OSTI ID:
- 7365915
- Report Number(s):
- SU-326-P30-44
- Country of Publication:
- United States
- Language:
- English
Similar Records
Generalized conjugate gradient method for nonsymmetric systems of linear equations. [Solution of systems of linear equations such as arise in solution of elliptic partial differential equations]
Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method