Generalized conjugate gradient method for nonsymmetric systems of linear equations
A generalized conjugate gradient method is considered for solving systems of linear equations having nonsymmetric coefficient matrices with positive-definite symmetric part. The method is based on splitting the matrix into its symmetric and skew-symmetric parts, and then accelerating the associated iteration by using conjugate gradients; the method simplifies in this case, as only one of the two usual parameters is required. The method is most effective for cases in which the symmetric part of the matrix corresponds to an easily solvable system of equations. Convergence properties are discussed, as well as an application to the numerical solution of elliptic partial differential equations.
- Research Organization:
- California Univ., Berkeley (USA). Lawrence Berkeley Lab.
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 7365917
- Report Number(s):
- LBL-4636; CONF-751230-1; STAN-CS-75-535
- Country of Publication:
- United States
- Language:
- English
Similar Records
Generalized conjugate gradient method for the numerical solution of elliptic partial differential equations
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]