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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
#ifdef GSLODE1
////////////////////////////// ODE V1 //////////////////////////////////////////
#include <gsl/gsl_odeiv.h>
typedef struct {int n; int (*f)(double,int, const double*, int, double *); int (*j)(double,int, const double*, int, int, double*);} Tode;
int odefunc (double t, const double y[], double f[], void *params) {
Tode * P = (Tode*) params;
(P->f)(t,P->n,y,P->n,f);
return GSL_SUCCESS;
}
int odejac (double t, const double y[], double *dfdy, double dfdt[], void *params) {
Tode * P = ((Tode*) params);
(P->j)(t,P->n,y,P->n,P->n,dfdy);
int j;
for (j=0; j< P->n; j++)
dfdt[j] = 0.0;
return GSL_SUCCESS;
}
int ode(int method, int control, double h,
double eps_abs, double eps_rel, double a_y, double a_dydt,
int f(double, int, const double*, int, double*),
int jac(double, int, const double*, int, int, double*),
KRVEC(sc), KRVEC(xi), KRVEC(ts), RMAT(sol)) {
const gsl_odeiv_step_type * T;
switch(method) {
case 0 : {T = gsl_odeiv_step_rk2; break; }
case 1 : {T = gsl_odeiv_step_rk4; break; }
case 2 : {T = gsl_odeiv_step_rkf45; break; }
case 3 : {T = gsl_odeiv_step_rkck; break; }
case 4 : {T = gsl_odeiv_step_rk8pd; break; }
case 5 : {T = gsl_odeiv_step_rk2imp; break; }
case 6 : {T = gsl_odeiv_step_rk4imp; break; }
case 7 : {T = gsl_odeiv_step_bsimp; break; }
case 8 : { printf("Sorry: ODE rk1imp not available in this GSL version\n"); exit(0); }
case 9 : { printf("Sorry: ODE msadams not available in this GSL version\n"); exit(0); }
case 10: { printf("Sorry: ODE msbdf not available in this GSL version\n"); exit(0); }
default: ERROR(BAD_CODE);
}
gsl_odeiv_step * s = gsl_odeiv_step_alloc (T, xin);
gsl_odeiv_evolve * e = gsl_odeiv_evolve_alloc (xin);
gsl_odeiv_control * c;
switch(control) {
case 0: { c = gsl_odeiv_control_standard_new
(eps_abs, eps_rel, a_y, a_dydt); break; }
case 1: { c = gsl_odeiv_control_scaled_new
(eps_abs, eps_rel, a_y, a_dydt, scp, scn); break; }
default: ERROR(BAD_CODE);
}
Tode P;
P.f = f;
P.j = jac;
P.n = xin;
gsl_odeiv_system sys = {odefunc, odejac, xin, &P};
double t = tsp[0];
double* y = (double*)calloc(xin,sizeof(double));
int i,j;
for(i=0; i< xin; i++) {
y[i] = xip[i];
solp[i] = xip[i];
}
for (i = 1; i < tsn ; i++)
{
double ti = tsp[i];
while (t < ti)
{
gsl_odeiv_evolve_apply (e, c, s,
&sys,
&t, ti, &h,
y);
// if (h < hmin) h = hmin;
}
for(j=0; j<xin; j++) {
solp[i*xin + j] = y[j];
}
}
free(y);
gsl_odeiv_evolve_free (e);
gsl_odeiv_control_free (c);
gsl_odeiv_step_free (s);
return 0;
}
#else
///////////////////// ODE V2 ///////////////////////////////////////////////////
#include <gsl/gsl_odeiv2.h>
typedef struct {int n; int (*f)(double,int, const double*, int, double *); int (*j)(double,int, const double*, int, int, double*);} Tode;
int odefunc (double t, const double y[], double f[], void *params) {
Tode * P = (Tode*) params;
(P->f)(t,P->n,y,P->n,f);
return GSL_SUCCESS;
}
int odejac (double t, const double y[], double *dfdy, double dfdt[], void *params) {
Tode * P = ((Tode*) params);
(P->j)(t,P->n,y,P->n,P->n,dfdy);
int j;
for (j=0; j< P->n; j++)
dfdt[j] = 0.0;
return GSL_SUCCESS;
}
int ode(int method, int control, double h,
double eps_abs, double eps_rel, double a_y, double a_dydt,
int f(double, int, const double*, int, double*),
int jac(double, int, const double*, int, int, double*),
KRVEC(sc), KRVEC(xi), KRVEC(ts), RMAT(sol)) {
const gsl_odeiv2_step_type * T;
switch(method) {
case 0 : {T = gsl_odeiv2_step_rk2; break; }
case 1 : {T = gsl_odeiv2_step_rk4; break; }
case 2 : {T = gsl_odeiv2_step_rkf45; break; }
case 3 : {T = gsl_odeiv2_step_rkck; break; }
case 4 : {T = gsl_odeiv2_step_rk8pd; break; }
case 5 : {T = gsl_odeiv2_step_rk2imp; break; }
case 6 : {T = gsl_odeiv2_step_rk4imp; break; }
case 7 : {T = gsl_odeiv2_step_bsimp; break; }
case 8 : {T = gsl_odeiv2_step_rk1imp; break; }
case 9 : {T = gsl_odeiv2_step_msadams; break; }
case 10: {T = gsl_odeiv2_step_msbdf; break; }
default: ERROR(BAD_CODE);
}
Tode P;
P.f = f;
P.j = jac;
P.n = xin;
gsl_odeiv2_system sys = {odefunc, odejac, xin, &P};
gsl_odeiv2_driver * d;
switch(control) {
case 0: { d = gsl_odeiv2_driver_alloc_standard_new
(&sys, T, h, eps_abs, eps_rel, a_y, a_dydt); break; }
case 1: { d = gsl_odeiv2_driver_alloc_scaled_new
(&sys, T, h, eps_abs, eps_rel, a_y, a_dydt, scp); break; }
default: ERROR(BAD_CODE);
}
double t = tsp[0];
double* y = (double*)calloc(xin,sizeof(double));
int i,j;
int status=0;
for(i=0; i< xin; i++) {
y[i] = xip[i];
solp[i] = xip[i];
}
for (i = 1; i < tsn ; i++)
{
double ti = tsp[i];
status = gsl_odeiv2_driver_apply (d, &t, ti, y);
if (status != GSL_SUCCESS) {
int k;
printf ("error in ode, return value=%d\n", status);
printf("last successful values are:\n");
printf("t = %.5e\n", t);
for (k=0; k < xin; k++)
{
printf("y[%d] = %.5e\n", k, y[k]);
}
break;
}
for(j=0; j<xin; j++) {
solp[i*xin + j] = y[j];
}
}
free(y);
gsl_odeiv2_driver_free (d);
return status;
}
#endif
|
