ESTS0168 ICCG3. (Abstract last modified 17-APR-2001)
1.
NAME OR DESIGNATION OF PROGRAM - ICCG3. 2.
COMPUTER FOR WHICH PROGRAM IS DESIGNED AND OTHER MACHINE VERSION PACKAGES AVAILABLE -
To request or retrieve programs click on the one of the active versions below.
A password and special authorization is required. Explanation of the status codes.
Machines used:
Package-ID Orig.Computer Test Computer
ESTS0168/01 CRAY 1
3.
DESCRIPTION OF PROGRAM OR FUNCTION - ICCG3 (Incomplete Cholesky factorized Conjugate Gradient algorithm for 3d symmetric problems) was developed to solve a linear symmetric matrix system arising from discretization of three-dimensional elliptic and parabolic partial differential equations found in plasma physics applications, such as resistive MHD, spatial diffusive transport, and phase space transport (Fokker-Planck equation) problems. These problems share the common feature of being stiff and requiring implicit solution techniques. When these parabolic or elliptic PDE's are discretized with finite-difference or finite-element methods, the resulting matrix system is frequently of block-tridiagonal form. To use ICCG3, the discretization of the three-dimensional partial differential equation and its boundary conditions must result in a block- tridiagonal matrix. Its elements in turn are block-tridiagonal sub- matrices composed of elementary sub-sub-matrices that are also tridiagonal. A generalization of the incomplete Cholesky conjugate gradient algorithm is used to solve the linear symmetric matrix equation. Loops are arranged to vectors on the Cray1 with the CFT compiler, wherever possible. Recursive loops, which cannot be vectorized, are written for optimum scalar speed. For problems having an asymmetric matrix, ILUCG3 (NESC 9927) should be used. Similar methods in two dimensions are available in ILUCG2 (NESC 9929) and ICCG2 (NESC 9928).
4.
METHOD OF SOLUTION - 5.
RESTRICTIONS ON THE COMPLEXITY OF THE PROBLEM - 6.
TYPICAL RUNNING TIME - 7.
UNUSUAL FEATURES OF THE PROGRAM - 8.
RELATED AND AUXILIARY PROGRAMS - 9.
STATUS 10.
REFERENCES - 11.
MACHINE REQUIREMENTS - At least 13*mn to 33*mn, depending on user parameters, where mn is the number of linear equations.
12.
PROGRAMMING LANGUAGE(S) USED - 13.
OPERATING SYSTEM UNDER WHICH PROGRAM IS EXECUTED - CTSS. 14.
OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS - 15.
NAME AND ESTABLISHMENT OF AUTHORS - 16.
MATERIAL AVAILABLE - 17.
CATEGORIES - Keywords: DIFFERENTIAL EQUATIONS, ITERATIVE METHODS, NUMERICAL SOLUTION, PHASE SPACE, PLASMA, TRANSPORT THEORY
Program-name Package-ID Status
ICCG3 ESTS0168/01 Arrived
ESTS0168/01: 17-APR-2001 Masterfiled Arrived
ESTS0168/01:
- D.V. Anderson:
ICCG3 - Subprogramm for the Solution of a Linear Symmetric Matrix
Equation Arising from A7, 15, 19, or 27 Point 3D Discretization
UCRL-88746 Preprint (February 1983).
ESTS0168/01: FORTRAN
- Anderson, D.V.
Lawrence Livermore National Lab., CA (United States)
ESTS0168/01:
ICCG3 Generalized Source FORTRAN
ICCG3 Generalized Source Example
report UCRL-88746 Preprint (February 1983) REPPT
- P. General Mathematical and Computing System Routines
- X. Magnetic Fusion Research
Home - About Us - Work Areas - Data Bank - Publications - Press Room - List of acronyms - Search