|
3
|
1 // DAE.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef __GNUG__ |
|
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
|
28 #include <iostream.h> |
|
|
29 #include "DAE.h" |
|
227
|
30 #include "lo-error.h" |
|
3
|
31 |
|
|
32 extern "C" |
|
|
33 { |
|
|
34 int F77_FCN (ddassl) (int (*)(), const int*, double*, double*, |
|
|
35 double*, double*, const int*, const double*, |
|
|
36 const double*, int*, double*, const int*, |
|
|
37 int*, const int*, const double*, const int*, |
|
|
38 int (*)()); |
|
|
39 } |
|
|
40 |
|
|
41 static DAERHSFunc user_fun; |
|
|
42 static DAEJacFunc user_jac; |
|
|
43 static int nn; |
|
|
44 |
|
|
45 DAE::DAE (void) |
|
|
46 { |
|
|
47 n = 0; |
|
|
48 t = 0.0; |
|
|
49 |
|
|
50 stop_time_set = 0; |
|
|
51 stop_time = 0.0; |
|
|
52 |
|
|
53 restart = 1; |
|
|
54 |
|
|
55 DAEFunc::set_function (NULL); |
|
|
56 DAEFunc::set_jacobian_function (NULL); |
|
|
57 |
|
|
58 liw = 0; |
|
|
59 lrw = 0; |
|
|
60 |
|
|
61 info = new int [15]; |
|
|
62 iwork = (int *) NULL; |
|
|
63 rwork = (double *) NULL; |
|
|
64 |
|
|
65 for (int i = 0; i < 15; i++) |
|
|
66 info [i] = 0; |
|
|
67 } |
|
|
68 |
|
|
69 DAE::DAE (int size) |
|
|
70 { |
|
|
71 n = size; |
|
|
72 t = 0.0; |
|
|
73 |
|
|
74 absolute_tolerance = 1.0e-6; |
|
|
75 relative_tolerance = 1.0e-6; |
|
|
76 |
|
|
77 stop_time_set = 0; |
|
|
78 stop_time = 0.0; |
|
|
79 |
|
|
80 restart = 1; |
|
|
81 |
|
|
82 DAEFunc::set_function (NULL); |
|
|
83 DAEFunc::set_jacobian_function (NULL); |
|
|
84 |
|
|
85 liw = 20 + n; |
|
|
86 lrw = 40 + 9*n + n*n; |
|
|
87 |
|
|
88 info = new int [15]; |
|
|
89 iwork = new int [liw]; |
|
|
90 rwork = new double [lrw]; |
|
|
91 |
|
|
92 for (int i = 0; i < 15; i++) |
|
|
93 info [i] = 0; |
|
|
94 } |
|
|
95 |
|
|
96 DAE::DAE (Vector& state, double time, DAEFunc& f) |
|
|
97 { |
|
|
98 n = state.capacity (); |
|
|
99 t = time; |
|
|
100 x = state; |
|
|
101 xdot.resize (n, 0.0); |
|
|
102 |
|
|
103 absolute_tolerance = 1.0e-6; |
|
|
104 relative_tolerance = 1.0e-6; |
|
|
105 |
|
|
106 stop_time_set = 0; |
|
|
107 stop_time = 0.0; |
|
|
108 |
|
|
109 restart = 1; |
|
|
110 |
|
|
111 DAEFunc::set_function (f.function ()); |
|
|
112 DAEFunc::set_jacobian_function (f.jacobian_function ()); |
|
|
113 |
|
|
114 liw = 20 + n; |
|
|
115 lrw = 40 + 9*n + n*n; |
|
|
116 |
|
|
117 info = new int [15]; |
|
|
118 iwork = new int [liw]; |
|
|
119 rwork = new double [lrw]; |
|
|
120 |
|
|
121 for (int i = 0; i < 15; i++) |
|
|
122 info [i] = 0; |
|
|
123 } |
|
|
124 |
|
|
125 DAE::DAE (Vector& state, Vector& deriv, double time, DAEFunc& f) |
|
|
126 { |
|
|
127 if (deriv.capacity () != state.capacity ()) |
|
|
128 { |
|
227
|
129 (*current_liboctave_error_handler) |
|
|
130 ("x, xdot size mismatch in DAE constructor"); |
|
|
131 n = 0; |
|
|
132 t = 0.0; |
|
|
133 return; |
|
3
|
134 } |
|
|
135 |
|
|
136 n = state.capacity (); |
|
|
137 t = time; |
|
|
138 xdot = deriv; |
|
|
139 x = state; |
|
|
140 |
|
|
141 absolute_tolerance = 1.0e-6; |
|
|
142 relative_tolerance = 1.0e-6; |
|
|
143 |
|
|
144 stop_time_set = 0; |
|
|
145 stop_time = 0.0; |
|
|
146 |
|
|
147 DAEFunc::set_function (f.function ()); |
|
|
148 DAEFunc::set_jacobian_function (f.jacobian_function ()); |
|
|
149 |
|
|
150 liw = 20 + n; |
|
|
151 lrw = 40 + 9*n + n*n; |
|
|
152 |
|
|
153 info = new int [15]; |
|
|
154 iwork = new int [liw]; |
|
|
155 rwork = new double [lrw]; |
|
|
156 |
|
|
157 for (int i = 0; i < 15; i++) |
|
|
158 info [i] = 0; |
|
|
159 } |
|
|
160 |
|
|
161 DAE::~DAE (void) |
|
|
162 { |
|
|
163 delete info; |
|
|
164 delete rwork; |
|
|
165 delete iwork; |
|
|
166 } |
|
|
167 |
|
|
168 Vector |
|
|
169 DAE::deriv (void) |
|
|
170 { |
|
|
171 return xdot; |
|
|
172 } |
|
|
173 |
|
|
174 void |
|
|
175 DAE::initialize (Vector& state, double time) |
|
|
176 { |
|
|
177 restart = 1; |
|
|
178 x = state; |
|
|
179 int nx = x.capacity (); |
|
|
180 xdot.resize (nx, 0.0); |
|
|
181 t = time; |
|
|
182 } |
|
|
183 |
|
|
184 void |
|
|
185 DAE::initialize (Vector& state, Vector& deriv, double time) |
|
|
186 { |
|
|
187 restart = 1; |
|
|
188 xdot = deriv; |
|
|
189 x = state; |
|
|
190 t = time; |
|
|
191 } |
|
|
192 |
|
|
193 int |
|
|
194 ddassl_f (double *time, double *state, double *deriv, double *delta, |
|
|
195 int *ires, double *rpar, int *ipar) |
|
|
196 { |
|
|
197 Vector tmp_deriv (nn); |
|
|
198 Vector tmp_state (nn); |
|
|
199 Vector tmp_delta (nn); |
|
|
200 |
|
|
201 for (int i = 0; i < nn; i++) |
|
|
202 { |
|
|
203 tmp_deriv.elem (i) = deriv [i]; |
|
|
204 tmp_state.elem (i) = state [i]; |
|
|
205 } |
|
|
206 |
|
|
207 tmp_delta = user_fun (tmp_state, tmp_deriv, *time); |
|
|
208 |
|
|
209 for (i = 0; i < nn; i++) |
|
|
210 delta [i] = tmp_delta.elem (i); |
|
|
211 |
|
|
212 return 0; |
|
|
213 } |
|
|
214 |
|
|
215 int |
|
|
216 ddassl_j (double *time, double *state, double *deriv, double *pd, |
|
|
217 double *cj, double *rpar, int *ipar) |
|
|
218 { |
|
|
219 Vector tmp_state (nn); |
|
|
220 Vector tmp_deriv (nn); |
|
|
221 |
|
|
222 // XXX FIXME XXX |
|
|
223 |
|
|
224 Matrix tmp_dfdxdot (nn, nn); |
|
|
225 Matrix tmp_dfdx (nn, nn); |
|
|
226 |
|
|
227 DAEJac tmp_jac; |
|
|
228 tmp_jac.dfdxdot = &tmp_dfdxdot; |
|
|
229 tmp_jac.dfdx = &tmp_dfdx; |
|
|
230 |
|
|
231 tmp_jac = user_jac (tmp_state, tmp_deriv, *time); |
|
|
232 |
|
|
233 // Fix up the matrix of partial derivatives for dassl. |
|
|
234 |
|
|
235 tmp_dfdx = tmp_dfdx + (*cj * tmp_dfdxdot); |
|
|
236 |
|
|
237 for (int j = 0; j < nn; j++) |
|
|
238 for (int i = 0; i < nn; i++) |
|
|
239 pd [nn * j + i] = tmp_dfdx.elem (i, j); |
|
|
240 |
|
|
241 return 0; |
|
|
242 } |
|
|
243 |
|
|
244 Vector |
|
|
245 DAE::integrate (double tout) |
|
|
246 { |
|
|
247 if (DAEFunc::jac == NULL) |
|
|
248 iwork [4] = 0; |
|
|
249 else |
|
|
250 iwork [4] = 1; |
|
|
251 |
|
|
252 double *px = x.fortran_vec (); |
|
|
253 double *pxdot = xdot.fortran_vec (); |
|
|
254 |
|
|
255 nn = n; |
|
|
256 user_fun = DAEFunc::fun; |
|
|
257 user_jac = DAEFunc::jac; |
|
|
258 |
|
|
259 if (stop_time_set) |
|
|
260 { |
|
|
261 info [3] = 1; |
|
|
262 rwork [0] = stop_time; |
|
|
263 } |
|
|
264 else |
|
|
265 info [3] = 0; |
|
|
266 |
|
|
267 double dummy; |
|
|
268 int idummy; |
|
|
269 |
|
|
270 if (restart) |
|
|
271 { |
|
|
272 restart = 0; |
|
|
273 info[0] = 0; |
|
|
274 } |
|
|
275 |
|
|
276 again: |
|
|
277 |
|
|
278 F77_FCN (ddassl) (ddassl_f, &n, &t, px, pxdot, &tout, info, |
|
|
279 &relative_tolerance, &absolute_tolerance, &idid, |
|
|
280 rwork, &lrw, iwork, &liw, &dummy, &idummy, |
|
|
281 ddassl_j); |
|
|
282 |
|
|
283 switch (idid) |
|
|
284 { |
|
|
285 case 1: // A step was successfully taken in the |
|
|
286 // intermediate-output mode. The code has not yet reached |
|
|
287 // TOUT. |
|
|
288 break; |
|
|
289 case 2: // The integration to TSTOP was successfully completed |
|
|
290 // (T=TSTOP) by stepping exactly to TSTOP. |
|
|
291 break; |
|
|
292 case 3: // The integration to TOUT was successfully completed |
|
|
293 // (T=TOUT) by stepping past TOUT. Y(*) is obtained by |
|
|
294 // interpolation. YPRIME(*) is obtained by interpolation. |
|
|
295 break; |
|
|
296 case -1: // A large amount of work has been expended. (About 500 steps). |
|
|
297 break; |
|
|
298 case -2: // The error tolerances are too stringent. |
|
|
299 break; |
|
|
300 case -3: // The local error test cannot be satisfied because you |
|
|
301 // specified a zero component in ATOL and the |
|
|
302 // corresponding computed solution component is zero. |
|
|
303 // Thus, a pure relative error test is impossible for |
|
|
304 // this component. |
|
|
305 break; |
|
|
306 case -6: // DDASSL had repeated error test failures on the last |
|
|
307 // attempted step. |
|
|
308 break; |
|
|
309 case -7: // The corrector could not converge. |
|
|
310 break; |
|
|
311 case -8: // The matrix of partial derivatives is singular. |
|
|
312 break; |
|
|
313 case -9: // The corrector could not converge. There were repeated |
|
|
314 // error test failures in this step. |
|
|
315 break; |
|
|
316 case -10: // The corrector could not converge because IRES was |
|
|
317 // equal to minus one. |
|
|
318 break; |
|
|
319 case -11: // IRES equal to -2 was encountered and control is being |
|
|
320 // returned to the calling program. |
|
|
321 break; |
|
|
322 case -12: // DDASSL failed to compute the initial YPRIME. |
|
|
323 break; |
|
|
324 case -33: // The code has encountered trouble from which it cannot |
|
|
325 // recover. A message is printed explaining the trouble |
|
|
326 // and control is returned to the calling program. For |
|
|
327 // example, this occurs when invalid input is detected. |
|
|
328 break; |
|
|
329 default: |
|
|
330 // Error? |
|
|
331 break; |
|
|
332 } |
|
|
333 |
|
|
334 t = tout; |
|
|
335 |
|
|
336 return x; |
|
|
337 } |
|
|
338 |
|
|
339 Matrix |
|
|
340 DAE::integrate (const Vector& tout, Matrix& xdot_out) |
|
|
341 { |
|
|
342 Matrix retval; |
|
|
343 int n_out = tout.capacity (); |
|
|
344 |
|
|
345 if (n_out > 0 && n > 0) |
|
|
346 { |
|
|
347 retval.resize (n_out, n); |
|
|
348 xdot_out.resize (n_out, n); |
|
|
349 |
|
|
350 for (int i = 0; i < n; i++) |
|
|
351 { |
|
|
352 retval.elem (0, i) = x.elem (i); |
|
|
353 xdot_out.elem (0, i) = xdot.elem (i); |
|
|
354 } |
|
|
355 |
|
|
356 for (int j = 1; j < n_out; j++) |
|
|
357 { |
|
|
358 ColumnVector x_next = integrate (tout.elem (j)); |
|
|
359 for (i = 0; i < n; i++) |
|
|
360 { |
|
|
361 retval.elem (j, i) = x_next.elem (i); |
|
|
362 xdot_out.elem (j, i) = xdot.elem (i); |
|
|
363 } |
|
|
364 } |
|
|
365 } |
|
|
366 |
|
|
367 return retval; |
|
|
368 } |
|
|
369 |
|
|
370 Matrix |
|
|
371 DAE::integrate (const Vector& tout, Matrix& xdot_out, const Vector& tcrit) |
|
|
372 { |
|
|
373 Matrix retval; |
|
|
374 int n_out = tout.capacity (); |
|
|
375 |
|
|
376 if (n_out > 0 && n > 0) |
|
|
377 { |
|
|
378 retval.resize (n_out, n); |
|
|
379 xdot_out.resize (n_out, n); |
|
|
380 |
|
|
381 for (int i = 0; i < n; i++) |
|
|
382 { |
|
|
383 retval.elem (0, i) = x.elem (i); |
|
|
384 xdot_out.elem (0, i) = xdot.elem (i); |
|
|
385 } |
|
|
386 |
|
|
387 int n_crit = tcrit.capacity (); |
|
|
388 |
|
|
389 if (n_crit > 0) |
|
|
390 { |
|
|
391 int i_crit = 0; |
|
|
392 int i_out = 1; |
|
|
393 double next_crit = tcrit.elem (0); |
|
|
394 double next_out; |
|
|
395 while (i_out < n_out) |
|
|
396 { |
|
|
397 int do_restart = 0; |
|
|
398 |
|
|
399 next_out = tout.elem (i_out); |
|
|
400 if (i_crit < n_crit) |
|
|
401 next_crit = tcrit.elem (i_crit); |
|
|
402 |
|
|
403 int save_output; |
|
|
404 double t_out; |
|
|
405 |
|
|
406 if (next_crit == next_out) |
|
|
407 { |
|
|
408 set_stop_time (next_crit); |
|
|
409 t_out = next_out; |
|
|
410 save_output = 1; |
|
|
411 i_out++; |
|
|
412 i_crit++; |
|
|
413 do_restart = 1; |
|
|
414 } |
|
|
415 else if (next_crit < next_out) |
|
|
416 { |
|
|
417 if (i_crit < n_crit) |
|
|
418 { |
|
|
419 set_stop_time (next_crit); |
|
|
420 t_out = next_crit; |
|
|
421 save_output = 0; |
|
|
422 i_crit++; |
|
|
423 do_restart = 1; |
|
|
424 } |
|
|
425 else |
|
|
426 { |
|
|
427 clear_stop_time (); |
|
|
428 t_out = next_out; |
|
|
429 save_output = 1; |
|
|
430 i_out++; |
|
|
431 } |
|
|
432 } |
|
|
433 else |
|
|
434 { |
|
|
435 set_stop_time (next_crit); |
|
|
436 t_out = next_out; |
|
|
437 save_output = 1; |
|
|
438 i_out++; |
|
|
439 } |
|
|
440 |
|
|
441 ColumnVector x_next = integrate (t_out); |
|
|
442 |
|
|
443 if (save_output) |
|
|
444 { |
|
|
445 for (i = 0; i < n; i++) |
|
|
446 { |
|
|
447 retval.elem (i_out-1, i) = x_next.elem (i); |
|
|
448 xdot_out.elem (i_out-1, i) = xdot.elem (i); |
|
|
449 } |
|
|
450 } |
|
|
451 |
|
|
452 if (do_restart) |
|
|
453 force_restart (); |
|
|
454 } |
|
|
455 } |
|
|
456 else |
|
84
|
457 retval = integrate (tout, xdot_out); |
|
3
|
458 } |
|
|
459 |
|
|
460 return retval; |
|
|
461 } |
