AN EFFICIENT CONSERVATIVE INTEGRATOR WITH A CHAIN REGULARIZATION FOR THE FEW-BODY PROBLEM

Published 2015 September 8 © 2015. The American Astronomical Society. All rights reserved.
, , Citation Yukitaka Minesaki 2015 AJ 150 102 DOI 10.1088/0004-6256/150/4/102

1538-3881/150/4/102

ABSTRACT

We design an efficient orbital integration scheme for the general N-body problem that preserves all the conserved quantities except the angular momentum. This scheme is based on the chain concept and is regarded as an extension of a d'Alembert-type scheme for constrained Hamiltonian systems. It also coincides with the discrete-time general three-body problem for particle number N = 3. Although the proposed scheme is only second-order accurate, it can accurately reproduce some periodic orbits, which cannot be done with generic geometric numerical integrators.

Export citation and abstract BibTeX RIS

1. INTRODUCTION

To find periodic orbits in the N-body problem ($N\geqslant 3$), we use a method (e.g., Broucke 1969; Baltagiannis & Papadakis 2011b) consisting of two procedures. (1) We introduce a rotating-pulsating frame where a few primaries are fixed. (2) We use either the Runge–Kutta–Fehlberg method and set the allowable energy variation and errors of the positions or the Steffensen method with recurrent power series to compute the periodic orbits in one period. However, these methods are not suitable for reproducing the orbits in this problem for a long time interval because of two drawbacks. (a) The rotating-pulsating frame in which the methods described in (2) are applied has to be altered in accordance with periodic orbits. (b) The methods in (2) cannot accurately compute periodic orbits for a long time interval because they do not preserve any conserved quantities.

On the other hand, for any initial condition, including the conditions of some periodic orbits, numerical integration methods are applied to the N-body problem in the barycentric inertial frame. Non-geometric integration methods cannot reproduce periodic orbits for a long time interval because of drawback (b). In addition, even if we used each of the geometric integration methods (e.g., the symplectic and energy–momentum methods), they cannot necessarily reproduce periodic orbits. Both the symplectic and energy–momentum methods cannot describe elliptic orbits in the two-body problem (Minesaki & Nakamura 2004) or elliptic Lagrange orbits in the three-body problem (Minesaki 2013a). To overcome drawbacks (a) and (b), the author previously proposed the discrete-time general three-body problem (d-G3BP; Minesaki 2013a) and the discrete-time restricted three-body problem (d-R3BP; Minesaki 2013c) for the general three-body problem (G3BP) and restricted three-body problem (R3BP) in the barycentric inertial frame, respectively. These schemes (Minesaki 2013a, 2013c) are given as an extension of a d'Alembert-type scheme (Betsch 2005). We proved that the d-G3BP preserves all the conserved quantities except the angular momentum and clarified that it numerically conserves the angular momentum with high accuracy. Further, the d-R3BP exactly preserves all the conserved quantities in the elliptic problem, and it also numerically maintains the value of the Jacobi integral in the circular problem. In this paper, we design an accurate orbital integration scheme like the d-G3BP and d-R3BP for the general N-body problem (GNBP). The new scheme is based on a d'Alembert-type scheme (Betsch 2005) and a chain regularization (Mikkola & Aarseth 1993). It preserves all the conserved quantities except the angular momentum and can accurately compute some periodic orbits.

This paper is organized as follows. In Section 2, after labeling the masses according to the chain concept (Mikkola & Aarseth 1993) and using the Kustaanheimo–Stiefel (KS) transformation (Kustaanheimo & Stiefel 1965; Stiefel & Scheifele 1971), we express the GNBP as a constrained Hamiltonian system without Lagrangian multipliers. Further, we rewrite this problem using only the vectors related to the chained ones. In Section 3, we apply the same discrete-time formulation adopted for the G3BP in Minesaki (2013a) to the resulting problem, so we have a discrete-time problem. We prove that the discrete-time problem preserves all the conserved quantities of the GNBP except the angular momentum. In Section 4, we check that the discrete-time problem ensures such preservation of the general few-body problem numerically. Moreover, we show that it correctly calculates some periodic orbits.

2. REGULARIZATION OF THE GENERAL N-BODY PROBLEM

For an arbitrary number of masses N, we give the transformation formulae, equations of motion for the GNBP, and selection of a chain of interparticle vectors such that the close encounters requiring regularization are included in the chain. This formulation includes the same transformation formulae and chain selection as in Mikkola & Aarseth (1993). It has the advantage that its computational cost is far lower than that of Heggie's global formulation (Heggie 1974) for large N.

In Section 2.1, we briefly review the GNBP in the barycentric frame and the method of forming a chain of interparticle vectors and labeling masses using the chain algorithm in Mikkola & Aarseth (1993). In Section 2.2, using the KS transformation (Kustaanheimo & Stiefel 1965; Stiefel & Scheifele 1971), we rewrite the GNBP, which is similar to the problem given by Heggie's global regularization (Heggie 1974). For large N, the rewritten problem involves many redundant variables. In Section 2.3, using some constraints, we express the problem in terms of only the chained position and momentum vectors to reduce the number of redundant variables.

2.1. Labeling Particles Using the Chain Concept

The small distance between two bodies experiencing a close encounter is represented as a difference between large numbers in straightforward formulations of the N-body problem. Thus, rounding easily becomes a significant source of error. To avoid this, we use the chain concept introduced by Mikkola & Aarseth (1993) for regularization algorithms.

In this chain method, a chain of interparticle vectors is constructed so that all the particles are included in this chain. Note that small distances are part of the chain. We begin by searching for the shortest distance, which is taken as the first piece of the chain. Next, we find the particle closest to one or the other end of the presently known part of the chain. Then, we add this particle to the end of the chain that is closer. This process is repeated until all the particles are involved. After every integration step, we check whether any non-chained vector is shorter than the smallest of the chained vectors that are in contact with one or the other end of the vector under consideration, namely, whether any triangle formed by two consecutive chained vectors has the shortest side non-chained. If this is the case, a new chain is formed. Hereafter, suppose the masses are relabeled 1, 2, ⋯, N along the chain.

We assume that ${{\boldsymbol{q}}}_{i}^{\prime }\equiv ({q}_{i[1]}^{\prime },{q}_{i[2]}^{\prime },{q}_{i[3]}^{\prime })$ is the position vector of a point with mass mi in the barycentric frame. We also define ${{\boldsymbol{p}}}_{i}^{\prime }\equiv (p{^{\prime} }_{i[1]},p{^{\prime} }_{i[2]},p{^{\prime} }_{i[3]})$ as a momentum conjugate to ${{\boldsymbol{q}}}_{i}^{\prime }$. We set the gravitational constant equal to one for simplicity. In addition, N position vectors ${\boldsymbol{q}}{^{\prime} }_{1},\cdots ,{\boldsymbol{q}}{^{\prime} }_{N}$ and N momentum vectors ${\boldsymbol{p}}{^{\prime} }_{1},\cdots ,{\boldsymbol{p}}{^{\prime} }_{N}$ satisfy the following constraints:

The equations of motion in the barycentric frame are given by the Hamiltonian:

Equation (1)

The dynamical system corresponding to this Hamiltonian is

Equation (2)

However, for two-body close encounters, we need to simultaneously use two position vectors in the barycentric frame. Therefore, the barycentric frame is not useful for computing close encounters between two masses.

2.2. General N-body Problem with Redundant Variables

The GNBP in the relative frame is much more symmetric than that in the barycentric frame. It also has a significant advantage in investigating such properties as periodic orbits and close encounters (e.g., Broucke 1975; Broucke & Boggs 1975; Mikkola & Tanikawa 1999a). It can be integrated numerically without catastrophic errors after the Levi-Civita or KS transformation (Levi-Civita 1920; Kustaanheimo & Stiefel 1965; Stiefel & Scheifele 1971).

In Section 2.2.1, we rewrite the GNBP in the relative frame. The resulting problem involves many gravitational force terms for a large number of masses N. Thus, we deform this system to reduce the number of force terms. In Section 2.2.2, we rewrite the system using the KS variables (Kustaanheimo & Stiefel 1965; Stiefel & Scheifele 1971).

2.2.1. General N-body Problem in the Relative Frame

We introduce a relative frame to consider two-body close approaches easily. We use the relative position vectors ${{\boldsymbol{q}}}_{{ij}}\equiv ({q}_{{ij}[1]},{q}_{{ij}[2]},{q}_{{ij}[3]})$ defined as

Equation (3)

and the momentum ${{\boldsymbol{p}}}_{{ij}}\equiv ({p}_{{ij}[1]},{p}_{{ij}[2]},{p}_{{ij}[3]})$ conjugate to ${{\boldsymbol{q}}}_{{ij}}$ as

Equation (4)

where m is the total mass, ${\displaystyle \sum }_{i=1}^{N}{m}_{i}$, of the GNBP. These position and momentum vectors also satisfy the following constraints:

Equation (5a)

Equation (5b)

Here,

To obtain the inverse transformations of Equations (3) and (4), we have to solve system (3) for the position vectors ${{\boldsymbol{q}}}_{i}^{\prime }$ and system (4) for the momentum vectors ${{\boldsymbol{p}}}_{i}^{\prime }$. Unfortunately, no vector is uniquely determined. However, if we choose

Equation (6)

these relations follow1 Equations (3) and (4). Accordingly, we adopt Equation (6) as a transformation from the relative frame to the barycentric frame.

Substitution of transformations (3) and (4) and their time differentiations into Equation (2) yields the following system:

Equation (7a)

Equation (7b)

Equation (7c)

where ${\boldsymbol{\mathcal{F}}}_{{ij}}({\boldsymbol{q}})$ is a function of a vector ${\boldsymbol{q}}$ defined by

We can regard the system composed of Equations (5(a)) and (7) as the GNBP in the relative frame.

In combination with Equation (6), the Hamiltonian (1) leads to

However, it does not yield system (7), so it cannot be regarded as a Hamiltonian. System (7) is governed by the following Hamiltonian:

Equation (8)

where ${{\boldsymbol{\lambda }}}_{{jk}}=({\lambda }_{{jk}[1]},{\lambda }_{{jk}[2]},{\lambda }_{{jk}[3]})$ are Lagrange multipliers.2 The values of H and ${H}_{\mathrm{rel}}$ coincide with

Equation (9)

2.2.2. General N-body Problem with KS Variables

In the numerical integration of the GNBP, multi-body close encounters result in serious numerical difficulties due to the errors associated with singularities in the GNBP. KS regularization is a standard technique for removing the singularities. It combines a time regularization with the KS transformation (Kustaanheimo & Stiefel 1965). In this subsection, using the KS variables (Kustaanheimo & Stiefel 1965), we rewrite the GNBP in Equation (7).

We apply the KS transformation (Kustaanheimo & Stiefel 1965) to the vectors ${\bar{{\boldsymbol{q}}}}_{{ij}}\equiv ({{\boldsymbol{q}}}_{{ij}}\ | \ 0)=({q}_{{ij}[1]},{q}_{{ij}[2]},{q}_{{ij}[3]},0)$, obtaining the vectors ${{\boldsymbol{Q}}}_{{ij}}\equiv ({Q}_{{ij}[1]},{Q}_{{ij}[2]},{Q}_{{ij}[3]},{Q}_{{ij}[4]})$. The relations between ${\bar{{\boldsymbol{q}}}}_{{ij}}$ and ${{\boldsymbol{Q}}}_{{ij}}$ are given by

Equation (10)

where the KS matrix (Kustaanheimo & Stiefel 1965) is defined as

New momentum vectors ${{\boldsymbol{P}}}_{{ij}}\equiv ({P}_{{ij}[1]},{P}_{{ij}[2]},{P}_{{ij}[3]},{P}_{{ij}[4]})$ are also related to ${\bar{{\boldsymbol{p}}}}_{{ij}}\equiv ({{\boldsymbol{p}}}_{{ij}}\ | \ 0)=({p}_{{ij}[1]},{p}_{{ij}[2]},{p}_{{ij}[3]},0)$ by the equations

Equation (11)

where

Theoretically, we can use the solution of relations (10) and (11) to obtain ${{\boldsymbol{Q}}}_{{ij}}$ and ${{\boldsymbol{P}}}_{{ij}}$ from ${{\boldsymbol{q}}}_{{ij}}$ and ${{\boldsymbol{p}}}_{{ij}}$, respectively.

In numerical computation, to avoid cancellation of significant digits, we compute ${{\boldsymbol{Q}}}_{{ij}}$ for $1\leqslant i\lt j\leqslant N$ as follows:

Equation (12)

where

The KS momenta ${{\boldsymbol{P}}}_{{ij}}$ are obtained as

Substitution of transformations (10) and (11) and their time differentiations into Equation (7) yields

Equation (13a)

Equation (13b)

Equation (13c)

where

Equation (14a)

Equation (14b)

Equation (14c)

In addition, in combination with Equation (10), the constraints in Equation (5(a)) lead to

Equation (15)

where $\begin{array}{ccccc}{\boldsymbol{Q}}\equiv ({{\boldsymbol{Q}}}_{\mathrm{1,2}}, & \cdots & {{\boldsymbol{Q}}}_{1,N},| {{\boldsymbol{Q}}}_{\mathrm{2,3}}, & \cdots & {{\boldsymbol{Q}}}_{2,N},\end{array}$ $| \cdots | {{\boldsymbol{Q}}}_{N-1,N})$ $\in {{\mathbb{R}}}^{2N(N-1)}$ is a position vector. The system composed of Equations (13) and (15) represents the motion of the GNBP, which is described by the KS variables and the Lagrange multipliers ${\bar{{\boldsymbol{\lambda }}}}_{{jk}}\equiv ({\bar{{\boldsymbol{\lambda }}}}_{{jk}}| 0)=({\lambda }_{{jk}[1]},{\lambda }_{{jk}[2]},{\lambda }_{{jk}[3]},0)\in {{\mathbb{R}}}^{4}$. This system is governed by the following Hamiltonian:

Equation (16)

which is obtained by substituting Equations (10) and (11) into ${H}_{{\rm{r}}{\rm{e}}{\rm{l}}}$ as defined by Equation (8). In addition, using Equation (11), we obtain the relation

Using Equation (13(c)), we rewrite Equation (13(b)) as the following identities:

Equation (17)

The new system composed of Equations (13a), (15), and (17) describes the same motion as the system composed of Equations (13) and (15). The number of dependent variables ${P}_{{ij}[1]}$, ${P}_{{ij}[2]}$, ${P}_{{ij}[3]}$, ${P}_{{ij}[4]}$, ${Q}_{{ij}[1]}$, ${Q}_{{ij}[2]}$, ${Q}_{{ij}[3]}$, and ${Q}_{{ij}[4]}$ in the new system is $4N(N-1)$ larger than $6N$, which is the number of dependent variables $p{^{\prime} }_{i[1]}$, $p{^{\prime} }_{i[2]}$, $p{^{\prime} }_{i[3]}$, ${q}_{i[1]}^{\prime }$, ${q}_{i[2]}^{\prime }$, and ${q}_{i[3]}^{\prime }$ in system (2). Actually, as the total number of masses N increases, the number of equations in the new system increases more rapidly. Therefore, the computational cost of the new system is very high for large N. We call this system the redundant general N-body problem (RGNBP).

${H}_{{\rm{LC}}}$ is conserved by the RGNBP as well as by the system composed of Equations (13) and (15). Because of Equation (15), the value of ${H}_{{\rm{LC}}}$ defined by Equation (16) is equivalent to

Equation (18)

Using Equations (10) and (11), the value of the Hamiltonian ${h}_{\mathrm{rel}}$ in Equation (9) reduces to ${h}_{{\rm{LC}}}$, so ${h}_{{\rm{LC}}}={h}_{\mathrm{rel}}$.

2.3. General N-body Problem with Chain Variables

Further, ${h}_{{\rm{LC}}}$ equals the value of H as defined by Equation (1) because ${h}_{\mathrm{rel}}$ as defined by Equation (9) is transformed to ${h}_{{\rm{LC}}}$ using Equations (10) and (11), and ${h}_{\mathrm{rel}}$ is the value of H as described in Section 2.2.1. In this section, we rewrite the RGNBP using only ${{\boldsymbol{P}}}_{k,k+1}$ and ${{\boldsymbol{Q}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$ to reduce the redundancy of the problem, which incurs a high computational cost. The vectors ${{\boldsymbol{Q}}}_{k,k+1}$ and ${{\boldsymbol{P}}}_{k,k+1}$ are related to the chained position vectors ${{\boldsymbol{q}}}_{k,k+1}$ and their momenta ${{\boldsymbol{p}}}_{k,k+1}$ conjugate to ${{\boldsymbol{q}}}_{k,k+1}$, respectively.

First, we express the vectors ${{\boldsymbol{Q}}}_{{ij}}$ related to the non-chained position vectors ${{\boldsymbol{q}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ as functions of ${{\boldsymbol{Q}}}_{k,k+1}$ related to the chained position vectors ${{\boldsymbol{q}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$. The constraints in Equation (15) restrict the possible positions of the RGNBP to the $2N(N-1)-2(N-1)(N-2)=4(N-1)$-dimensional configuration manifold

Equation (19)

where $\begin{array}{ccccc}{\boldsymbol{\Phi }}({\boldsymbol{Q}})=({{\boldsymbol{\Phi }}}_{\mathrm{1,2,3}}({\boldsymbol{Q}}), & \cdots & {{\boldsymbol{\Phi }}}_{\mathrm{1,2},N}({\boldsymbol{Q}}),| {{\boldsymbol{\Phi }}}_{\mathrm{1,3,4}}({\boldsymbol{Q}}), & \cdots & {{\boldsymbol{\Phi }}}_{\mathrm{1,3},N}({\boldsymbol{Q}}),\end{array}$ $| \cdots | {{\boldsymbol{\Phi }}}_{1,N-1,N}({\boldsymbol{Q}}))\in {{\mathbb{R}}}^{2(N-1)(N-2)}$ is a constraint function vector. Accordingly, the set of $4(N-1)$ variables $\{{Q}_{\mathrm{1,2}[1]},{Q}_{\mathrm{1,2}[2]},{Q}_{\mathrm{1,2}[3]},$ $\begin{array}{cccc}{Q}_{\mathrm{1,2}[4]}, & {Q}_{\mathrm{2,3}[1]},\cdots ,{Q}_{\mathrm{2,3}[4]}, & \cdots & {Q}_{N-1,N[1]},\cdots ,{Q}_{N-1,N[4]}\end{array}\}$, which corresponds to the $(N-1)$ vectors ${{\boldsymbol{Q}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$, acts as a basis for the manifold ${Q}$.

In addition to the constraints in Equation (5(a)), the relative position vectors ${{\boldsymbol{q}}}_{{ij}}$ satisfy

Equation (20)

Substitution of Equation (10) into the right-hand side of Equation (20) yields

Equation (21)

We subsequently substitute Equation (21) into (12). Then, we obtain

Equation (22)

where

Further, we expand Equation (20) to the extended relations, ${\bar{{\boldsymbol{q}}}}_{{ij}}={\displaystyle \sum }_{k=i}^{j-1}{\bar{{\boldsymbol{q}}}}_{k,k+1}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$, and subsequently substitute Equation (22) into these extended relations. Then, we have

Equation (23)

Next, we write the vectors ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ related to the momentum vectors ${{\boldsymbol{p}}}_{{ij}}$ as functions of ${{\boldsymbol{Q}}}_{k,k+1}$ and ${{\boldsymbol{P}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$ related to the momentum vectors ${{\boldsymbol{p}}}_{k,k+1}$. The momenta of the RGNBP, ${{\boldsymbol{P}}}_{{jk}}$, satisfy the following constraints:

Equation (24)

which is obtained by substituting Equation (13(a)) into the time derivative of ${{\boldsymbol{\Phi }}}_{1{jk}}({\boldsymbol{Q}})$ in Equation (15). Here, $\begin{array}{ccccc}{\boldsymbol{P}}=({{\boldsymbol{P}}}_{\mathrm{1,2}}, & \cdots & {{\boldsymbol{P}}}_{1,N},| {{\boldsymbol{P}}}_{\mathrm{2,3}}, & \cdots & {{\boldsymbol{P}}}_{2,N},\end{array}$ $| \cdots | {{\boldsymbol{P}}}_{N-1,N})\in {{\mathbb{R}}}^{2N(N-1)}$ is a momentum vector. The constraints in Equation (24) restrict the possible momenta of the RGNBP to the $2N(N-1)-2(N-1)(N-2)=4(N-1)$-dimensional manifold

where

is a constraint function vector. Thus, the $(N-1)$ vectors ${{\boldsymbol{P}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$ are a basis for the manifold ${\mathcal{P}}$. Each vector ${{\boldsymbol{P}}}_{{ij}}\in {{\mathbb{R}}}^{2(N-1)(N-2)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ related to a non-chained momentum vector ${{\boldsymbol{p}}}_{{ij}}$ can be uniquely expressed as follows:

Equation (25)

We solve Equation (25) for ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ and subsequently substitute Equation (22) into the resulting solution. Then, we obtain

Equation (26)

where

Using Equations (22) and (26), we can rewrite Equation (17) as

Equation (27)

where

and ${{\boldsymbol{G}}}_{j-1,j}$, ${{\boldsymbol{G}}}_{j,j+1}$, and ${{\boldsymbol{G}}}_{N-1,N}$ are defined by Equation (14(b)). Note that Equation (27) is described by only $8(N-1)$ variables, ${Q}_{k,k+1[1]}$, ${Q}_{k,k+1[2]}$, ${Q}_{k,k+1[3]}$, ${Q}_{k,k+1[4]}$, ${P}_{k,k+1[1]}$, ${P}_{k,k+1[2]}$, ${P}_{k,k+1[3]}$, and ${P}_{k,k+1[4]}$, related to the chained vectors ${{\boldsymbol{q}}}_{k,k+1}$ and ${{\boldsymbol{p}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$. In addition, the $2(N-1)$ vectors ${{\boldsymbol{Q}}}_{k,k+1}$ and ${{\boldsymbol{P}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$ satisfy Equation (13(a)); namely,

Equation (28)

We call the system composed of Equations (27) and (28) the GNBP with chain variables. We clarify that the GNBP with chain variables describes the same motion as the RGNBP composed of Equations (13(a)), (15), and (17) in the following lemma.

Lemma 1. Suppose

  • i.  
    The $2(N-1)$ vectors ${{\boldsymbol{Q}}}_{k,k+1}$ and ${{\boldsymbol{P}}}_{k,k+1}$ $(1\leqslant k\leqslant N-1)$ are the solutions of the GNBP with chain variables composed of Equations (27) and (28).
  • ii.  
    The $(N-1)(N-2)$ vectors ${{\boldsymbol{Q}}}_{{ij}}$ and ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ are given by Equations (22) and (26).

Then, the $N(N-1)$ vectors ${{\boldsymbol{Q}}}_{{ij}}$ and ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt j\leqslant N)$ satisfy the RGNBP composed of Equations (13(a)), (15), and (17).

Proof. (a) Derivation of Equation (13(a)).

The vectors ${{\boldsymbol{Q}}}_{{ij}}$ and ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ defined by Equations (22) and (26) satisfy Equation (25). In addition, using Equations (28), (25) is rewritten as

Equation (29)

Similarly, the vectors ${{\boldsymbol{Q}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ in Equation (22) satisfy Equation (23), so the time derivative of Equation (23) is also fulfilled. The derivative is written in the following form:

Equation (30)

Because the right-hand side of Equation (29) coincides with that of Equation (30), the left-hand sides of Equations (29) and (30) are equal. Accordingly, Equation (13(a)) in the RGNBP is obtained.

(b) Derivation of Equation (15).

We have already shown that the vectors ${{\boldsymbol{Q}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ in Equation (22) fulfill Equation (23). In addition, substituting Equation (23) into the right-hand side of ${{\boldsymbol{\Phi }}}_{1{jk}}({\boldsymbol{Q}})$ in Equation (15) yields $0$. Accordingly, the vectors ${{\boldsymbol{Q}}}_{{ij}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ in Equation (22) satisfy Equation (15).

(c) Derivation of Equation (17).

Substituting Equations (22) and (26) into Equation (17) yields Equation (27). Namely, Equation (27) is equal to Equation (17) under the conditions in Equations (22) and (26). Thus, the $N(N-1)$ vectors ${{\boldsymbol{Q}}}_{{ij}}$ and ${{\boldsymbol{P}}}_{{ij}}$ $(1\leqslant i\lt j\leqslant N)$ satisfy Equation (17).□

For large N, the number of dependent variables ${P}_{i,i+1[1]}$, ${P}_{i,i+1[2]}$, ${P}_{i,i+1[3]}$, ${P}_{i,i+1[4]}$, ${Q}_{i,i+1[1]}$, ${Q}_{i,i+1[2]}$, ${Q}_{i,i+1[3]}$, and ${Q}_{i,i+1[4]}$ in the GNBP with chain variables, $8(N-1)$, is remarkably smaller than $4N(N-1)$, which is the number of dependent variables in the RGNBP composed of Equations (13(a)), (15), and (17). Therefore, the computational cost of the GNBP with chain variables is much lower than that of the RGNBP.

3. ENERGY–MOMENTUM INTEGRATOR FOR THE GENERAL N-BODY PROBLEM

We use the d'Alembert-type scheme (Betsch 2005) to discretize the three-dimensional GNBP, which produces the three-dimensional G3BP for N = 3.

In Section 3.1, we discretize the RGNBP composed of Equations (13(a)), (15), and (17) using the extension of the d'Alembert-type scheme in Betsch (2005). The resulting discrete-time system precisely preserves all the conserved quantities except for the angular momentum. Because the discrete-time problem including these forms has redundant dependent variables, it suffers from high computational cost for a large number of masses N. In Section 3.2, we remove the redundancy using some constraints, so we give the discretization of the GNBP with chain variables composed of Equations (27) and (28). However, the given discrete-time system has some singularities, so it cannot provide regular results for collisions or close encounters. Finally, in Section 3.3, we eliminate the singularities using a time transformation to regularize this discrete-time system. Although the obtained discrete-time system is not entirely regular, we can deal with any collision between two masses because chained position vectors are used.

3.1. Discrete-time General N-body Problem with Redundant Variables

We apply the d'Alembert-type scheme (Betsch 2005) to the RGNBP composed of Equations ((13a)), (15), and (17). Then, the discrete-time system, which approximately describes the motion of the RGNBP in a typical time interval ${I}^{(n)}=[{t}^{(n)},{t}^{(n+1)}]$ with a corresponding time step ${\rm{\Delta }}{t}^{(n,n+1)}\equiv {t}^{(n+1)}-{t}^{(n)}$, is given as follows:

Equation (31a)

Equation (31b)

Equation (31c)

where ${{\boldsymbol{Q}}}_{{ij}}^{(l)}=({Q}_{{ij}[1]}^{(l)},{Q}_{{ij}[2]}^{(l)},{Q}_{{ij}[3]}^{(l)},{Q}_{{ij}[4]}^{(l)})$ and ${{\boldsymbol{P}}}_{{ij}}^{(l)}=({P}_{{ij}[1]}^{(l)},{P}_{{ij}[2]}^{(l)},{P}_{{ij}[3]}^{(l)},{P}_{{ij}[4]}^{(l)})$ at time ${t}^{(l)}$ $(l=n,n+1)$ for $1\leqslant i\lt j\leqslant N$. We define the midpoint value ${(\bullet )}^{(n+1/2)}\;\equiv [{(\bullet )}^{(n+1)}+{(\bullet )}^{(n)}]/2$ of the function $(\bullet )(t)$, and

Equation (32)

Equation (33)

${{\boldsymbol{Q}}}^{(n)}\in {\mathcal{Q}}$ and ${{\boldsymbol{P}}}^{(n)}\in {{\mathbb{R}}}^{2N(N-1)}$ are assumed to be quantities at time node ${t}^{(n)}$, where ${\mathcal{Q}}$ was already defined by Equation (19). In the following, we call this system described by Equation (31) the discrete-time redundant general N-body problem (d-RGNBP). It can be used to calculate the unknown ${{\boldsymbol{Q}}}^{(n+1)}$ and $\begin{array}{ccccc}{{\boldsymbol{P}}}^{(n+1)}=({{\boldsymbol{P}}}_{1,2}^{(n+1)}, & \cdots & {{\boldsymbol{P}}}_{1,N}^{(n+1)},| {{\boldsymbol{P}}}_{2,3}^{(n+1)}, & \cdots & {{\boldsymbol{P}}}_{2,N}^{(n+1)},\end{array}$ $| \cdots | {{\boldsymbol{P}}}_{N-1,N}^{(n+1)})\in {{\mathbb{R}}}^{2N(N-1)}$. Note that ${{\boldsymbol{Q}}}^{(n+1)}\in {\mathcal{Q}}$ because of Equation ((31c)).

The d-RGNBP precisely preserves all the conserved quantities except the angular momentum, as demonstrated in the following theorem.

Theorem 1. (Conserved quantities of d-RGNBP) The d-RGNBP in Equation (31) preserves the following three conserved quantities exactly:

  • 1.  
    The value of the Hamiltonian ${h}_{\mathrm{rel}}$ defined by Equation (9),
  • 2.  
    The linear momentum ${\boldsymbol{l}}\equiv {\displaystyle \sum }_{i=1}^{N}{{\boldsymbol{p}}}_{i}^{\prime }=0$,
  • 3.  
    The position of the center of mass ${\boldsymbol{c}}\equiv {\displaystyle \sum }_{i=1}^{N}{m}_{i}{{\boldsymbol{q}}}_{i}^{\prime }=0$.

Proof. 

  • 1.  
    Using the multipliers ${\bar{{\boldsymbol{\Lambda }}}}_{{ij}}=({{\rm{\Lambda }}}_{{ij}[1]},{{\rm{\Lambda }}}_{{ij}[2]},{{\rm{\Lambda }}}_{{ij}[3]},0)$ $(2\leqslant i\lt j\leqslant N)$, the d-RGNBP in Equation (31) is rewritten as
    Equation (34a)
    Equation (34b)
    Equation (34c)
    Equation (34d)
    Using Equations (34(c)), (34(b)) is expressed as Equation (31(b)). We set the following functions:
    Because of Equation (15) and
    the value of the right-hand side coincides with ${h}_{{\rm{LC}}}$ in Equation (18), which equals the value of ${H}_{{\rm{LC}}}$ defined by Equation (16). For $2\leqslant j\leqslant N$, the scalar multiplication of Equation (34(a)) for i = 1 and Equation (34(b)) by ${{\boldsymbol{P}}}_{1j}^{(n+1)}-{{\boldsymbol{P}}}_{1j}^{(n)}$ and $-({{\boldsymbol{Q}}}_{1j}^{(n+1)}-{{\boldsymbol{Q}}}_{1j}^{(n)})$, respectively, and the subsequent addition of the two equations yield
    Equation (35)
    Equation (35) represents the conservation of ${H}_{1j}({{\boldsymbol{P}}}_{1j},{{\boldsymbol{Q}}}_{1j})$ because it equals ${H}_{1j}({{\boldsymbol{P}}}_{1j}^{(n+1)},{{\boldsymbol{Q}}}_{1j}^{(n+1)})\;-{H}_{1j}({{\boldsymbol{P}}}_{1j}^{(n)},{{\boldsymbol{Q}}}_{1j}^{(n)})=0$. In addition, for $2\leqslant i\lt j\leqslant N$, scalar multiplication of Equation (34(a)) for $i\geqslant 2$ and Equation (34(c)) by ${{\boldsymbol{P}}}_{{ij}}^{(n+1)}-{{\boldsymbol{P}}}_{{ij}}^{(n)}$ and $-({{\boldsymbol{Q}}}_{{ij}}^{(n+1)}-{{\boldsymbol{Q}}}_{{ij}}^{(n)})$, respectively, and subsequent addition of the two equations yield
    Equation (36)
    Equation (36) describes the conservation of ${H}_{{ij}}({{\boldsymbol{P}}}_{{ij}},{{\boldsymbol{Q}}}_{{ij}})$ because it is equivalent to ${H}_{{ij}}({{\boldsymbol{P}}}_{{ij}}^{(n+1)},{{\boldsymbol{Q}}}_{{ij}}^{(n+1)})\;-{H}_{{ij}}({{\boldsymbol{P}}}_{{ij}}^{(n)},{{\boldsymbol{Q}}}_{{ij}}^{(n)})=0$. Accordingly, the d-RGNBP in Equation (31) preserves the value of ${h}_{{\rm{LC}}}$ defined by Equation (18). Because the value of ${h}_{{\rm{LC}}}$ is that of ${H}_{{\rm{LC}}}$ in Equation (16), and the value of ${h}_{{\rm{LC}}}$ equals ${h}_{\mathrm{rel}}$ in Equation (9), as described in Section 2.2.2, the d-RGNBP in Equation (31) conserves the value of ${H}_{\mathrm{rel}}$ defined by Equation (9).
  • 2.  
    The linear momentum ${{\boldsymbol{l}}}^{(n+1)}$ in the barycentric frame at time node ${t}^{(n+1)}$ is given by
    Equation (37)
    Substituting Equation (6) into Equation (37), we see
    Therefore, the d-RGNBP in Equation (31) preserves the linear momentum ${\boldsymbol{l}}$, which is identically zero.
  • 3.  
    The position of the center of mass ${{\boldsymbol{c}}}^{(n+1)}$ in the barycentric frame at time node ${t}^{(n+1)}$ is expressed by
    Equation (38)
    We substitute Equation (6) into (38). Then, we can check that

As a result, the d-RGNBP in Equation (31) maintains the vector value of the position of the center of motion ${\boldsymbol{c}}$ at zero.□

For large N, the number of variables ${P}_{{ij}[1]}^{(n+1)}$, ${P}_{{ij}[2]}^{(n+1)}$, ${P}_{{ij}[3]}^{(n+1)}$, ${P}_{{ij}[4]}^{(n+1)}$, ${Q}_{{ij}[1]}^{(n+1)}$, ${Q}_{{ij}[2]}^{(n+1)}$, ${Q}_{{ij}[3]}^{(n+1)}$, and ${Q}_{{ij}[4]}^{(n+1)}$ in the d-RGNBP in Equation (31), $4N(N-1)$, is remarkably larger than $6N$, which is the number of dependent variables $p{^{\prime} }_{i[1]}$, $p{^{\prime} }_{i[2]}$, $p{^{\prime} }_{i[3]}$, ${q}_{i[1]}^{\prime }$, ${q}_{i[2]}^{\prime }$, and ${q}_{i[3]}^{\prime }$ in the GNBP in Equation (2). Thus, the computational cost of the d-RGNBP in Equation (31) is very high.

3.2. Discrete-time General N-body Problem with Chain Variables

In this section, to reduce the high computational cost of the d-RGNBP, we rewrite it using only ${{\boldsymbol{Q}}}_{k,k+1}^{(n)}$, ${{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}$, ${{\boldsymbol{P}}}_{k,k+1}^{(n)}$, and ${{\boldsymbol{P}}}_{k,k+1}^{(n+1)}$ $(1\leqslant k\leqslant N-1)$ related to chained vectors. First, we show that the vectors ${{\boldsymbol{Q}}}_{{ij}}^{(l)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N,l=n,n+1)$ can be expressed as functions of ${{\boldsymbol{Q}}}_{k,k+1}^{(l)}$ $(1\leqslant k\leqslant N-1,l=n,n+1)$ related to the chained position vectors ${{\boldsymbol{q}}}_{k,k+1}^{(l)}$ $(1\leqslant k\leqslant N-1,l=n,n+1)$.

Because ${{\boldsymbol{Q}}}^{(l)}\in {\mathcal{Q}}$ $(l=n,n+1)$, where ${\mathcal{Q}}$ is a $4(N-1)$-dimensional manifold defined by Equation (19), we can assume that the $(N-1)$ vectors ${{\boldsymbol{Q}}}_{k,k+1}^{(l)}$ $(1\leqslant k\leqslant N-1,l=n,n+1)$, which correspond to $4(N-1)$ variables, constitute a basis for the manifold ${\mathcal{Q}}$. According to Equation (10), from these base vectors, the chained position vectors are given by

Equation (39)

In this basis, each vector ${{\boldsymbol{Q}}}_{{ij}}^{(l)}\in {\mathcal{Q}}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N,l=n,n+1)$ related to a non-chained position vector ${{\boldsymbol{q}}}_{{ij}}^{(l)}$ satisfies

Equation (40)

In addition, to avoid cancellation of significant digits, the solutions of Equation (40) for ${{\boldsymbol{Q}}}_{{ij}}^{(l)}$ are written as follows:

Equation (41)

where

Equation (42)

and ${{\boldsymbol{q}}}_{k,k+1}^{(l)}=({q}_{k,k+1[1]}^{(l)},{q}_{k,k+1[2]}^{(l)},{q}_{k,k+1[3]}^{(l)})$ in Equation (42) has been already defined by Equation (39).

Next, we write the vectors ${{\boldsymbol{P}}}_{{ij}}^{(n+1/2)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ related to the non-chained momentum vectors ${{\boldsymbol{p}}}_{{ij}}^{(n+1/2)}$ as functions of ${{\boldsymbol{P}}}_{k,k+1}^{(n+1/2)}$, ${{\boldsymbol{Q}}}_{k,k+1}^{(n)}$, and ${{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}$ $(1\leqslant k\leqslant N-1)$. Subtraction of Equation (40) with $l=n+1$ from that with l = n and subsequent division by $2{\rm{\Delta }}{t}^{(n,n+1)}=2({t}^{(n+1)}-{t}^{(n)})$ yield

This leads to

Equation (43)

Using Equations (31(a)) and (41), Equation (43) is rewritten as

Equation (44)

We solve Equation (44) for ${{\boldsymbol{P}}}_{{ij}}^{(n+1/2)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ and subsequently substitute Equation (41) into the resulting solution. Then, we have

Equation (45)

Because of the definition of the midpoint value ${(\bullet )}^{(n+1/2)}$ and Equation (45),

Equation (46)

Using Equations (41) and (45), we can rewrite Equation (31(b)) in the d-RGNBP as

Equation (47)

where

and ${{\boldsymbol{G}}}_{j-1,j}^{(n+1)}$, ${{\boldsymbol{G}}}_{j,j+1}^{(n+1)}$, and ${{\boldsymbol{G}}}_{N-1,N}^{(n+1)}$ have the same form as Equation (33). Note that subsystem (47) is described by only $4(N-1)$ vectors, ${{\boldsymbol{Q}}}_{k,k+1}^{(n)}$, ${{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}$, ${{\boldsymbol{P}}}_{k,k+1}^{(n)}$, and ${{\boldsymbol{P}}}_{k,k+1}^{(n+1)}$. In addition, these vectors satisfy Equation (31(a)); namely,

Equation (48)

We call the discrete-time system composed of Equations (47) and (48) the discrete-time GNBP with chain variables (d-GNBP with chain variables). The d-GNBP with chain variables describes the same motion as the d-RGNBP in Equation (31), as shown by the following lemma.

Lemma 2. Suppose

  • i.  
    The $(N-1)(N-2)$ vectors ${{\boldsymbol{Q}}}_{{ij}}^{(n+1)}$ and ${{\boldsymbol{P}}}_{{ij}}^{(n+1)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ are given by Equations (41) and (46).
  • ii.  
    The $2(N-1)$ vectors ${{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}$ and ${{\boldsymbol{P}}}_{k,k+1}^{(n+1)}$ $(1\leqslant k\;\leqslant N-1)$ are the solutions of the d-GNBP with chain variables composed of Equations (47) and (48).

Then, the $N(N-1)$ vectors ${{\boldsymbol{Q}}}_{{ij}}^{(n+1)}$ and ${{\boldsymbol{P}}}_{{ij}}^{(n+1)}$ $(1\leqslant i\;\lt j\leqslant N)$ satisfy the d-RGNBP in Equation (31).

Proof. (a) Derivation of Equation (31(a)).

The vectors ${{\boldsymbol{P}}}_{{ij}}^{(n+1/2)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ in Equation (45) satisfy Equation (44). Further, in combination with Equation (48), Equation (44) leads to

Equation (49)

Similarly, the vectors ${{\boldsymbol{Q}}}_{{ij}}^{(n+1)}$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$ defined by Equation (41) fulfill Equation (40) with $l=n+1$ and ${{\boldsymbol{Q}}}_{{ij}}^{(n)}$ satisfy Equation (40) with l = n, so Equation (43) is also fulfilled. Because the right-hand side of Equation (49) coincides with that of Equation (43), Equation (31(a)) in the d-RGNBP is given.

(b) Derivation of Equation (31(b)).

Substitution of Equations (41), (45), and (46) into Equation (31(b)) yields Equation (47). Namely, Equation (47), which is part of condition (ii), equals Equation (31(b)) under condition (i). Accordingly, ${{\boldsymbol{Q}}}_{{ij}}^{(n+1)}$ and ${{\boldsymbol{P}}}_{{ij}}^{(n+1)}$ $(1\leqslant i\lt j\leqslant N)$ satisfying conditions (i) and (ii) follow from Equation (31(b)).

(c) Derivation of Equation (31(c)).

We have already stated that Equation (41) is the solution of Equation (40). Substitution of Equation (40) into the left-hand side of Equation (31c) yields $0$. Thus, ${{\boldsymbol{Q}}}_{{ij}}^{(n+1)}$ $(1\leqslant i\lt j\leqslant N)$ satisfy Equation (31(c)) under conditions (i) and (ii).□

Lemma 2 clarifies that the d-GNBP with chain variables reproduces the motion of the d-RGNBP, and Theorem 1 shows that the d-RGNBP preserves all the conserved quantities except the angular momentum. Therefore, the conservation of quantities in the d-GNBP with chain variables is stated in the following theorem.

Theorem 2. (Conserved quantities of d-GNBP with chain variables.) The d-GNBP with chain variables composed of Equations (47) and (48) exactly preserves the following three conserved quantities:

  • 1.  
    the value of the Hamiltonian ${h}_{\mathrm{rel}}$ defined by Equation (9),
  • 2.  
    the linear momentum ${\boldsymbol{l}}\equiv {\displaystyle \sum }_{i=1}^{N}{{\boldsymbol{p}}}_{i}^{\prime }=0$, and
  • 3.  
    the position of the center of mass ${\boldsymbol{c}}\equiv {\displaystyle \sum }_{i=1}^{N}{m}_{i}{{\boldsymbol{q}}}_{i}^{\prime }=0$.

3.3. Chain Regularization of the Discrete-time General N-body Problem

The d-GNBP with chain variables composed of Equations (47) and (48) is still singular at each ${{\boldsymbol{Q}}}_{k,k+1}^{(n)}=0$, ${{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}=0$ $(1\leqslant k\leqslant N-1)$ and ${\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n)}=0$, ${\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n+1)}=0$ $(1\leqslant i\lt i+2\leqslant j\leqslant N)$. Therefore, the discrete-time system cannot yield regular results for collision orbits.

Using the time transformation

we can rewrite the d-GNBP with chain variables composed of Equations (47) and (48) as the following regularized discrete-time system:

Equation (50a)

Equation (50b)

Equation (50c)

where

We call the discrete-time system in Equation (50) the discrete-time chain regularization of the GNBP (d-CRGNBP). It is clear that the d-CRGNBP in Equation (50) maintains exactly the values of the Hamiltonian, linear momentum, and position of the center of mass in Theorem 2 as does the d-GNBP with chain variables composed of Equations (47) and (48).

Because the discrete-time system in Equation (50) is regular for $| {{\boldsymbol{Q}}}_{k,k+1}^{(n)}| \to 0$ or $| {{\boldsymbol{Q}}}_{k,k+1}^{(n+1)}| \to 0,k=1,2,\cdots ,N-1$, the mass ${m}_{k}$ can have collisions or close encounters with either ${m}_{k-1}$ or ${m}_{k+1}$ without causing numerical difficulties in the time interval ${I}^{(n)}=[{t}^{(n)},{t}^{(n+1)}]$. Although the case $| {\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n)}| {\text{}}{or}| {\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n+1)}| (1\leqslant i\lt i+2\leqslant j\leqslant N)$ is still singular, collisions between ${m}_{i}$ and ${m}_{j}$ may be studied using the set of chained position vectors ${{\boldsymbol{Q}}}_{i,i+1}^{(n)},{{\boldsymbol{Q}}}_{i+1,i+2}^{(n)},\cdots ,{{\boldsymbol{Q}}}_{j-1,j}^{(n)}$ or the set of ${{\boldsymbol{Q}}}_{i,i+1}^{(n+1)},{{\boldsymbol{Q}}}_{i+1,i+2}^{(n+1)},\cdots ,{{\boldsymbol{Q}}}_{j-1,j}^{(n+1)}$. For $l=n,n+1,| {\tilde{{\boldsymbol{Q}}}}_{i,j}^{(l)}| \geqslant {\rm{min}}({{\boldsymbol{Q}}}_{i,i+1}^{(l)},{{\boldsymbol{Q}}}_{i+1,i+2}^{(l)},\cdots ,{{\boldsymbol{Q}}}_{j-1,j}^{(l)})$ in the chain concept of Mikkola & Aarseth (1993), so the term

is numerically well behaved even for small values of $| {\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n)}| $ and $| {\tilde{{\boldsymbol{Q}}}}_{i,j}^{(n+1)}| $.

In the next section, we will clarify that the d-CRGNBP can precisely reproduce some periodic orbits and non-periodic orbits that have many close encounters.

4. NUMERICAL RESULTS

In the preceding section, we showed analytically that the d-GNBP with chain variables and the d-CRGNBP preserve all the conserved quantities except the angular momentum. In this section, we compare the results obtained using the following methods.

  • 1.  
    Non-regularized integration methods
    • a.  
      SI8: The eighth-order symplectic method, which is applied to Equation (2).
    • b.  
      d-GNBP: The d-GNBP with chain variables, which is given by Equations (47) and (48) and is accurate to the second order in ${\rm{\Delta }}{t}^{(n,n+1)}$.
  • 2.  
    Regularized integration methods
    • a.  
      Leapfrog for the chain system: The leapfrog method, which is a second-order symplectic integration method and is applied in the relative frame after the masses are relabeled $1,2,\cdots ,N$ along the chain as described in Section 2.1 (Mikkola & Tanikawa 1999b). Although it is not based on KS regularization, it can be used successfully for collision orbits. Thus, Mikkola and Tanikawa considered that a type of regularization is achieved by this method without using KS variables.
    • b.  
      d-CRGNBP: The d-CRGNBP, which is given by Equation (50) and is accurate to the second order in ${\rm{\Delta }}{t}^{(n,n+1)}$ and ${\rm{\Delta }}{s}^{(n,n+1)}$.

In Section 4.1, we explain how the d-GNBP and d-CRGNBP methods conserve the Hamiltonian accurately and the angular momentum approximately for a long time interval. Next, in Section 4.2, we clarify that the d-CRGNBP method can precisely compute some stable periodic orbits for a long time interval. Finally, in Section 4.3, we describe the evaluation of the accuracy of the d-CRGNBP method.

4.1. Conservation

First, let us show that the the d-GNBP and d-CRGNBP methods preserve the value of the Hamiltonian ${h}_{\mathrm{rel}}$ exactly and the angular momentum ${\boldsymbol{J}}=\displaystyle \sum _{i=1}^{4}\;{\boldsymbol{p}}{^{\prime} }_{i}\times {\boldsymbol{q}}{^{\prime} }_{i}$ approximately. Figure 1 shows the dependence of the relative error growth of the values of ${h}_{\mathrm{rel}}$ and ${\boldsymbol{J}}$ for the G4BP on the above integrators. The adopted initial conditions are as follows:

Equation (51)

For the above two non-regularized methods, the SI8 and d-GNBP methods, the real time step size is fixed as ${\rm{\Delta }}{t}^{(n,n+1)}=0.1$. In addition, the fictitious time step size is set to ${\rm{\Delta }}{s}^{(n,n+1)}=0.0045$, which corresponds to the average real time step size $\overline{({\rm{\Delta }}t)}=$ 0.0940412562869442696, for the leapfrog for the chain system method and ${\rm{\Delta }}{s}^{(n,n+1)}=0.0000042$, which corresponds to $\overline{({\rm{\Delta }}t)}=0.101481391749539464$, for the d-CRGNBP method. The initial condition corresponds to the Caledonian symmetric four-body problem (CS4BP), in which the configuration of the four bodies is always a parallelogram (Széll et al. 2004). Each method always sets the linear momentum ${\boldsymbol{l}}$ and the center of mass ${\boldsymbol{c}}$ at the origin in the barycentric frame.

Figure 1.

Figure 1. Relative error of the value of (a) the Hamiltonian ${h}_{\mathrm{rel}}$ and (b) the angular momentum ${\boldsymbol{J}}$ given by the SI8, d-GNBP, leapfrog for the chain system, and d-CRGNBP methods. The parallelogram solution for the Caledonian symmetric four-body problem (Széll et al. 2004) is integrated.

Standard image High-resolution image

The relative error of the value of ${h}_{\mathrm{rel}}$ is bounded by the value ${10}^{-7}$ for the leapfrog for the chain system method, whereas the error is bounded by a sufficiently small value of ${10}^{-14}$ for the SI8, d-GNBP, and d-CRGNBP methods. In particular, the d-GNBP and d-CRGNBP methods conserve ${h}_{\mathrm{rel}}$ with an accuracy of ${10}^{-16}$. In addition, the error of ${\boldsymbol{J}}$ is bounded by 5 $\times {10}^{-5}$ for all the methods. Specifically, the SI8 and leapfrog for the chain system methods precisely preserve the value of ${\boldsymbol{J}}$ with an accuracy of ${10}^{-16}$. Because no integration method preserves both ${h}_{\mathrm{rel}}$ and ${\boldsymbol{J}}$, none would seem to reproduce stable orbits for a long time interval. However, Section 4.2 will clarify that this prediction is incorrect.

4.2. Periodic Orbits

In Section 4.1, we showed that the d-GNBP and d-CRGNBP methods do not accurately preserve the angular momentum. Therefore, it is questionable whether they can reproduce various orbits of the GNBP because the orbits lie on the manifold determined by the conserved quantities. To answer this question, we show that some periodic orbits computed by these methods accurately coincide with those of the G3BP, G4BP, and G5BP.

4.2.1. Periodic Orbits in the G4BP

First, we show that the d-CRGNBP can precisely follow the orbits for a family of stable periodic orbits in the G4BP. Yan & Ouyang (2014) introduced a variational method to provide some stable periodic orbits in the G3BP, G4BP, and G5BP, and then they listed their initial conditions. We rewrite one of the initial conditions for stable periodic orbits in the G4BP, which corresponds to Figure 25 of Yan & Ouyang (2014), as follows:

Equation (52)

We introduce a uniform rotating frame $O-{x}_{[1]}{x}_{[2]}$ in which the origin stays at the center of mass, and the ${x}_{[1]}$ axis passes through the origin and the mass ${m}_{1}$. We integrated over the time interval 0 $\leqslant t\leqslant 10,000$ and used the common fixed real time step ${\rm{\Delta }}{t}^{(n,n+1)}=0.1$ for the SI8 and d-GNBP methods, the fixed fictitious time step ${\rm{\Delta }}{s}^{(n,n+1)}=0.33$, which corresponds to the average time step size $\bar{({\rm{\Delta }}t)}=0.0963516604110964389$, for the leapfrog for the chain system method, and ${\rm{\Delta }}{s}^{(n,n+1)}=0.017$, which corresponds to $\bar{({\rm{\Delta }}t)}=0.101449146855772802$, for the d-CRGNBP method. Each orbit computed by the leapfrog for chain system and d-CRGNBP methods stays near a closed periodic orbit for a long time, whereas the SI8 and d-GNBP methods yield no closed orbit. Figure 2 shows the orbits of all four particles in the $O-{x}_{[1]}{x}_{[2]}$ frame for only the SI8 and d-CRGNBP methods. Note that the leapfrog for the chain system method yields four orbits, each of which is similar to the orbit computed by the d-CRGNBP method, and that the d-GNBP and SI8 methods yield no closed orbit. The result would mean that only regularized integration methods can reproduce these stable periodic orbits for a long time interval.

Figure 2.

Figure 2. Stable periodic orbits (Equation (52)) in the G4BP of ${m}_{1},{m}_{2}$, ${m}_{3}$, and ${m}_{4}$ in the coordinate system $O\;-\;{x}_{[1]}{x}_{[2]}$. The applied integration method is given at the top of each panel.

Standard image High-resolution image

4.2.2. Periodic Orbits in the G5BP

The restricted four-body problem (R4BP), like the R3BP, has some periodic orbits, the orbits of elliptic relative equilibrium solutions (Majorana 1981; Baltagiannis & Papadakis 2011a; Minesaki 2015). In these orbits, each of the three primaries, ${m}_{1},{m}_{2}$, and ${m}_{3}$, is fixed at the apex of an equilateral triangle that rotates while alternately expanding and contracting. Namely, these primaries revolve in the orbits of an elliptic Lagrangian triangle solution. The massless particle ${m}_{4}$ does not influence the primaries ${m}_{1},{m}_{2}$, and ${m}_{3}$. Further, ${m}_{4}$ and these primaries form a tetragon whose shape is invariant. Each orbit of ${m}_{1},{m}_{2},{m}_{3}$, and ${m}_{4}$ is a conic curve in the inertial barycentric frame.

In the $2+3$-body problem, two massless particles, ${m}_{4}$ and ${m}_{5}$, move in the gravitational field of three primaries, ${m}_{1},{m}_{2}$, and ${m}_{3}$, in the periodic orbits of an elliptic Lagrangian triangle solution. In this problem, each of the five particles, ${m}_{1},{m}_{2},{m}_{3},{m}_{4}$, and ${m}_{5}$, is fixed at a pentagon whose shape is invariant. Because one massless particle, ${m}_{4}$ or ${m}_{5}$, does not influence the three primaries ${m}_{1},{m}_{2}$, and ${m}_{3}$ or the other massless particle, each orbit of ${m}_{4}$ and ${m}_{5}$ coincides with one of two different orbits of ${m}_{4}$ in the R4BP.

In this section, we clarify that the d-CRGNBP accurately computes the orbits of some stable periodic solutions in the G5BP that reduce to the above orbits in the $2+3$-body problem as the masses ${m}_{4}$ and ${m}_{5}$ go to zero. The initial conditions are given for one such periodic solution in the G5BP as

Equation (53)

As ${m}_{4}\to $ 0, the values of ${\boldsymbol{p}}{^{\prime} }_{4}$ and ${\boldsymbol{q}}{^{\prime} }_{4}$ reduce to the initial conditions for a stable relative equilibrium orbit corresponding to one equilibrium point ${L}_{5}$ in the R4BP (see the values of ${\boldsymbol{q}}{^{\prime} }_{4}$ and ${\boldsymbol{v}}{^{\prime} }_{4}$ in Equation (45) of Minesaki 2015). In addition, in the limit of ${m}_{5}\to $ 0, the values of ${\boldsymbol{p}}{^{\prime} }_{5}$ and ${\boldsymbol{q}}{^{\prime} }_{5}$ lead to the initial conditions for a stable relative equilibrium orbit corresponding to the other equilibrium point ${L}_{6}$ in the R4BP (see the values of ${\boldsymbol{q}}{^{\prime} }_{4}$ and ${\boldsymbol{v}}{^{\prime} }_{4}$ in Equation (46) of Minesaki 2015).

The common real time steps for the SI8 and d-GNBP methods were fixed at ${\rm{\Delta }}{t}^{(n,n+1)}=0.1$, and we set the fixed fictitious time steps ${\rm{\Delta }}{s}^{(n,n+1)}=0.00019$, which corresponds to the average time step size $\overline{({\rm{\Delta }}t)}=0.102601242925268408$, for the leapfrog for the chain system method and ${\rm{\Delta }}{s}^{(n,n+1)}=0.058$, which corresponds to $\overline{({\rm{\Delta }}t)}=0.103974428092040402$, for the d-CRGNBP. We integrated over the time interval 0 $\leqslant \;t\;\leqslant $ 1000. The d-GNBP or d-CRGNBP method reproduces closed periodic orbits over long time intervals, whereas the SI8 and the leapfrog for the chain system methods do not yield even the three elliptic orbits of the primaries ${m}_{1},{m}_{2}$, and ${m}_{3}$. Figure 3 shows the orbits of all five particles in the barycentric frame for only the SI8 and d-GNBP methods. The result suggests that only energy–momentum methods such as the d-GNBP and d-CRGNBP methods can precisely trace these stable periodic orbits for a long time interval.

Figure 3.

Figure 3. Stable periodic orbits (Equation (53)) in the G5BP of ${m}_{1},{m}_{2}$, ${m}_{3},{m}_{4}$, and ${m}_{5}$ in the barycentric inertial reference frame. The applied integration method is given at the top of each panel.

Standard image High-resolution image

4.2.3. Periodic Orbits in the G3BP

As described in Sections 4.2.1 and 4.2.2, only the d-CRGNBP method can follow both periodic orbits in the G4BP and G5BP. In this section, we now clarify that the d-CRGNBP method can also precisely reproduce some stable periodic orbits in the G3BP. Tsouroplis & Zagouras (1984) numerically provided various orbits of asymmetric periodic solutions for the planar G3BP and confirmed their stability. The adopted initial conditions are the first initial conditions in Table V of Tsouroplis & Zagouras (1984), as follows:

Equation (54)

These conditions correspond to a set of stable periodic orbits.

We apply the SI8, GNBP, leapfrog for the chain system, and d-CRGNBP methods to the G3BP with the initial conditions in Equation (54) and integrate over the time interval 0 $\leqslant \;t\;\leqslant $ 1000. The real time step size is set to ${\rm{\Delta }}{t}^{(n,n+1)}=0.01$ for the SI8 and GNBP methods, and the fictitious time step sizes are fixed as ${\rm{\Delta }}{s}^{(n,n+1)}=0.002821$, which corresponds to the average time step size $\overline{({\rm{\Delta }}t)}=0.008230723645$, for the leapfrog for the chain system method and ${\rm{\Delta }}{s}^{(n,n+1)}=0.04$, which corresponds to $\overline{({\rm{\Delta }}t)}=0.009572767391$, for the d-CRGNBP. Figure 4 shows the orbits of ${m}_{1},{m}_{2}$, and ${m}_{3}$ obtained by the leapfrog for the chain system and d-CRGNBP methods in the coordinate system $O\;-\;{x}_{[1]}{x}_{[2]}$ described in Section 4.2.1.

Figure 4.

Figure 4. Stable periodic orbits (Equation (54)) in the G3BP of ${m}_{1},{m}_{2}$, and ${m}_{3}$ in the coordinate system $O-{x}_{[1]}{x}_{[2]}$. The applied integration method is given at the top of each panel.

Standard image High-resolution image

Theoretically, the mass ${m}_{1}$ moves on the ${x}_{[1]}$ axis, and the masses ${m}_{2}$ and ${m}_{3}$ each revolve in a closed orbit. For the time interval 0 $\leqslant \;t\leqslant 10,000$, the SI8, leapfrog for the chain system, and d-GNBP methods do not yield closed orbits, and only the d-CRGNBP method accurately reproduces them. The results obtained by the SI8 and leapfrog for the chain system methods show that each particle escapes after staying near a closed orbit for a few periods, and those given by the d-GNBP method indicate that all the particles escape without staying near closed orbits. (However, Figure 4 does not include the results for the SI8 and d-GNBP methods.) This means that only the d-CRGNBP can accurately compute the periodic orbits in the G3BP.

We clarify that the d-CRGNBP method computes various stable periodic orbits in the G3BP, G4BP, and G5BP more accurately than the geometric integration methods (the SI8, d-GNBP, and leapfrog for the chain system methods).

4.3. Reversibility Check

To avoid significant rounding errors caused by the singularities in the GNBP, the chain concept of Mikkola & Aarseth (1993) and adequate time transformations are introduced for the leapfrog for the chain system and d-CRGNBP methods. To confirm their efficacy, the leapfrog for the chain system and d-CRGNBP methods are integrated through many close encounters from $t=0$ to about a given real time $t=T$ and then backward to about $t=0$. For each particle ${m}_{i}$, we check whether its computed orbit from $t=0$ to about $t=T$ coincides with its integrated orbit backward to about $t=0$. We call this approach a reversibility check.

We give the initial conditions for a test G5BP:

Equation (55)

and set T = 0.7. Theoretically, these conditions correspond to the Caledonian symmetric five-body problem (CS5BP) in which one body is fixed at the origin, and the other four bodies are always configured in a parallelogram (Shoaib et al. 2013).

We define the functions ${r}_{\mathrm{min}}(t)$ and ${r}_{\mathrm{max}}(t)$ as the minimum and maximum of $| {{\boldsymbol{q}}}_{{ij}}| (1\leqslant i\lt j\leqslant 5)$ at a real time $t$, respectively. In this test, two-body close encounters occur 12 times until $t=T=0.7$, as shown in Figure 5. We consider that close encounters occur when ${r}_{\mathrm{min}}(t)/{r}_{\mathrm{max}}(t)\lt 0.05$.

Figure 5.

Figure 5. Ratio ${r}_{\mathrm{min}}(t)/{r}_{\mathrm{max}}(t)$ given by the leapfrog for the chain system and d-CRGNBP methods. The parallelogram solution for the Caledonian symmetric five-body problem (Shoaib et al. 2013) is integrated. The pair $(i,j)$ expresses the close encounter between the particles ${m}_{i}$ and ${m}_{j}$, where ${r}_{\mathrm{min}}(t)/{r}_{\mathrm{max}}(t)\lt 0.05$.

Standard image High-resolution image

We show the results of this check for the leapfrog for the chain system and d-CRGNBP methods. We used the fictitious time step size ${\rm{\Delta }}{s}^{(n,n+1)}=0.0000099$, which corresponds to the average real time step size ${\rm{\Delta }}{t}^{(n,n+1)}=0.0000335496683762689432$, for the leapfrog for the chain system method and ${\rm{\Delta }}{s}^{(n,n+1)}=0.00001$, which corresponds to ${\rm{\Delta }}{t}^{(n,n+1)}\;=0.0000338629446219376209$, for the d-CRGNBP method. Backward integration of the leapfrog method yields an orbit for each particle that differs from that computed by forward integration. In contrast, backward integration of the d-CRGNBP method traces the same orbit of each particle as forward integration. In Figure 6, the orbit of only particle ${m}_{3}$ is drawn for the leapfrog and d-CRGNBP methods.

Figure 6.

Figure 6. Orbits of ${m}_{3}$ in CS5BP (Equation (55)) computed by the leapfrog for the chain system and d-CRGNBP methods. The applied integration method is given at the top of each panel. The black and gray orbits are computed using forward and backward integrations, respectively. For the d-CRGNBP method, backward integration yields the same orbit as forward integration, so the gray orbit coincides with the black orbit. Therefore, only the gray orbit is drawn.

Standard image High-resolution image

5. CONCLUSION

We applied a chain regularization method and an extension of the d'Alembert-type scheme (Betsch 2005) to the GNBP. Then, we gave a discrete-time chain regularization of the GNBP (d-CRGNBP) that includes the discrete-time general three-body problem (d-G3BP) proposed by the author (Minesaki 2013a). The d-CRGNBP is second-order accurate and theoretically preserves all the conserved quantities except the angular momentum. Figure 1 shows that for $N=4$, the d-CRGNBP method preserves the Hamiltonian.

In addition, for $N=3,4$, and 5, we clarified that the d-CRGNBP method computes various orbits more accurately than the SI8, d-GNBP, and leapfrog for the chain system methods for a long time interval. In particular, for $N=5$, the author has already proved that the d-CRGNBP method has the same equilibrium points as the R4BP in the limits of ${m}_{4}\to 0$ and ${m}_{5}\to 0$ (Minesaki 2015). Further, the results in Figure 6 indicate that the d-CRGNBP method exhibits time reversibility, which is recognized as an essential property of Hamiltonian systems, including the GNBP. Accordingly, we can expect that the d-CRGNBP method precisely follows non-periodic orbits.

Footnotes

  • Because $\langle {\boldsymbol{q}}\rangle \equiv {\displaystyle \sum }_{i=1}^{N}{m}_{i}{{\boldsymbol{q}}}_{i}^{\prime }/m=0$ and $\langle {\boldsymbol{p}}\rangle \equiv m{\displaystyle \sum }_{i=1}^{N}{{\boldsymbol{p}}}_{i}^{\prime }=0$ in Section 6 of Heggie (1974), Equation (6) coincides with the definitions of ${\boldsymbol{p}}{^{\prime} }_{i}$ and ${\boldsymbol{q}}{^{\prime} }_{i}$ in this paper.

  • Using the second time derivative of the constraints in Equation (5(a)), namely, $d({{\boldsymbol{p}}}_{1j}/{m}_{1}{m}_{j}+{{\boldsymbol{p}}}_{{jk}}/{m}_{j}{m}_{k}-{{\boldsymbol{p}}}_{1k}/{m}_{1}{m}_{k})/{dt}=0$ $(2\leqslant j\lt k\leqslant N)$, we can give the Lagrange multipliers as ${{\boldsymbol{\lambda }}}_{{jk}}={\boldsymbol{\mathcal{F}}}_{{jk}}({\boldsymbol{q}})$. Therefore, system (7) is governed by Equation (8).

Please wait… references are loading.
10.1088/0004-6256/150/4/102