On the Selection of Weights for Difference Schemes to Approximate Systems of Differential Equations

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. © 2024 by the authors.

Authors
Kadrov V. , Malykh M. , Zorin A.
Journal
Publisher
MDPI AG
Number of issue
14
Language
English
Status
Published
Number
2287
Volume
12
Year
2024
Organizations
  • 1 Department of Computational Mathematics and Artificial Intelligence, RUDN University, Moscow, 117198, Russian Federation
  • 2 Meshcheryakov Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, 141980, Russian Federation
Keywords
computer algebra; dynamical systems; finite difference method
Share

Other records