Abstract

Galerking method, Collocation method and least squired method have been used for solving boundary value problems (BVPs) and from practical point of view almost any success of above mention method depends on the selection of basis functions. Also, Adomain decomposition and variational iteration methods have been applied for the solution of BVPs and required respectively calculating the Adomian’s polynomials and Lagrange multipliers. In this paper a simple method of Degree polynomial approximation solution were n is number of successive derivatives of the governing equation is suggested as an alternative of the above mentioned methods. The method consists of first obtaining from the governing equation its n successive derivatives and boundary conditions a linear differential system of equations evaluated at the boundary points. Next, an approximate solution in the form of polynomial of degree with unknown coefficients is assumed. To determine the unknown coefficients, the assumed solution is incorporate into the linear differential system which turns to be a linear system of equation with unknowns which is salvable uniquely. The method is tested for n=5 to four examples. It clear that from tables 3.1 to 3.4 and figures 3.1 to 3.4 the numerical outcomes agree with the exact solution and also better than some existing results in the literatures. it should be also noted that the accuracy of the method can be increased by increased n. All Numerical computation were performed using maple 2016 software.

Full Text
Published version (Free)

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