Multi-Point Boundary Value Problems
Multi Point Boundary Value Problems for Ordinary Differential Equations and Engineering Applications
Versandkostenfrei!
Versandfertig in 6-10 Tagen
32,99 €
inkl. MwSt.
PAYBACK Punkte
16 °P sammeln!
This book proposes a semi-analytic technique to solve high-order non-linear multipoint boundary value problem for ordinary differential equation with non-local boundary conditions. The algorithm based on the two-point osculatory interpolation, essentially this is a generalization of interpolation using Taylor polynomials. The idea is to approximate a function y by a polynomial P in which values of y and any number of its derivatives at given points are fitted by the corresponding function values and derivatives of P. Illustrative examples are provided to demonstrate the efficiency, accuracy an...
This book proposes a semi-analytic technique to solve high-order non-linear multipoint boundary value problem for ordinary differential equation with non-local boundary conditions. The algorithm based on the two-point osculatory interpolation, essentially this is a generalization of interpolation using Taylor polynomials. The idea is to approximate a function y by a polynomial P in which values of y and any number of its derivatives at given points are fitted by the corresponding function values and derivatives of P. Illustrative examples are provided to demonstrate the efficiency, accuracy and simplicity of the proposed method in solving this type of boundary value problems, where the suggested solution is compared with the exact solution and the solution of iterative method, shooting method, uniform Haar wavelets and homotopy perturbation method (HPM). Also, we introduce some general observations about control of a residual and we proposed a new formula developed to estimate the error help reduce the accounts process and show the results are improved. The other aim of this book is to develop the existing MATLAB BVP ODE solver bvp4c and bvp6c into accurate solver.
Andere Kunden interessierten sich für
