Dynamical Systems. Catastrophes and Chaos
655
The Theorem 24.1.6 has been applied for the equations of motion of the discrete
mechanical systems (see Sect. 11.1.1.4), for the equation of notion of the rigid solid
(see Sect. 14.1.1.8), for Lagrange’s equations (see Sect. 18.2.2.4) and for Hamilton’s
canonical equations (see Sect. 19.1.1.4), which are systems of differential equations of
first order. In connection with the last two mentioned systems of equations, various
methods of integration (first integrals, brackets, multipliers etc.) have been studied.
We notice that the limit problem which we wish to solve must be well put in the sense
of Hadamard, in other words: (i) it admits a unique solution; (ii) the solution has a
continuous dependence on the data of the problem (e.g., initial conditions, bilocal
conditions etc.).
In some particular cases, the solutions of the differential equations can be obtained in
an analytical way and can be expressed by means of elementary and special functions
etc. But, frequently, the solutions cannot be obtained in this way and we are led to very
intricate calculations. We are obliged, in this case, to use approximate methods of
calculation, which can be analytical methods, leading to solutions expressed in an
approximate analytical form (e.g., the method of successive approximations, the method
of power series expansions, the linear equivalence method etc.) or numerical methods,
where the solution is obtained in the form of a sequence of numerical values, e. g.,
starting from the initial conditions, in case of a Cauchy type problem, approximating
thus the integral curves.
The numerical methods of calculation can be methods with separated steps (one-step
methods) or methods with linked steps (multi-step methods).
Let be the equation (24.1.37'), with ∈⊂tI . We assume that the interval I is
divided by a net
12
, ,...,
n
tt t, of step
1
, 0,1,2,..., 1
ii
i
ht ti n
+
=− = −, which can be
constant or variable. The solution at the point
i
t is = ()
ii
xxt. In a one-step method,
if one knows
(, )
ii
tx , then one can calculate
++11
(, )
ii
tx ; we mention thus the method
of expansion into a Taylor series, Euler’s method and the Runge–Kutta method.
In a multi-step method, to determine
++11
(, )
ii
tx it is necessary to know
11 11
( , ), ( , ),...,( , )
ii
ii
tx t x tx
−−
; we mention thus the Adams–Moulton method and
Milne’s method.
An interesting semi-analytical method is the method of spline functions.
In both methods of calculation (one-step and multi-step) one can use explicit or
implicit algorithms. In the case of a one-step method, e. g., an explicit algorithm is of
the form
+
=+ = −
1
( , , ), 0,1,2,..., 1
p
iii
i
xxhtxhi nϕ ,
(24.1.48)
while an implicit algorithm is given by
+
+
=+ = −
1
1
( , , ), 0,1,2,..., 1
p
c
iii
i
i
xxhtxxi nψ ,
(24.1.48')
assuming that the step is constant.
A method to improve the results thus obtained is the predictor–corrector method;
thus the upper index
p corresponds to the predictor value, while the upper index c
corresponds to the corrector value.