scientific article; zbMATH DE number 176179

[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.

Recommendations

Cited in

(6)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035283)