Abstract

In this paper we propose an efficient and easy-to-implement numerical method for an $α$-th order Ordinary Differential Equation (ODE) when $α∈ (0, 1)$, based on a one-point quadrature rule. The quadrature point in each sub-interval of a given partition with mesh size $h$ is chosen judiciously so that the degree of accuracy of the quadrature rule is 2 in the presence of the singular integral kernel. The resulting time-stepping method can be regarded as the counterpart for fractional ODEs of the well-known mid-point method for 1st-order ODEs. We show that the global error in a numerical solution generated by this method is of the order $\mathcal{O}(h^{2})$, independently of $α$. Numerical results are presented to demonstrate that the computed rates of convergence match the theoretical one very well and that our method is much more accurate than a well-known one-step method when $α$ is small.

Highlights

  • Modelling and optimal control of many practical systems in engineering, science and economics traditionally involve Ordinary Differential Equation (ODE) systems of integer orders [2, 24, 25, 27, 28, 29, 30]

  • We choose a numerical quadrature point in each of the subintervals of a given partition judiciously so that the local approximation error is of a higher order than that from the conventional one-point quadrature rule. This is the counterpart of the mid-point quadrature rule in conventional numerical integration. Based on this special numerical quadrature rule, we develop a one-step numerical integration method for (3) and prove that the global error in the numerical solutions generated by this method is of order O(h2)

  • Our explicit method represented in Algorithm A performs only one Newton iteration for (14) as performing more Newton iterations will not increase the accuracy of the numerical method due to the discretization errors

Read more

Summary

Introduction

Modelling and optimal control of many practical systems in engineering, science and economics traditionally involve Ordinary Differential Equation (ODE) systems of integer orders [2, 24, 25, 27, 28, 29, 30]. In the integer case that α = 1, the mid-point one step method has an upper error bound of order O(h2). Rij. The choice of τij is given in the following theorem.

Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.