Abstract

The general n-th order integro-differential equation (1)[equation] where the vector y(x) represents the vector of y(x) and its n-1 derivatives (2)[equation] has a unique family of solutionsy (x ), with one solution for each initial condition y(xo) = Yo One-step methods for numerically approximating these solutions are defined as satisfying (3)[equation] These methods are shown to converge to y(x) iff φand ψ are consistent with the integro-differential equation (1), and several numerical examples are developed as demonstrations. The rate of convergence for y(x) is O[h2n-min(p, q-1, r-1)]; where p, q, r are the orders of the highest derivatives actually used in f, K(x), and K(s) respectively.

Full Text
Paper version not known

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.