Incomplete factorization technique for positive definite linear systems
This paper describes a technique for solving the large sparse symmetric linear systems that arise from the application of finite element methods. The technique combines an incomplete factorization method called the shifted incomplete Cholesky factorization with the method of generalized conjugate gradients. The shifted incomplete Cholesky factorization produces a splitting of the matrix A that is dependent upon a parameter ..cap alpha... It is shown that if A is positive definite, then there is some ..cap alpha.. for which this splitting is possible and that this splitting is at least as good as the Jacobi splitting. The method is shown to be more efficient on a set of test problems than either direct methods or explicit iteration schemes.
- OSTI ID:
- 5346805
- Journal Information:
- Math. Comput.; (United States), Journal Name: Math. Comput.; (United States) Vol. 34:154; ISSN MCMPA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving structures problems iteratively with a shifted incomplete Cholesky preconditioning
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]