Title of program: ICCG3 (Incomplete Cholesky factorized Con-treated by similar methods in two dimensions using the codes jugate Gradient algorithm for 3D symmetric problems) ICCG2 [4] and ILUCG2 [5]. These problems share the common feature of being stiff and requiring implicit solution Catalogue number: ACEX techniques. Sometimes, the resulting matrix equations are symmetric; we solve them here with the ICCG3 program. In a Program obtainable from: CPC Program Library, Queen's Uni-previous article we described a slower and more general algoversity of Belfast, N. Ireland (see application form in this issue) rithm, ILUCG3, which must be used when the matrix is asymmetric [6]. Computer: Cray-I; Installation: NMFECC, Livermore Method of solution Programming language used: FORTRAN A generalization of the incomplete Cholesky conjugate gradient (ICCO) algorithm is used to solve the linear symmetric matrix Operating system: CTSS equation [7,8].
Restrictions on the complexity of theproblem High speed store required: at least 13 * MN to 33 * MN (de-.
The discretization of the three-dimensional PDE and its pending on the version) where MN is the number of linear .