123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384 |
- /*
- * ode_solver.h
- *
- * This file is part of the Izhikevich console application.
- *
- * Copyright (C) 2016, Author: Guido Trensch
- *
- * The Izhikevich console application is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 2 of the License, or
- * (at your option) any later version.
- *
- * It is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this application. If not, see <http://www.gnu.org/licenses/>.
- *
- */
- #include <math.h>
- #include <gsl/gsl_errno.h>
- #include <gsl/gsl_matrix.h>
- #include <gsl/gsl_odeiv.h>
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = 2D ODE SOLVER: STANDARD EULER
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void ode2dSolver_StandardEuler( PFUNCD pODE1dxdt // IN function pointers to the 2d coupled ODE system
- , PFUNCD pODE2dydt // IN
- , float h // IN step width
- , float x_t // IN x(t)
- , float y_t // IN y(t)
- , float* x_tplus1 // OUT x(t+1)
- , float* y_tplus1 // OUT y(t+1)
- , void* optParm = NULL ) // IN / OUT Optional parameters
- {
- // NOTE: There is a problem with the function pointer return values.
- // It surprisingly works if all data types are double instead of float !!!
- // To circumvent the problem the functions are called directly.
- // *x_tplus1 = x_t + h * pODE1dxdt( x_t, y_t, optParm );
- *x_tplus1 = x_t + h * dvdt( x_t, y_t, optParm );
- // *y_tplus1 = y_t + h * pODE2dydt( x_t, y_t, optParm );
- *y_tplus1 = y_t + h * dudt( x_t, y_t );
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = 2D ODE SOLVER: SYMPLECTIC EULER
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void ode2dSolver_SymplecticEuler( PFUNCD pODE1dxdt // IN function pointers to the 2d coupled ODE system
- , PFUNCD pODE2dydt // IN
- , float h // IN step width
- , float x_t // IN x(t)
- , float y_t // IN y(t)
- , float* x_tplus1 // OUT x(t+1)
- , float* y_tplus1 // OUT y(t+1)
- , void* optParm = NULL ) // IN / OUT Optional parameters
- {
- // NOTE: There is a problem with the function pointer return values.
- // It surprisingly works if all data types are double instead of float !!!
- // To circumvent the problem the functions are called directly.
- // *x_tplus1 = x_t + h * pODE1dxdt( x_t, y_t, optParm );
- *x_tplus1 = x_t + h * dvdt( x_t, y_t, optParm );
- // *y_tplus1 = y_t + h * pODE2dydt( *x_tplus1, *y_tplus1, optParm ); // symplectic
- *y_tplus1 = y_t + h * dudt( *x_tplus1, *y_tplus1 ); // symplectic
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = EXPLIZIT SOLVER FOR THE IZHIKEVICH ODEs
- // = SpiNNaker implementation
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void explizitSpiNNaker( float h
- , float* v
- , float* u
- , float i )
- {
- float lastV1 = *v;
- float lastU1 = *u;
- float a = IZHIKEVICH_A;
- float b = IZHIKEVICH_B;
- float input_this_timestep = i;
- float pre_alph = (140.0) + input_this_timestep - lastU1;
- float alpha = pre_alph + ( (5.0) + (0.0400) * lastV1) * lastV1;
- float eta = lastV1 + 0.5*(h * alpha);
- float beta = 0.5*(h * (b * lastV1 - lastU1) * a);
- *v += h * (pre_alph - beta + ( (5.0) + (0.0400) * eta) * eta);
- *u += a * h * (-lastU1 - beta + b * eta);
- threshold( v, u );
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = EXPLIZIT SOLVER FOR THE IZHIKEVICH ODEs
- // = explizit euler ( NEST implementation 1 )
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void explizitNEST1( float h
- , float* v
- , float* u
- , float i )
- {
- float v_old = *v;
- float u_old = *u;
-
- float a = IZHIKEVICH_A;
- float b = IZHIKEVICH_B;
- *v += h * ( 0.04 * v_old * v_old + 5.0 * v_old + 140.0 - u_old + i );
- *u += h * a * ( b * v_old - u_old );
- threshold( v, u );
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = EXPLIZIT SOLVER FOR THE IZHIKEVICH ODEs
- // = Izhikevich numerics from 2003 paper ( NEST implementation 2 )
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void explizitNEST2( float h
- , float* v
- , float* u
- , float i )
- {
- float v_old = *v;
- float u_old = *u;
-
- float a = IZHIKEVICH_A;
- float b = IZHIKEVICH_B;
- *v += h * 0.5 * ( 0.04 * v_old * v_old + 5.0 * v_old + 140.0 - u_old + i ); // for numetrical stablility
- *v += h * 0.5 * ( 0.04 * v_old * v_old + 5.0 * v_old + 140.0 - u_old + i ); // see Izhikevich 2003
- *u += h * a * ( b * v_old - u_old );
- threshold( v, u );
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = GNU Scientific Library
- // = Based on the code generated by NESTML
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- int gslODESolver_EquationDynamics( double t, const double y[], double f[], void* params );
- const int V_m_INDEX = 0;
- const int U_m_INDEX = 1;
- float param_I_e = 0;
- static int countGSL = 0;
- // gsl_odeiv.h
- // typedef struct {
- // int (* function) (float t, const float y[], float dydt[], void * params);
- // int (* jacobian) (float t, const float y[], float * dfdy, float dfdt[], void * params);
- // size_t dimension;
- // void * params;
- // }
- // gsl_odeiv_system;
- gsl_odeiv_system systemOfODEs = { 0 };
- gsl_odeiv_step* pSteppingFunction = NULL;
- gsl_odeiv_control* pControlObject = NULL;
- gsl_odeiv_evolve* pEvolutionFunction = NULL;
- void gslODESolver_Integrate( float h
- , float* v
- , float* u
- , float i )
- {
- int gslRc = GSL_SUCCESS;
- double t = 0;
- double t1 = h;
- double stateVector[2];
- double stepSize = h; // stepSize will be adjusted by the evolve-function
- param_I_e = i;
- stateVector[V_m_INDEX] = *v;
- stateVector[U_m_INDEX] = *u;
-
- while( t < t1 ) { // There are 3 loops !!!
- // - The outer loop of the simulation.
- // - This loop for t < stepSize < t1. Where stepSize is adjusted each iteration.
- // - The loop within evolve calling the ODEs "systemOfODEs.function = &gslODESolver_EquationDynamics"
- gslRc = gsl_odeiv_evolve_apply( pEvolutionFunction
- , pControlObject // accuracy
- , pSteppingFunction // the algorithm
- , &systemOfODEs // equation
- , &t
- , t1
- , &stepSize
- , stateVector ); // needs to be updated in the equations, it is reset in between
- // It won't work to pass parameters, like synapse currents, to the equations
- // using the
- if( gslRc != GSL_SUCCESS ) {
- printf( "ERROR: gsl error\n" );
- exit( -1 );
- }
- // Threshold
- if( stateVector[V_m_INDEX] >= IZHIKEVICH_THR ) {
- stateVector[V_m_INDEX] = IZHIKEVICH_C;
- stateVector[U_m_INDEX] += IZHIKEVICH_D;
- }
- }
- *v = stateVector[V_m_INDEX];
- *u = stateVector[U_m_INDEX];
- return;
- }
- void gslODESolver_Init()
- {
- pSteppingFunction = gsl_odeiv_step_alloc( gsl_odeiv_step_rkf45, 2 ); // instance of a stepping function for a two dimensinal system
- pControlObject = gsl_odeiv_control_y_new( 1e-6, 0.0 ); // create a new control object which will keep the local error on each step
- // within an absolute error 1e-6 and relative error of 0.0 with respect to
- // the solution y_i(t)
- pEvolutionFunction = gsl_odeiv_evolve_alloc ( 2 ); // instance of an evolution function for a two dimensinal system
-
- systemOfODEs.function = &gslODESolver_EquationDynamics;
- systemOfODEs.jacobian = NULL;
- systemOfODEs.dimension = 2;
- systemOfODEs.params = ¶m_I_e;
-
- return;
- }
- int gslODESolver_EquationDynamics( double t, const double y[], double f[], void* params )
- {
- float I_e = *(float*)params;
- f[ V_m_INDEX ] = 0.04 * y[V_m_INDEX] * y[V_m_INDEX] + 5.0 * y[V_m_INDEX] + 140 - y[U_m_INDEX] + I_e;
- f[ U_m_INDEX ] = IZHIKEVICH_A * ( IZHIKEVICH_B * y[V_m_INDEX] - y[U_m_INDEX] );
- countGSL++;
- printf( "countGSL: %d\n", countGSL );
- return GSL_SUCCESS;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = Heun
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void ode2dSolver_Heun( PFUNCD pODE1dxdt // IN function pointers to the 2d coupled ODE system
- , PFUNCD pODE2dydt // IN
- , float h // IN step width
- , float x_t // IN x(t)
- , float y_t // IN y(t)
- , float* x_tplus1 // OUT x(t+1)
- , float* y_tplus1 // OUT y(t+1)
- , void* optParm = NULL ) // IN / OUT Optional parameters
- {
- // NOTE: There is a problem with the function pointer return values.
- // It surprisingly works if all data types are double instead of float !!!
- // To circumvent the problem the functions are called directly.
- // float x_Euler = x_t + h * pODE1dxdt( x_t, y_t, optParm );
- float x_Euler = x_t + h * dvdt( x_t, y_t, optParm );
- // float y_Euler = y_t + h * pODE2dydt( x_t, y_t, optParm );
- float y_Euler = y_t + h * dudt( x_t, y_t );
- // *x_tplus1 = x_t + h * pODE1dxdt( 0.5 * (x_t + x_Euler), 0.5 * (y_t + y_Euler), optParm );
- *x_tplus1 = x_t + h * dvdt( 0.5 * (x_t + x_Euler), 0.5 * (y_t + y_Euler), optParm );
- // *y_tplus1 = y_t + h * pODE2dydt( 0.5 * (x_t + x_Euler), 0.5 * (y_t + y_Euler), optParm );
- *y_tplus1 = y_t + h * dudt( 0.5 * (x_t + x_Euler), 0.5 * (y_t + y_Euler) );
- return;
- }
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- // = Standard Euler with adaptive stepsize
- // = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
- void ode2dSolver_AdaptiveEuler( PFUNCD pODE1dxdt // IN function pointers to the 2d coupled ODE system
- , PFUNCD pODE2dydt // IN
- , float h // IN step width
- , float x_t // IN x(t)
- , float y_t // IN y(t)
- , float* x_tplus1 // OUT x(t+1)
- , float* y_tplus1 // OUT y(t+1)
- , void* optParm = NULL ) // IN / OUT Optional parameters
- {
- float t = 0;
- float stepSize = h; // initial stepsize, will be adjusted in every step
- float x_interm = x_t;
- float y_interm = y_t;
- // determine integration step size
- float error_accepted = 0.2;
- float error_calculated = 0;
- int k = 1;
- float x_hi;
- static float simulationTime_ms = 0;
- int count1 = 0;
- int count2 = 0;
- static int count3 = 0;
- static int count4 = 0;
- float tempError[32] = { 0.0 };
- int index = 0;
- int i = 0;
- int fSpike = FALSE;
-
- if( count4 == 0 ) {
- printf( "[INITIAL VALUES] h: %11.6f x_t: %11.6f y_t: %11.6f \n", h, x_t, y_t );
- }
-
- do {
- stepSize = h/k;
-
- x_hi = x_t + stepSize * dvdt( x_t, y_t, optParm );
- error_calculated = fabs(fabs(x_hi) - fabs(x_t));
- if( index == 31 ) {
- tempError[ index ] = 99.99;
- }
- else {
- tempError[ index ] = error_calculated;
- index++;
- }
- k *= 2;
- count1++;
- } while(!(( error_calculated < error_accepted ) || ( stepSize <= 0.001 )));
- // if( stepSize < 0.001 ) stepSize = 0.001;
- while( t < h ) {
- x_interm = x_interm + stepSize * dvdt( x_interm, y_interm, optParm );
- y_interm = y_interm + stepSize * dudt( x_interm, y_interm );
- fSpike = threshold( &x_interm, &y_interm );
- t += stepSize;
- count2++;
- count3++;
- if( fSpike ) {
- printf( "[%8.3f] > > > S P I K E < < < + %11.6f ms \n", simulationTime_ms, t );
- // break;
- }
- // t = roundf( t * 1000 ) / 1000;
- };
- #if( 0 )
- printf( "[%8.3f] V: %11.6f U: %11.6f stepSize: %11.6f CNT(find stepSize): %6d CNT(calc): %6d CNT(total): %6d "
- , simulationTime_ms, x_interm, y_interm, stepSize, count1, count2, count3 );
- printf( " ERRORs: " );
- for( i = 0; i < index; ++i ) {
- printf( "%11.6f, ", tempError[ i ] );
- }
- printf( "\n" );
- #endif
- *x_tplus1 = x_interm;
- *y_tplus1 = y_interm;
- count4++;
- simulationTime_ms += h;
- return;
- }
|