NAJan 14, 2017
Numerical Solution of Stochastic Neural Fields with DelaysPedro M. Lima, Evelyn Buckwar
We introduce a new numerical algorithm for solving the stochastic neural field equation (NFE) with delays. Using this algorithm we have obtained some numerical results which illustrate the effect of noise in the dynamical behaviour of stationary solutions of the NFE, in the presence of spatially heterogeneous external inputs.
NANov 2, 2015
Numerical Simulations in Two-Dimensional Neural FieldsPedro M. Lima, Evelyn Buckwar
In the present paper we are concerned with a numerical algorithm for the approximation of the two-dimensional neural field equation with delay. We consider three numerical examples that have been analysed before by other authors and are directly connected with real world applications. The main purposes are 1) to test the performance of the mentioned algorithm, by comparing the numerical results with those obtained by other authors; 2) to analyse with more detail the properties of the solutions and take conclusions about their physical meaning.
NAAug 29, 2015
Numerical Solution of the Neural Field Equation in the Two-dimensional CasePedro M. Lima, Evelyn Buckwar
We are concerned with the numerical solution of a class integro-differential equations, known as Neural Field Equations, which describe the large-scale dynamics of spatially structured networks of neurons. These equations have many applications in Neuroscience and Robotics. We describe a numerical method for the approximation of solutions in the two-dimensional case, including a space-dependent delay in the integrand function. Compared with known algorithms for this type of equation we propose a scheme with higher accuracy in the time discretisation. Since computational efficiency is a key issue in this type of calculations, we use a new method for reducing the complexity of the algorithm. The convergence issues are discussed in detail and a number of numerical examples is presented, which illustrate the performance of the method.
NAApr 21, 2010
A comparative linear mean-square stability analysis of Maruyama- and Milstein-type methodsEvelyn Buckwar, Thorsten Sickenberger
In this article we compare the mean-square stability properties of the Theta-Maruyama and Theta-Milstein method that are used to solve stochastic differential equations. For the linear stability analysis, we propose an extension of the standard geometric Brownian motion as a test equation and consider a scalar linear test equation with several multiplicative noise terms. This test equation allows to begin investigating the influence of multi-dimensional noise on the stability behaviour of the methods while the analysis is still tractable. Our findings include: (i) the stability condition for the Theta-Milstein method and thus, for some choices of Theta, the conditions on the step-size, are much more restrictive than those for the Theta-Maruyama method; (ii) the precise stability region of the Theta-Milstein method explicitly depends on the noise terms. Further, we investigate the effect of introducing partially implicitness in the diffusion approximation terms of Milstein-type methods, thus obtaining the possibility to control the stability properties of these methods with a further method parameter Sigma. Numerical examples illustrate the results and provide a comparison of the stability behaviour of the different methods.