ESTS0170 ILUCG3.

ILUCG3, 3-D Partial Differential Equations Linear Asymmetric Matrix Solver

NAME OR DESIGNATION OF PROGRAM, COMPUTER, DESCRIPTION OF PROGRAM OR FUNCTION, METHOD OF SOLUTION, RESTRICTIONS ON THE COMPLEXITY OF THE PROBLEM, TYPICAL RUNNING TIME, UNUSUAL FEATURES OF THE PROGRAM, RELATED AND AUXILIARY PROGRAMS, STATUS, REFERENCES, MACHINE REQUIREMENTS, LANGUAGE, OPERATING SYSTEM UNDER WHICH PROGRAM IS EXECUTED, OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS, NAME AND ESTABLISHMENT OF AUTHORS, MATERIAL, CATEGORIES

[ top ]

1. NAME OR DESIGNATION OF PROGRAM: ILUCG3.

[ top ]

2. COMPUTERS

To submit a request, click below on the link of the version you wish to order. Only liaison officers are authorised to submit online requests. Rules for requesters are available here.

Program name	Package id	Status	Status date
ILUCG3	ESTS0170/01	Arrived	17-APR-2001

Machines used:

Package ID	Orig. computer	Test computer
ESTS0170/01	CRAY 1

[ top ]

3. DESCRIPTION OF PROGRAM OR FUNCTION

ILUCG3 (Incomplete LU factorized Conjugate Gradient algorithm for 3-D asymmetric matrix system arising from discretization of three-dimensional elliptic and parabolic partial differential equations found in plasma physics applications, such as plasma diffusion, equilibria, 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 ILUCG3, the discretization of the three-dimensional partial differential equation and its boundary conditions must result in a block-tridiagonal matrix. Its element 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 (ICCG) algorithm is used to solve the linear asymmetric matrix equation. Loops are arranged to vectorize on the Cray1 with the CFT compiler, wherever possible. Recursive loops, which cannot be vectorized, are written for optimum scalar speed. For problems having a symmetric matrix, ICCG3 should be used since it runs up to four times faster and uses approximately 30% less storage. Similar methods in two dimensions are available in ILUCG2 and ICCG2.

[ top ]

4. METHOD OF SOLUTION:

[ top ]

5. RESTRICTIONS ON THE COMPLEXITY OF THE PROBLEM:

[ top ]

6. TYPICAL RUNNING TIME:

[ top ]

7. UNUSUAL FEATURES OF THE PROGRAM:

[ top ]

8. RELATED AND AUXILIARY PROGRAMS:

[ top ]

9. STATUS

Package ID	Status date	Status
ESTS0170/01	17-APR-2001	Masterfiled Arrived

[ top ]

10. REFERENCES:

ESTS0170/01, included references:

- D.V. Anderson:
  ILUCG3 - Subprograms for the Solution of a Linear Asymmetric
  Matrix Equation Arising from A7, 15, 19, or 27 Point 3D
  Discretization
  UCRL-88745 Preprint (February 1983).

[ top ]

11. MACHINE REQUIREMENTS

At least 15*mn to 59*mn, depending on user parameters, where mn is the number of linear equations.

[ top ]

12. PROGRAMMING LANGUAGE(S) USED

Package ID	Computer language
ESTS0170/01	FORTRAN

[ top ]

13. OPERATING SYSTEM UNDER WHICH PROGRAM IS EXECUTED: CTSS.

[ top ]

14. OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS:

[ top ]

15. NAME AND ESTABLISHMENT OF AUTHORS

- Anderson, D.V.
Lawrence Livermore National Lab., CA
United States

[ top ]

16. MATERIAL AVAILABLE

ESTS0170/01

source program   mag tapeILUCG3 Generalized Source                  SRCTP
source program   mag tapeILUCG3 FORTRAN Source                      SRCTP
report                   UCRL-88745 Preprint (February 1983)        REPPT

[ top ]

17. CATEGORIES

P. General Mathematical and Computing System Routines
X. Magnetic Fusion Research

Keywords: differential equations, iterative methods, numerical solution, phase space, plasma, transport theory.