|
|
Numerical methods and programming, 2001, Volume 2, Issue 1, Pages 56–64
(Mi vmp767)
|
|
|
|
Construction of polynomial approximations for numerical solution of ordinary differential equations
S. K. Tatevyana, N. A. Sorokina, S. F. Zaletkinb a Institute of Astronomy, Russian Academy of Sciences
b Lomonosov Moscow State University, Research Computing Center
Abstract:
The Cauchy problem for systems of first and second order ordinary
differential equations is solved on the basis of local polynomial
approximations. The method is based on the approximation of the right-hand
sides of differential equations in a segment (whose length is equal to the
integration step) by an algebraic interpolation polynomial followed by its
integration. This interpolation polynomial is constructed without the use of
divided differences as follows: an equation for unknowns that define the
polynomial is introduced and, then, an iteration process for solving this
equation is applied; the convergence of this process is proved. A peculiarity
of our approach consists in the fact that the divided differences of the
right-hand sides of differential equations are not calculated; this allows us
to decrease computational errors of the sought-for solution and its
derivative.
Keywords:
approximate methods, Cauchy problem, ordinary differential equations, polynomial expansions, asymptotic methods, implicit one-step method.
Citation:
S. K. Tatevyan, N. A. Sorokin, S. F. Zaletkin, “Construction of polynomial approximations for numerical solution of ordinary differential equations”, Num. Meth. Prog., 2:1 (2001), 56–64
Linking options:
https://www.mathnet.ru/eng/vmp767 https://www.mathnet.ru/eng/vmp/v2/i1/p56
|
|