On the uniqueness of convex central configurations in the planar 4-body problem (Q6069626)
From MaRDI portal
scientific article; zbMATH DE number 7765037
Language | Label | Description | Also known as |
---|---|---|---|
English | On the uniqueness of convex central configurations in the planar 4-body problem |
scientific article; zbMATH DE number 7765037 |
Statements
On the uniqueness of convex central configurations in the planar 4-body problem (English)
0 references
14 November 2023
0 references
The paper uses numerical methods to establish the uniqueness of convex central configurations in the planar 4-body problem. The authors follow the work of \textit{J. M. Cors} and \textit{G. E. Roberts} [Nonlinearity 25, No. 2, 343--370 (2012; Zbl 1235.70033)], who established that the space of central configurations in the 4-body problem is three-dimensional. Specifically, for a given set of masses \((m_1, 1, m_3, m_4) \in [0.6, 1]^3\) with a particular ordering established, it is shown that there is a unique central configuration. After establishing the equations for the configuration and factoring out symmetry and scaling, the equations to be solved are given. The equations are solved using interval arithmetic and the Krawczyk operator. Both are reviewed and explained with examples in the text. For a given set of masses, a suitable product of intervals is given where a solution may exist. These are divided into smaller sub-intervals. Intervals on which zeros of the target functions do not exist are ruled out. For the remaining candidate intervals, the Krawczyk operator is used as a second tool to eliminate intervals that do not contain a solution. If multiple intervals still possibly contain a solution, a bisection method is used, and this process continues until the subintervals are sufficiently small and only one subinterval contains a solution. This establishes the uniqueness for the given set of mass values. The above process can only be carried out in a finite number of discrete mass choices. The implicit function theorem is used to establish the radius of a ``uniqueness mass ball'' in the space of masses \((m_1, m_3, m_4)\) about these points. For any set of masses within this ball, any central configuration is shown to be unique. After working through this process on an initial set of points, it is determined whether or not the space \([0.6, 1]^3\) has been fully covered or not. If not, new points are generated and the process is repeated until the entire space is covered. Thus the uniqueness is established for all masses in the space. The authors point out that the method can be extended for a wider interval of masses, but the numerical method takes a greater amount of time as this is done. In particular, as the masses get smaller, the radii of the uniqueness mass balls become smaller, so the number of balls increases rapidly. Overall, the paper is interesting, well organized, and very clear. Helpful concrete examples are given throughout, explaining the process. While the authors point out that more non-numerical work should be done to fully solve the problem, this is still a noteworthy result, and will be of interest to those working in central configurations.
0 references
Krawczyk operator
0 references
interval arithmetic
0 references
bisection method
0 references
implicit function theorem
0 references
uniqueness mass ball radius
0 references
0 references
0 references