NESC1058 JAKEF.
JAKEF, Gradient or Jacobian Function from Objective Function or Vector Function
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 ]
[ top ]
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 |
|---|---|---|---|
| JAKEF | NESC1058/02 | Tested | 26-OCT-1988 |
Machines used:
| Package ID | Orig. computer | Test computer |
|---|---|---|
| NESC1058/02 | Many Computers | DEC VAX 8810 |
[ top ]
3. DESCRIPTION OF PROGRAM OR FUNCTION
JAKEF is a language processor that accepts as input a single- or double-precision ANSI standard 1977 FORTRAN subroutine defining an objective function f(x), or a vector function F(x), and produces as output a single- or double- precision ANSI standard 1977 FORTRAN subroutine defining the gradient of f(x), or the Jacobian of F(x).
JAKEF is a language processor that accepts as input a single- or double-precision ANSI standard 1977 FORTRAN subroutine defining an objective function f(x), or a vector function F(x), and produces as output a single- or double- precision ANSI standard 1977 FORTRAN subroutine defining the gradient of f(x), or the Jacobian of F(x).
[ top ]
4. METHOD OF SOLUTION
JAKEF is a four-pass compiler consisting of a lexical preprocessor, a parser, a tree-building and flow analysis pass, and a differentiator and output construction pass. The lexical preprocessor reworks the input FORTRAN program to give it a recognizable lexical structure. The parser transforms the preprocessed input into a string of tokens in a postfix representation of the program tree. The tree-building and flow analysis pass constructs a tree out of the postfix token string. The differentiator indentifies relevant assignment statements; then, if necessary, it analyzes them into component statements governed by a single differentiation rule and augments each of these statements with a call to a member of the run-time support package which implements the differentiation rule. After completing the construction of the main body of the routine, JAKEF inserts calls to support package routines that complete the differentiation. This results in a modified program tree in a form compatible with FORTRAN rules.
JAKEF is a four-pass compiler consisting of a lexical preprocessor, a parser, a tree-building and flow analysis pass, and a differentiator and output construction pass. The lexical preprocessor reworks the input FORTRAN program to give it a recognizable lexical structure. The parser transforms the preprocessed input into a string of tokens in a postfix representation of the program tree. The tree-building and flow analysis pass constructs a tree out of the postfix token string. The differentiator indentifies relevant assignment statements; then, if necessary, it analyzes them into component statements governed by a single differentiation rule and augments each of these statements with a call to a member of the run-time support package which implements the differentiation rule. After completing the construction of the main body of the routine, JAKEF inserts calls to support package routines that complete the differentiation. This results in a modified program tree in a form compatible with FORTRAN rules.
[ top ]
[ top ]
[ top ]
7. UNUSUAL FEATURES OF THE PROGRAM
JAKEF produces derivative codes that are reliable, as accurate as their hand-coded counterparts, and more accurate than difference approximations. Timming tests indicate that the gradient codes are more efficient and the Jacobian codes less efficient than differencing schemes.
JAKEF produces derivative codes that are reliable, as accurate as their hand-coded counterparts, and more accurate than difference approximations. Timming tests indicate that the gradient codes are more efficient and the Jacobian codes less efficient than differencing schemes.
[ top ]
[ top ]
10. REFERENCES
- JAKEF, NESC No. 1058, JAKEF Tape Description,
National Energy Softawre Center Note 87-87, August 28, 1987.
- JAKEF, NESC No. 1058, JAKEF Tape Description,
National Energy Softawre Center Note 87-87, August 28, 1987.
NESC1058/02, included references:
- K.E. Hillstrom:User Guide for JAKEF.
ANL/MCS-TM-16, Rev. 1 (December 1985)
- K.E. Hillstrom:
Installation Guide for JAKEF.
ANL/MCS-TM-17, Rev. 1 (December 1985)
- L. Eyberger:
Availability of JAKEF Replacement Edition
NESC Note 87-94 (September 25, 1987)
[ top ]
11. MACHINE REQUIREMENTS
167K bytes of memory are required for execution on a DEC VAX11/780; the IBM4331 requires 581K bytes of memory.
NESC9877/01: Storage requirements for running the tests on a VAX-11/780 computer are: 164K bytes (JAKEF processor); 48K bytes (single-precision checkout programs); 70K bytes (double-precision checkout programs).
167K bytes of memory are required for execution on a DEC VAX11/780; the IBM4331 requires 581K bytes of memory.
NESC9877/01: Storage requirements for running the tests on a VAX-11/780 computer are: 164K bytes (JAKEF processor); 48K bytes (single-precision checkout programs); 70K bytes (double-precision checkout programs).
[ top ]
[ top ]
14. OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS
JAKEF uses an extented character set and transfer of control into an IF- block from outside the IF-block. Consequently, it is portable in the sense that it can be used without alteration at any installation that accepts these conditions. In particular, JAKEF is not compatible with the CDC FTN5 compiler.
JAKEF uses an extented character set and transfer of control into an IF- block from outside the IF-block. Consequently, it is portable in the sense that it can be used without alteration at any installation that accepts these conditions. In particular, JAKEF is not compatible with the CDC FTN5 compiler.
[ top ]
[ top ]
NESC1058/02
| File name | File description | Records |
|---|---|---|
| NESC1058_02.001 | Information file | 102 |
| NESC1058_02.002 | Command procedure for 4 sample problems | 88 |
| NESC1058_02.003 | Sample main program for JAKEF processor | 11 |
| NESC1058_02.004 | JAKED1 interface routine | 52 |
| NESC1058_02.005 | JAKEF1 interface routine | 41 |
| NESC1058_02.006 | JAKEF processor | 5997 |
| NESC1058_02.007 | Single-precision run-time routines | 162 |
| NESC1058_02.008 | Double-precision run-time routines | 162 |
| NESC1058_02.009 | JAKEF user guide | 1272 |
| NESC1058_02.010 | Single-precision CHEB function/Sample-1 | 33 |
| NESC1058_02.011 | Single-precision CHEB driver | 162 |
| NESC1058_02.012 | Single-precision WATSN function/Sample-2 | 33 |
| NESC1058_02.013 | Single-precision WATSN driver | 166 |
| NESC1058_02.014 | Double-precision CHEB function/Sample 3 | 33 |
| NESC1058_02.015 | Double-precision CHEB driver | 162 |
| NESC1058_02.016 | Ddouble-precision WATSN function/Sample 4 | 33 |
| NESC1058_02.017 | Double-precision WATSN driver | 166 |
| NESC1058_02.018 | VAX command procedure for Sample-1 | 53 |
| NESC1058_02.019 | IBM command procedure for Sample-1 | 53 |
| NESC1058_02.020 | Produced function from sample case 1 | 67 |
| NESC1058_02.021 | Produced function from sample case 2 | 71 |
| NESC1058_02.022 | Produced function from sample case 3 | 67 |
| NESC1058_02.023 | Produced function from sample case 4 | 71 |
| NESC1058_02.024 | Check-out for sample case 1 | 33 |
| NESC1058_02.025 | Check-out for sample case 2 | 33 |
| NESC1058_02.026 | Check-out for sample case 3 | 33 |
| NESC1058_02.027 | Check-out for sample case 4 | 33 |
Keywords: FORTRAN, algorithms, differential equations.