Many numerical analysts such as: S. O. Fatunla [1] , E. A. Ibijola [2] [3] , R. B. Ogunrinde [4] and even A. A. Obayomi [5] and so on, have developed schemes for the solution of some initial value problem of ordinary differential equations. The efficiency of all these contributed effort from this numerical analyst in numerical analysis had been measured and tested for their stability, accuracy, convergence and consistency properties. The accuracy properties of different methods are usually compared by considering the order of convergence as well as the truncation error coefficients of the various methods (C. F. Tischer, 1984). From literatures, this shows that so many methods which are suitable for solving some sets of initial value problems (ivps) in ordinary differential equations (ODEs) must have all the mentioned characteristics.

Ogunrinde, R. B. [4] , developed a scheme in which standard finite difference schemes were developed. Similarly, Obayomi, A. A. [5] [6] , also worked on some approximation techniques which was used to derive qualitatively stable non-standard finite difference schemes.

In this paper, a new numerical scheme was developed with the above mentioned characteristics in mind to solve some initial value problems of ordinary differential equations which was based on the local representation of the theoretical solution to initial value problem of the form:

in the interval by interpolating function , where, , and b are real undetermined coefficients.

Suppose we have the initial value problem:

Let us assume that the theoretical solution to (1) can be locally represented in the interval, by the interpolating polynomial function:

where, , , and b are real undetermined coefficients.

We shall assume that is a numerical estimate to the theoretical solution and. We define mesh points as follows:

Therefore, from (2), we proceed to the scheme derivation as follows:

from (2),

from (3),

from (4),

from (5),

putting (8) into (9), we have:

multiply through by, we have:

putting (11) into (10), we obtain:

putting (12) into (11), we obtained:

putting (12) and (13) into (8), we have:

Now,

Let

Therefore,

Now, imposing the following constraints on the interpolating function (2) in the following order:

1) The interpolating function (2) must coincide with the theoretical solution at and such that:

2) The derivative of and coincide with and respectively. i.e.

from conditions (1) and (2) above, it follows that:

if, then, we have:

Collecting like-terms

So,

Now, suppose:

Also,

from (15), we have:

Similarly,

by factorization, we have:

Putting (16) through (20) into (15), we have the new scheme follows:

Equation (21) is the proposed scheme.

We aim to develop a new numerical scheme which can favourably agree with the existing ones for solving some initial value problems of ordinary differential equations. Clearly, this paper has been able to show the development of the new numerical scheme as proposed.

In our subsequent research, we shall pay more attention on the implementation of this new scheme to solve some initial value problems (ivp) of the form (1) and also compare the results with the existing methods and thereafter we examine the characteristics properties such as the stability, convergence, accuracy and consistency of the scheme.

Yu-Wen Chen,Der-Shing Lee,R. B. Ogunrinde,T. E. Olaosebikan, (2016) Development of a Numerical Scheme. American Journal of Computational Mathematics,06,49-54. doi: 10.4236/ajcm.2016.61006