We put forward a discretization scheme for the numerical solution of neutral differential equations (NDEs). The solution to the NDE in an interval I = [a, b] is approximated by a multiquadric (MQ) interpolant, whose coefficients are found by collocation on a set of N nodes in I. This approach, also known as Kansa’s method, enjoys an exponential rate of convergence and great flexibility regarding the location of the nodes, as long as the solution to the differential equation is smooth. However, the critical difficulty posed by NDEs is precisely that they propagate, forward in time and without damping, low-order discontinuities of the history function. Here, we exploit the sensitivity of the MQ interpolant to discontinuities in order to detect them in computing time. This allows for a partition of I into smooth subintervals, which are then sequentially solved by Kansa’s method.

CEMAT - Center for Computational and Stochastic Mathematics