No label defined (Q4035283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 176179 |
Statements
18 May 1993
0 references
incomplete Cholesky conjugate gradient algorithm
0 references
iterative methods
0 references
convergence
0 references
sparse symmetric positive definite equations
0 references
0.842856228351593
0 references
[For the entire collection see Zbl 0753.00013.] Classical iterative methods often exhibit very poor convergence characteristics when applied to structural analysis problems. This paper presents an incomplete Cholesky conjugate gradient (ICCG) algorithm developed for general purpose use with large order sparse symmetric positive definite equations including those arising from structural analysis. This algorithm is robust in the sense that it can accept any symmetric positive definite set of equations without the possibility of pivoting problems or deterioration of convergence characteristics. It is also possible to be programmed in such a way that full use is made of sparsity. The ICCG method appears to be the first iterative technique having good (but not proven) convergence characteristics which is available to structural engineers and others who wish to solve symmetric positive definite equations with poor conditioning on a computer.
0 references