An efficient method for the numerical evaluation of partial derivatives of arbitrary order
ACM Transactions on Mathematical Software (TOMS)
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Consistency and stability for some nonnegativity-conserving methods
Applied Numerical Mathematics
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Taylor series method with numerical derivatives for initial value problems
Journal of Computational Methods in Sciences and Engineering - Computational and Mathematical Methods for Science and Engineering Conference 2002 - CMMSE-2002
| Hi-index | 0.00 |
The Taylor series method is one of the earliest analytic-numeric algorithms for approximate solution of initial value problems for ordinary differential equations. The main idea of the rehabilitation of these algorithms is based on the approximate calculation of higher derivatives using well-known technique for the partial differential equations. The approximate solution is given as a piecewise polynomial function defined on the subintervals of the whole interval. This property offers different facility for adaptive error control. This paper describes several explicit Taylor series with implicit extension algorithms and examines its consistency and stability properties. The implicit extension based on a collocation term added to the explicit truncated Taylor series. This idea is different from the general collocation method construction, which led to the implicit R-K algorithms [13] It demonstrates some numerical test results for stiff systems herewith we attempt to prove the efficiency of these new-old algorithms.