The reproducing kernel algorithm for handling differential algebraic systems of ordinary differential equations

The aim of the present analysis is to implement a relatively recent computational method, reproducing kernel Hilbert space, for obtaining the solutions of differential algebraic systems for ordinary differential equations. The reproducing kernel Hilbert space (circle plus(m)(j=1) W-2(2) [a,b]) circle plus (circle plus(n)(j=m+1) W-2(1) [a,b]) is constructed in which the initial conditions of the systems are satisfied. While, two smooth kernel functions are used throughout the evolution of the algorithm in order to obtain the required grid points. An efficient construction is given to obtain the numerical solutions for the systems together with an existence proof of the exact solutions based upon the reproducing kernel theory. In this approach, computational results of some numerical examples are presented to illustrate the viability, simplicity, and applicability of the algorithm developed. Finally, the utilized results show that the present algorithm and simulated annealing provide a good scheduling methodology to such systems. Copyright (C) 2016 John Wiley & Sons, Ltd.