24 OdeEmbedded (
unsigned long neq,
bool need_jac,
int lowerord);
43 ode_print_exit(
"facmin must be a number less than 1 in set_facmin()");
49 ode_print_exit(
"facmax must be a number greater than 1 in set_facmax()");
65 double error (
double abstol,
double reltol);
67 double facopt (
double err);
73 virtual void adapt (
double abstol,
double reltol);
Base class implementing solver functions with adaptive time steps.
Base clase implementing methods for embedded Runge-Kutta error estimation.
OdeEmbedded(unsigned long neq, bool need_jac, int lowerord)
constructs
void set_facmin(double facmin)
sets minimum allowable fraction change in time step (a number <1)
virtual double dt_adapt()
simply returns dtopt
double * solemb_
embedded solution array
double get_facmin()
gets minimum allowable fraction change in time step (a number <1)
double facmin_
minimum allowable fraction change in time step
double error(double abstol, double reltol)
calculates error estimate with lower and higher order solutions
double get_facsafe()
gets safety factor applied to time step selection
virtual ~OdeEmbedded()
destructs
double facmax_
maximum allowable fraction change in time step
double facopt(double err)
calculates factor for "optimal" next time step
void set_facsafe(double facsafe)
sets safety factor applied to time step selection
double get_facmax()
gets maximum allowable fraction change in time step (a number >1)
virtual bool is_rejected()
simply returns isrej
virtual void adapt(double abstol, double reltol)
does the calculations to determine isrej and dtopt
double facsafe_
safety factor applied to time step selection
void set_facmax(double facmax)
sets maximum allowable fraction change in time step (a number >1)
void ode_print_exit(const char *msg)
print a message and exit with failure