A Series Solution Approach to the Circular Restricted Gravitational Three-Body Dynamical Problem

Abstract

The present manuscript examines the circular restricted gravitational three-body problem (CRGTBP) by the introduction of a new approach through the power series method. In addition, certain computational algorithms with the aid of Mathematica software are specifically designed for the problem. The algorithms or rather mathematical modules are established to determine the velocity and position of the third body’s motion. In fact, the modules led to accurate results and thus proved the new approach to be efficient.

Share and Cite:

Alghamdi, M. and Alshaery, A. (2020) A Series Solution Approach to the Circular Restricted Gravitational Three-Body Dynamical Problem. Journal of Applied Mathematics and Physics, 8, 2703-2712. doi: 10.4236/jamp.2020.812200.

1. Introduction

The circular restricted gravitational three-body problem (CRGTBP) is a special case of the gravitational three-body problem which is one of the most important n-body problems. The CRGTBP consists of three bodies; the two bodies of them (which are referred to as the primaries or the primary and the secondary) are moving in a circular orbit about their common mass’s center under the influence of their mutual gravitation and the third body is infinitesimal mass moving under the gravitational significance of the two masses where its mass cannot influence the two masses. Furthermore, the third body has a common plane of movement as defined by both the primary and secondary [1] - [6]. The problem is tackled by studying the motion of the third body assuming full knowledge of the primary and the secondary with regards to their motions [1] [2] [7] [8].

Many physicists and mathematicians have used the method of power series to solve a variety of unsolvable differential equations. The method has been used significantly to solve the celestial mechanic problems as better exactness of inspectional data is required for relatively optimal solutions to the bodies’ dynamical equations of motion. Numerous scientists have used this method including Saad et al. [9] that used it to get recurrent algorithm for comets under non-gravitational motion. Rabe [10] used a new computational and iteration method to determine a series of periodic Trojan orbits in the restricted problem of three bodies. Deprit and Price [11] used the numerical methods to compute characteristic exponents in the planar restricted problem of three bodies. Sharaf et al. [12] found symbolic solution of the three-dimensional restricted three-body problem and applied it for any given set of initial values.

However, we aim in this paper to employ an approach based on the power series to establish an algorithm or mathematical module using Mathematica to tackle this important problem of circular restricted gravitational dynamical problem. More specifically, we determine the components of the velocity and position vectors of the third body with regard to the CRGTBP.

2. Dynamical Equations of Motion of CRGTBP

The dynamical equations of motion for the CRGTBP are given by the following coupled first-order system as follows [12]

x ˙ = u , y ˙ = v , z ˙ = w , u ˙ = ( μ 1 ) ( x μ r 1 3 ) μ ( x + 1 μ r 2 3 ) + x + 2 v , v ˙ = ( μ 1 ) ( y r 1 3 ) μ ( y r 2 3 ) + y 2 u , w ˙ = ( μ 1 ) ( z r 1 3 ) μ ( z r 2 3 ) , (1)

where ( μ ,0,0 ) , ( ( 1 μ ) ,0,0 ) and ( x , y , z ) , are the coordinates of the primary, the secondary and the third body, respectively. More, μ is the primary’s mass, 1 μ is the secondary’s mass ( μ is larger than 1 μ , where μ [ 0, 1 2 ] ). G = 1 is the unit of the force of a gravitational constant; with r 1 denoting the distance of the primary and r 2 that of the secondary both to the third body [1] [2] [6] [13] given by

r 1 = ( x μ ) 2 + y 2 + z 2 , r 2 = ( x + 1 μ ) 2 + y 2 + z 2 . (2)

Using Broucke’s method [14], the following system of first-order differential equations [12] is thus obtained

x ˙ = u , y ˙ = v , z ˙ = w , u ˙ = ( μ 1 ) ( x μ ) s 1 μ ( x μ + 1 ) s 2 + x + 2 v , v ˙ = ( μ 1 ) s 1 μ y s 2 + y 2 u ,

w ˙ = ( μ 1 ) z s 1 μ z s 2 , r 1 r ˙ 1 = ( x μ ) x ˙ + y y ˙ + z z ˙ , r 2 r ˙ 2 = ( x μ + 1 ) x ˙ + y y ˙ + z z ˙ , s ˙ 1 r 1 = 3 s 1 r ˙ 1 , s ˙ 2 r 2 = 3 s 2 r ˙ 2 . (3)

3. Solution by Power Series

The equations given in (3) are unsolvable analytically. Therefore, these equations are solved in this section using the power series method and their analytical solutions are given in terms of recurrence relations of the coefficients posed by the variables.

Thus, with the use of the method of power series, the motion’s variables are as follows [12] [14]

x = n = 1 X n t n 1 , y = n = 1 Y n t n 1 , z = n = 1 Z n t n 1 ,

u = n = 1 U n t n 1 , v = n = 1 V n t n 1 , w = n = 1 W n t n 1 ,

r 1 = n = 1 R 1 n t n 1 , r 2 = n = 1 R 2 n t n 1 ,

s 1 = n = 1 S 1 n t n 1 , s 2 = n = 1 S 2 n t n 1 .

In these power series, the first coefficients are given by the known initial values of ( x 0 , y 0 , z 0 , u 0 , v 0 , w 0 ) as follows [12]

X 1 = x 0 , Y 1 = y 0 , Z 1 = z 0 ,

U 1 = u 0 = x ˙ 0 , V 1 = v 0 = y ˙ 0 , W 1 = w 0 = z ˙ 0 ,

R 11 = ( x 0 μ ) 2 + y 0 2 + z 0 2 ,

R 21 = ( x 0 + 1 μ ) 2 + y 0 2 + z 0 2 ,

S 11 = ( R 11 ) 3 , S 21 = ( R 21 ) 3 .

The following recurrence relations for the remaining coefficients are found using power series [12]

(4)

where

g n = ( X 1 μ , if n = 1 , X n , if n 2 ,

h n = ( X 1 + 1 μ , if n = 1 , X n , if n 2 ,

ϵ n = ( 0, if n = 1, 1, if n 2.

4. Algorithm for CRGTBP

* Purpose

To generate the components of position and velocity for the third body at any time.

* Input

x 0 , y 0 , z 0 , u 0 , v 0 , w 0 , μ , t and NN.

* Output

The components of position and velocity for the third body at any time.

* Module list.

Module [ { } , X ( 1 ) = x0 ; Y ( 1 ) = y0 ; Z ( 1 ) = z0 ;

U ( 1 ) = u0 ; V ( 1 ) = v0 ; W ( 1 ) = w0 ;

R ( 1,1 ) = y0 2 + z0 2 + ( x0 μ ) 2 ;

R ( 2,1 ) = y0 2 + z0 2 + ( x0 μ + 1 ) 2 ; k = 3 ;

S ( 1,1 ) = R ( 1,1 ) k ;

S ( 2,1 ) = R ( 2,1 ) k ;

g ( n_ ) : = X ( 1 ) μ / ; n = 1 ;

g ( n_ ) : = X ( n ) / ; n 2 ;

h ( ( n_ ) : = μ + X ( 1 ) + 1 / ; n = 1 ;

h ( n_ ) : = X ( n ) / ; n 2 ;

ϵ ( n_ ) : = 0 / ; n = 1 ;

ϵ ( n_ ) : = 1 / ; n 2 ;

Do [ { X ( n + 1 ) = U ( n ) n , x = n = 1 NN X ( n ) t n 1 ,

Y ( n + 1 ) = V ( n ) n , y = n = 1 NN Y ( n ) t n 1 ,

Z ( n + 1 ) = W ( n ) n , z = n = 1 NN Z ( n ) t n 1 ,

Q1 = ( 1 μ ) p = 1 n g ( p ) S ( 1, n p + 1 )

μ p = 1 n h ( p ) S ( 2, n p + 1 ) + 2 V ( n ) + X ( n ) ,

U ( n + 1 ) = Q1 n , u = n = 1 NN U ( n ) t n 1 ,

Q2 = ( 1 μ ) p = 1 n Y ( p ) S ( 1, n p + 1 )

μ p = 1 n Y ( p ) S ( 2, n p + 1 ) 2 U ( n ) + Y ( n ) ,

V ( n + 1 ) = Q2 n , v = n = 1 NN V ( n ) t n 1 ,

Q7 = ( 1 μ ) p = 1 n Z ( p ) S ( 1, n p + 1 )

μ p = 1 n Z ( p ) S ( 2, n p + 1 ) ,

W ( n + 1 ) = Q7 n , w = n = 1 NN W ( n ) t n 1 ,

Q3 = p = 1 n ( n p + 1 ) g ( p ) X ( n p + 2 )

+ p = 1 n ( n p + 1 ) Y ( p ) Y ( n p + 2 )

+ p = 1 n ( n p + 1 ) Z ( p ) Z ( n p + 2 )

+ ( p = 2 n ( n p + 1 ) R ( 1, p ) R ( 1, n p + 2 ) ) ϵ ( n ) ,

R ( 1, n + 1 ) = Q3 n R ( 1,1 ) , Q4 = p = 1 n ( n p + 1 ) h ( p ) X ( n p + 2 )

+ p = 1 n ( n p + 1 ) Y ( p ) Y ( n p + 2 )

+ p = 1 n ( n p + 1 ) Z ( p ) Z ( n p + 2 )

+ ( p = 2 n ( n p + 1 ) R ( 2, p ) R ( 2, n p + 2 ) ) ϵ ( n ) ,

R ( 2, n + 1 ) = Q4 n R ( 2,1 ) ,

Q5 = ϵ ( n ) p = 2 n ( n p + 1 ) R ( 1, p ) S ( 1, n p + 2 )

3 p = 1 n ( n p + 1 ) S ( 1, p ) R ( 1, n p + 2 ) ,

S ( 1, n + 1 ) = Q5 n R ( 1,1 ) ,

Q6 = ϵ ( n ) p = 2 n ( n p + 1 ) R ( 2, p ) S ( 2, n p + 2 )

3 p = 1 n ( n p + 1 ) S ( 2, p ) R ( 2, n p + 2 ) ,

S ( 2, n + 1 ) = Q6 n R ( 2,1 ) } , { n ,1, NN } ] ]

5. Application for CRGTBP

For a numerical example of CRGTBP algorithm, the initial values of components for the position and velocity vectors are considered to be

x 0 = 0.153910449 , y 0 = 0.886499068 , z 0 = 0.384340387 ,

u 0 = 0.00000000017268248 , v 0 = 0.0000000002545393 ,

w 0 = 0.0000000001103033 , μ = 0.0121505816.

Then, we get the final value components for the position and velocity vectors as given in Figures 1-12.

It is remarkable to mention here that the accuracy is increased with an increase in the number of terms of the power series, but after NN = 50, the accuracy is fixed. So, we aren’t needed to the more of terms of the power series.

Figure 1. Comparing the exact and approximate values for x when NN = 10.

Figure 2. Comparing the exact and approximate values for y when NN = 10.

Figure 3. Comparing the exact and approximate values for z when NN = 10.

Figure 4. Comparing the exact and approximate values for u when NN = 10.

Figure 5. Comparing the exact and approximate values for v when NN = 10.

Figure 6. Comparing the exact and approximate values for w when NN = 10.

Figure 7. Comparing the exact and approximate values for x when NN = 50.

Figure 8. Comparing the exact and approximate values for y when NN = 50.

Figure 9. Comparing the exact and approximate values for z when NN = 50.

Figure 10. Comparing the exact and approximate values for u when NN = 50.

Figure 11. Comparing the exact and approximate values for v when NN = 50.

Figure 12. Comparing the exact and approximate values for w when NN = 50.

6. Conclusion

In conclusion, the analytical solutions to the circular restricted gravitational three-body problem (CRGTBP) are determined via the application of the power series method. Also, a module or algorithm is specifically designed and implemented via the help of Mathematica software to find the components of the velocity and position vectors for the third body. Finally, the proposed methodology via the devised module has worked accurately and resulted in reliable results as shown.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Roy, A.E. (2004) Orbital Motion. CRC Press, Boca Raton, Florida.
[2] Frnka, R. (2010) The Circular Restricted Three-Body Problem.
http://jan.ucc.nau.edu/~ns46/student/2010/Frnka_2010.pdf
[3] Musielak, Z. and Quarles, B. (2017) Three Body Dynamics and Its Applications to Exoplanets. Springer, Cham.
https://doi.org/10.1007/978-3-319-58226-9
[4] Sharaf, M.A. and Alshaery, A.A. (2012) Restricted Three-Body Problem in Different Coordinate Systems. Applied Mathematics, 3, 949-953.
https://doi.org/10.4236/am.2012.39142
[5] Szebehely, V. (1967) Theory of Orbits: The Restricted Problem of Three Bodies. Academic Press Inc., New York.
https://doi.org/10.1016/B978-0-12-395732-0.50007-6
[6] Worthington, J. (2012) A Study of the Planar Circular Restricted Three Body Problem and the Vanishing Twist. Tese de Doutorado, University of Sydney, Sydney.
[7] Barrow-Green, J. (1997) Poincaré and the Three Body Problem. American Mathematical Society, Providence, Rhode Island.
[8] Heggie, D.C. (2005) The Classical Gravitational N-Body Problem. arXiv preprint astro-ph/0503600
https://doi.org/10.1016/B0-12-512666-2/00003-1
[9] Saad, A.S., Banaszkiewicz, M. and Sitarski, G. (2008) A New Algorithm of the Recurrent Power Series Method for the Non-Gravitational Motion of Comets. Applied Mathematics and Computation, 197, 874-879.
https://doi.org/10.1016/j.amc.2007.08.020
[10] Rabe. E. (1961) Determination and Survey of Periodic Trojan Orbits in the Restricted Problem of Three Bodies. Astronomical Journal, 66, 500-513.
https://doi.org/10.1086/108451
[11] Deprit, A. and Price, J.F. (1965) The Computation of Characteristic Exponents in the Planar Restricted Problem of Three Bodies, (No. MN-415). Boeing Scientific Research Labs Seattle WA Mathematics Research Lab.
https://doi.org/10.21236/AD0622985
[12] Sharaf, M.A., Ghoneim, R. and Alshaery, A.A. (2011) Symbolic Solution of the Three Dimensional Restricted Three-Body Problem. Contributions of the Astronomical Observatory Skalnaté Pleso, 41, 1-12.
[13] Valtonen, M. and Karttunen, H. (2006) The Three-Body Problem. Cambridge University Press, Cambridge.
https://doi.org/10.1017/CBO9780511616006
[14] Broucke, R. (1971) Solution of the N-Body Problem with Recurrent Power Series. Celestial Mechanics, 4, 110-115.
https://doi.org/10.1007/BF01230326

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.