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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
#include "sys-defines.h"
#include "ode.h"
#include "extern.h"
#include "num.h"
#define T_LT_TSTOP (tstep>0 ? t<tstop : t>tstop)
/*
* Fifth-Order Runge-Kutta-Fehlberg with adaptive step size
* Copyright Nicholas B. Tufillaro, 1982-1994. All rights reserved.
* GNU enhancements copyright (C) 1996-1997 Free Software Foundation, Inc.
*/
void
#ifdef _HAVE_PROTOS
rka (void)
#else
rka ()
#endif
{
bool gdval = true; /* good value to print ? */
int overtime = 1;
double prevstep = 0.0;
double t;
for (it = 0, t = tstart; T_LT_TSTOP || overtime--; )
{
symtab->sy_value = symtab->sy_val[0] = t;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_val[0] = fsp->sy_value;
fsp->sy_pri[0] = fsp->sy_prime;
}
if (gdval)
printq(); /* output */
if (tstep * (t+tstep-tstop) > 0)
tstep = tstop - t;
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_k[0] = tstep * fsp->sy_prime;
fsp->sy_value = fsp->sy_val[0]
+ C20 * fsp->sy_k[0];
}
symtab->sy_value = t + C2t * tstep;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_k[1] = tstep * fsp->sy_prime;
fsp->sy_value = fsp->sy_val[0]
+ (C30 * fsp->sy_k[0]
+ C31 * fsp->sy_k[1]);
}
symtab->sy_value = t + C3t * tstep;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_k[2] = tstep * fsp->sy_prime;
fsp->sy_value = fsp->sy_val[0]
+ (C40 * fsp->sy_k[0]
+ C41 * fsp->sy_k[1]
+ C42 * fsp->sy_k[2]);
}
symtab->sy_value = t + C4t * tstep;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_k[3] = tstep * fsp->sy_prime;
fsp->sy_value = fsp->sy_val[0]
+ (C50 * fsp->sy_k[0]
+ C51 * fsp->sy_k[1]
+ C52 * fsp->sy_k[2]
+ C53 * fsp->sy_k[3]);
}
symtab->sy_value = t + tstep;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_k[4] = tstep * fsp->sy_prime;
fsp->sy_value = fsp->sy_val[0]
+ (C60 * fsp->sy_k[0]
+ C61 * fsp->sy_k[1]
+ C62 * fsp->sy_k[2]
+ C63 * fsp->sy_k[3]
+ C64 * fsp->sy_k[4]);
}
symtab->sy_value = t + C6t * tstep;
field();
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
fsp->sy_k[5] = tstep * fsp->sy_prime;
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
{
fsp->sy_predi = fsp->sy_val[0]
+ (A0 * fsp->sy_k[0]
+ A2 * fsp->sy_k[2]
+ A3 * fsp->sy_k[3]
+ A4 * fsp->sy_k[4]);
fsp->sy_value = fsp->sy_val[0]
+ (B0 * fsp->sy_k[0]
+ B2 * fsp->sy_k[2]
+ B3 * fsp->sy_k[3]
+ B4 * fsp->sy_k[4]
+ B5 * fsp->sy_k[5]);
if (fsp->sy_value != 0.0)
fsp->sy_sserr = fabs(1.0 - fsp->sy_predi / fsp->sy_value);
fsp->sy_aberr = fabs(fsp->sy_value - fsp->sy_predi);
}
if (!conflag && T_LT_TSTOP)
{
maxerr();
if (hierror())
{
tstep *= HALF;
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
fsp->sy_value = fsp->sy_val[0];
gdval = false;
continue;
}
else
if (lowerror() && prevstep != tstep)
{
prevstep = tstep; /* prevent infinite loops */
tstep *= TWO;
for (fsp = dqueue; fsp != NULL; fsp = fsp->sy_link)
fsp->sy_value = fsp->sy_val[0];
gdval = false;
continue;
}
}
gdval = true;
prevstep = 0.0;
++it;
t += tstep; /* the roundoff error is gross */
}
}
|
