On Trigonometric Numerical Integrator for Solving First Order Ordinary Differential Equation

In this paper, we used an interpolation function with strong trigonometric components to derive a numerical integrator that can be used for solving first order initial value problems in ordinary differential equation. This numerical integrator has been tested for desirable qualities like stability, convergence and consistency. The discrete models have been used for a numerical experiment which makes us conclude that the schemes are suitable for the solution of first order ordinary differential equation.


Formulation of the Interpolating Function
Finite difference schemes have been in the forefront of the methods of using discrete models to approximate the solution of ordinary differential equations. Among the techniques used in building finite difference, scheme is the use of interpolation which requires the design of a basis function that is adequately differentiable in the domain of the numerical integration. Such basis function is then used to create a discrete version of the differential equation involved. This method has been used in the works of [1]- [6], etc. Notable among latest works on interpolating with trigonometric function includes [7], who constructed a new piecewise rational quadratic trigonometric spline with four local positive shape parameters in each subinterval is to visualize some given planar data. The order of approximation of the developed interpolating function was found to ( ) 3 0 h . [8] developed a new method for smooth rational cubic trigonometric interpolation based on values of function which is being interpolated. This rational cubic trigonometric spline is used to constrain the shape of the interpolant in such a way that the uniqueness of the interpolating function for the given data would be replaced by uniqueness of the interpolating curve for the given data. [9] constructed a new quadratic trigonometric B-spline with control parameters to address the problems related to two dimensional digital image interpolation. The newly constructed spline is then used to design an image interpolation scheme. Most of these works concentrated on application of trigonometric splines to digital imaging. We are interested in a general use of trigonometric interpolation functions for creating discrete models for the solution of ordinary differential Equation.

Nonstandard Modeling Techniques
The need for the nonstandard method came up due to some shortcomings of the standard method, in which the qualitative properties of the exact solutions are not usually transferred to the numerical solution. These shortcomings may create a lot of problems, which may affect the stability properties of the standard approach [10].
The concept of numerical instability and its proof by [10] [11], has led to the establishment of five major modeling rules proposed for the construction of difference schemes that will exhibit numerical stability. He also used these techniques to derive numerical models that are exact schemes for some classes of ordinary differential equations.
A finite difference scheme is called nonstandard finite difference method, if at least one of the following conditions is met [12]: a) In the discrete derivative, the traditional denominator is replaced by a non-negative function ϕ such that, ( ) Non-linear terms that occur in the differential equation are approximated in a non-local way, i.e. by a suitable function of several points of the mesh. The concept of nonstandard finite difference schemes was proposed by [10] as a solution to the numerical instability that exist in the use of finite difference schemes.
Since the discovery of this method, researchers like [5] [12] among others have suggested ways of building numerically reliable schemes using the nonstandard modeling rules. In this work we will create a scheme using the both of these two techniques above.

Derivation of the Scheme
Let assume that a solution of a differential equation can be represented by a func- Let a first order ordinary differential equation possess a real valued solution and be differentiable in its domain several times, then from (1) we can write: From (3) and (5) From (2) and (4) Also from (3) and (5)    y Or y  (17) and (18)

Definition [13]
Any algorithm for solving a differential equation in which the approximation

Definition [1]
A numerical scheme with an incremental ( )

Theorem [13]
Let the incremental function of the scheme defined in the one step scheme above be continuous and jointly as a function of its arguments in the region defined by

Proof of Convergence of the Integration Method
The increment function ( ) , ; n n x y h ∅ can be written in the form Let y be defined as a point in the interior of the interval whose points are y and * y , applying mean value theorem, we have

Consistence of the Integration Method
Consider an initial value problem of the form It is a known fact that a consistent method has order of at least one. Therefore, the new numerical integrator is consistent since Equations (28) and (29) can be reduced to (30) when 0 h = .

Stability Analysis of the Integration Method
We shall establish the stability analysis of the integrator by considering the theorem established by [14]. Let Applying the mean value theorem as before, we have

Application of the Finite Difference Schemes to a Deferential Equation I
We derive a scheme for the first equation thus

Application of the Finite Difference Schemes to Logistic Model
We now derive a scheme for the first model

The Hybrid Nonstandard Schemes
The new scheme will be obtained by substituting the derivatives and applying it to our scheme { }

Experimentation and Result
The following are the 3D graphs obtained from the schemes when applied to the two models (Figures 1-14). We have used same parameters, step size, denominator functions and simulation parameters ∝ and Q to test the two differential equation models.

Discussion and Conclusion
The derived simulation models have been tested with the control parameters ∝ and Q. We also applied the Nonstandard method by modifying denominator function φ, which also provides for parameters λ and r that can be chosen to obtain iteratively assigned step size as denominator. The discrete model worked for the   Figure 11) and diverge if 1 ϕ = (see Figure 14). These two schemes possess the highest absolute error of deviation from the analytic solution (see Figure 8, Figure 9, Figure 13 and Figure 14). These results confirm the good qualities of Nonstandard modeling techniques [15]. The choice of appropriate values for variables λ and r can be determined using the conditions set by [5] [12]. The graph of Absolute error in Figure 4, Figure 7 and Figure 12 has demonstrated these qualities. The Nonstandard schemes of Model II produced absolute errors that are very close to zero. It is also observed that these two hybrid schemes are exact schemes for the logistic equation when 0.0001 h ≤ because the result of the schemes is the same with the analytic solution (see Figure 12). This work can be extended by add higher degree polynomial to the basis function for a possible improved performance [14] [16]. We can conclude that the discrete model is suitable for the solution of first order ordinary differential equation as proposed.