Abstract: | This article reports further developments of Herrera's algebraic theory approach to the numerical treatment of differential equations. A new solution procedure for ordinary differential equations is presented. Finite difference algorithms of 0(hr), for arbitrary “r” are developed. The method consists in constructing local approximate solutions and using them to extract information about the sought solution. Only nodal information is derived. The local approximate solutions are constructed by collocation, using polynomials of degree G. When “n” collocation points are used at each subinterval, G = n + 1and the order of accuracy is 0(h2n?1). The procedure here presented is very easy to implement. A program in which n can be chosen arbitrarily, was constructed and applied to selected examples. |