1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
/*----------------------------------------------------------------------------
ADOL-C -- Automatic Differentiation by Overloading in C++
File: cubic-iter-2.cpp
Revision: $Id$
Contents: example for cubic lighthouse example of Griewank's Book
using iterative solvers
(output of z_k and dz_k for fixed t)
Copyright (c) Andrea Walther, Andreas Griewank, Andreas Kowarz,
Hristo Mitev, Sebastian Schlenkrich, Jean Utke, Olaf Vogel
This file is part of ADOL-C. This software is provided as open source.
Any use, reproduction, or distribution of the software constitutes
recipient's acceptance of the terms of the accompanying license file.
---------------------------------------------------------------------------*/
/****************************************************************************/
/* INCLUDES */
#include <adolc/adolc.h>
#include <math.h>
/****************************************************************************/
/* ADOUBLE ROUTINE */
adouble g( adouble z, adouble t ) {
adouble v1, v15, v2, v3, res;
v1 = z - 2.0;
v15 = v1*v1*v1;
v15 += 0.4;
v2 = tan(t);
v15 -= z * v2;
v3 = 3.0*v1*v1-v2;
v3 = fabs(v3);
res = z - v15/v3;
return res;
}
/****************************************************************************/
/* MAIN PROGRAM */
int main() {
int j, ic;
int tag = 1;
double z, dz, z0, dz0, t;
double x[2], gradg[2];
/*--------------------------------------------------------------------------*/
/* Preparation */
fprintf(stdout,"CUBIC LIGHTHOUSE Using ITERATION 2 (ADOL-C Example)\n\n");
z0 = 2.1;
dz0 = 0.0;
fprintf(stdout,"t = ? \n");
scanf("%le",&t);
fprintf(stdout,"How many iterations = ? \n");
scanf("%d",&ic);
/*--------------------------------------------------------------------------*/
/* 0. time (taping) */
trace_on(tag);
adouble az,at;
az <<= z0;
at <<= t;
az = g(az,at);
az >>= z;
trace_off();
/*--------------------------------------------------------------------------*/
size_t tape_stats[STAT_SIZE];
tapestats(tag,tape_stats);
fprintf(stdout,"\n independents %zu\n",tape_stats[NUM_INDEPENDENTS]);
fprintf(stdout," dependents %zu\n",tape_stats[NUM_DEPENDENTS]);
fprintf(stdout," operations %zu\n",tape_stats[NUM_OPERATIONS]);
fprintf(stdout," operations buffer size %zu\n",tape_stats[OP_BUFFER_SIZE]);
fprintf(stdout," locations buffer size %zu\n",tape_stats[LOC_BUFFER_SIZE]);
fprintf(stdout," constants buffer size %zu\n",tape_stats[VAL_BUFFER_SIZE]);
fprintf(stdout," maxlive %zu\n",tape_stats[NUM_MAX_LIVES]);
fprintf(stdout," valstack size %zu\n\n",tape_stats[TAY_STACK_SIZE]);
/*--------------------------------------------------------------------------*/
x[1] = t;
x[0] = z0;
dz = dz0;
fprintf(stdout," %e %e\n",x[0],dz);
for (j=0; j<ic; j++) {
function(tag,1,2,x,&z);
gradient(tag,2,x,gradg);
x[0] = z;
dz = gradg[0]*dz + gradg[1];
fprintf(stdout," %e %e\n",x[0],dz);
}
/*--------------------------------------------------------------------------*/
return 1;
}
|
