Numerical solutions of systems of first-order, two-point BVPs based on the reproducing kernel algorithm

Abstract

The aim of the present analysis is to implement a relatively recent computational algorithm, reproducing kernel Hilbert space, for obtaining the solutions of systems of first-order, two-point boundary value problems for ordinary differential equations. The reproducing kernel Hilbert space is constructed in which the initial–final conditions of the systems are satisfied. Whilst, three 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 compared with other numerical methods.