A comparison of five algorithms for numerical orbit computation in galaxy models

1980 ◽  
Vol 21 (4) ◽  
pp. 337-349 ◽  
Author(s):  
K. A. Papp ◽  
K. A. Innanen ◽  
A. T. Patrick
1978 ◽  
Vol 18 (3) ◽  
pp. 277-286 ◽  
Author(s):  
K. A. Papp ◽  
K. A. Innanen ◽  
A. T. Patrick

1966 ◽  
Vol 25 ◽  
pp. 363-371
Author(s):  
P. Sconzo

In this paper an orbit computation program for artificial satellites is presented. This program is operational and it has already been used to compute the orbits of several satellites.After an introductory discussion on the subject of artificial satellite orbit computations, the features of this program are thoroughly explained. In order to achieve the representation of the orbital elements over short intervals of time a drag-free perturbation theory coupled with a differential correction procedure is used, while the long range behavior is obtained empirically. The empirical treatment of the non-gravitational effects upon the satellite motion seems to be very satisfactory. Numerical analysis procedures supporting this treatment and experience gained in using our program are also objects of discussion.


2021 ◽  
Vol 133 (3) ◽  
Author(s):  
Marilena Di Carlo ◽  
Simão da Graça Marto ◽  
Massimiliano Vasile

AbstractThis paper presents a collection of analytical formulae that can be used in the long-term propagation of the motion of a spacecraft subject to low-thrust acceleration and orbital perturbations. The paper considers accelerations due to: a low-thrust profile following an inverse square law, gravity perturbations due to the central body gravity field and the third-body gravitational perturbation. The analytical formulae are expressed in terms of non-singular equinoctial elements. The formulae for the third-body gravitational perturbation have been obtained starting from equations for the third-body potential already available in the literature. However, the final analytical formulae for the variation of the equinoctial orbital elements are a novel derivation. The results are validated, for different orbital regimes, using high-precision numerical orbit propagators.


Orbits ◽  
2013 ◽  
pp. 229-257
Author(s):  
Guochang Xu ◽  
Jia Xu

1989 ◽  
pp. 103-110
Author(s):  
P. Rajendra prasad ◽  
S.Venkateswara rao ◽  
Ananth Krishna ◽  
P. Padmanabhan ◽  
M.G. Chandrasekhar
Keyword(s):  

1993 ◽  
Vol 153 ◽  
pp. 369-370
Author(s):  
L.P. Ossipkov ◽  
S.A. Kutuzov

The study of prevalent orbits in galactic subsystems can help us understand galactic structure and clarify its history. The classical analysis of flat orbits and metallicities of old stars led Eggen et al. (1962) to formulate the rapid collapse of the primordial Galaxy. On the other side Yoshii & Saio (1979) studied three-dimensional orbits that separate in spherical coordinates. They found the Galaxy contracted quasi-stationary after the formation of halo objects. Here we shall briefly discuss the results of numerical orbit calculations (with Merson's method) for selected galactic subsystems. The axially symmetrical two-component model of the Galaxy (Kutuzov, Ossipkov 1989) was adopted. One-component models (Barkhatova et al. 1987, Kutuzov 1988) were used also but no significant difference in orbit elements was found (Kutuzov & Ossipkov 1992). Pericenter and apocenter distances, Rp and Ra, and the maximal height of objects over the galactic plane, zm, were used as orbit elements as well as dimensionless quantities e = (Ra — Rp)/(Ra + Rp) (eccentricity) and c = 2zm/(Ra — Rp) (the flatness of box filled by orbit projection on the meridional plane).


2009 ◽  
Vol 19 (12) ◽  
pp. 4227-4235 ◽  
Author(s):  
ALI KANSO

This paper proposes the construction of a new chaotic pseudorandom bit generator, which forms the main building block of a chaotic stream cipher. The design of the algorithm is based on a single chaotic map whose numerical orbit indirectly contributes towards the generation of the keystream. The latter is produced from the numerical orbit by applying a technique that searches for iterates in specific intervals [a,b], for some real numbers a and b, and outputs 0 or 1 based on the iterate preceding the targeted iterate. The generator suggested here is built up from a quadratic map. We analyze the cycle length of the keystreams and investigate the resistance of the generator to well-known cryptanalytic attacks. Furthermore, the statistic characteristics of the keystreams are examined numerically using the NIST statistical test suite. The numerical and theoretical results demonstrate that the proposed technique results in generating keystreams possessing very good cryptographic properties and high level of security against existing cryptanalytic attacks. Empirical results show that the search technique leads to the generation of keystreams possessing good randomness properties when applied to any chaotic map whose orbits have good randomness properties such as the quadratic map, tent map and sawtooth map.


Sign in / Sign up

Export Citation Format

Share Document