Search

This paper explores the numerical intergator of ODE based on combination of Appelroth's quadratization of dynamical systems with polynomial right-hand sides and Kahan's discretization method. Utilizing Appelroth's technique, we reduce any system of ordinary differential equations with a polynomial right-hand side to a quadratic form, enabling the application of Kahan's method. In this way, we get a difference scheme defining the one-to-one correspondence between the initial and final positions of the system (Cremona map). It provides important information about the Kahan method for differential equations with a quadratic right-hand side, because we obtain dynamical systems with a quadratic right-hand side that have movable branch points. We analyze algebraic properties of solutions obtained through this approach, showing that (1) the Kahan scheme describes the branch points as poles, significantly deviating from the behavior of the exact solution of the problem near these points, and (2) it disrupts algebraic invariant variety, in particular integral relations describing the relationship between old and Appelroth's variables. This study advances numerical methods, emphasizing the possibility of designing difference schemes whose algebraic properties differ significantly from those of the initial dynamical system. [ABSTRACT FROM AUTHOR]

We consider the problem of determining the weights of difference schemes whose form is specified by a particular symbolic expression. The order of approximation of the differential equation is equal to a given number. To solve it, it was propose to proceed from considering systems of differential equations of a general form to one scalar equation. This method provides us with some values for the weights, which we propose to test using Richardson's method. The method was shown to work in the case of low-order schemes. However, when transitioning from the scalar problem to the vector and nonlinear problems, the reduction of the order of the scheme, whose weights are selected for the scalar problem, occurs in different families of schemes. This was first discovered when studying the Shanks scheme, which belongs to the family of explicit Runge–Kutta schemes. This does not deteriorate the proposed strategy itself concerning the simplification of the weight-determination problem, which should include a clause on mandatory testing of the order using the Richardson method. [ABSTRACT FROM AUTHOR]

Difference schemes that approximate dynamic systems are considered discrete models of the same phenomena that are described by continuous dynamic systems. Difference schemes with t-symmetry and midpoint and trapezoid schemes are considered. It is shown that these schemes are dual to each other, and, from this fact, we derive theorems on the inheritance of quadratic integrals by these schemes (Cooper's theorem and its dual theorem on the trapezoidal scheme). Using examples of nonlinear oscillators, it is shown that these schemes poses challenges for theoretical research and practical application due to the problem of extra roots: these schemes do not allow one to unambiguously determine the final values from the initial values and vice versa. Therefore, we consider difference schemes in which the transitions from layer to layer in time are carried out using birational transformations (Cremona transformations). Such schemes are called reversible. It is shown that reversible schemes with t-symmetry can be easily constructed for any dynamical system with a quadratic right-hand side. As an example of such a dynamic system, a top fixed at its center of gravity is considered in detail. In this case, the discrete theory repeats the continuous theory completely: (1) the points of the approximate solution lie on some elliptic curve, which at Δ t → 0 turns into an integral curve; (2) the difference scheme can be represented using quadrature; and (3) the approximate solution can be represented using an elliptic function of a discrete argument. The last section considers the general case. The integral curves are replaced with closures of the orbits of the corresponding Cremona transformation as sets in the projective space over R. The problem of the dimension of this set is discussed. [ABSTRACT FROM AUTHOR]

A new approach to the construction of difference schemes of any order for the many-body problem that preserves all its algebraic integrals is proposed herein. We introduced additional variables, namely distances and reciprocal distances between bodies, and wrote down a system of differential equations with respect to the coordinates, velocities, and the additional variables. In this case, the system lost its Hamiltonian form, but all the classical integrals of motion of the many-body problem under consideration, as well as new integrals describing the relationship between the coordinates of the bodies and the additional variables are described by linear or quadratic polynomials in these new variables. Therefore, any symplectic Runge–Kutta scheme preserves these integrals exactly. The evidence for the proposed approach is given. To illustrate the theory, the results of numerical experiments for the three-body problem on a plane are presented with the choice of initial data corresponding to the motion of the bodies along a figure of eight (choreographic test). [ABSTRACT FROM AUTHOR]