The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations
From MaRDI portal
Publication:796248
DOI10.1016/0377-0427(84)90030-XzbMath0543.65014MaRDI QIDQ796248
Publication date: 1984
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Normalized factorization procedures for the solution of self-adjoint elliptic partial differential equations in three-space dimensions
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations
- Normalized implicit methods for the solution of non-linear elliptic boundary value problems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- On the Equivalence of Certain Iterative Acceleration Methods
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- A generalized SSOR method
- Methods of conjugate gradients for solving linear systems
This page was built for publication: The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations
