A software method used to control the degree in a polynomial computation of Hansen coefficients

The Hansen coefficients are widely used in the semi-analytical methods of elliptic orbital propagation. The generation of those coefficients, in computer software, was usually performed by means of recursion formulas, but this approach has some time penalties mainly if not all values are required. W...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2014 18th International Conference on System Theory, Control and Computing (ICSTCC) s. 749 - 754
Hlavní autoři: Barbulescu, Lucian Florentin, Bazavan, Petru Calin
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2014
Témata:
Chebyshev approximation
Java
Linear Systems
Polynomials
Radiation detectors
Software
Software Engineering
Theory of Algorithms
Vectors
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Hansen coefficients are widely used in the semi-analytical methods of elliptic orbital propagation. The generation of those coefficients, in computer software, was usually performed by means of recursion formulas, but this approach has some time penalties mainly if not all values are required. We developed a linear approach, which uses polynomials, and proved that the computation time was lower while the error was kept within acceptable limits. However, we found that, in some cases, due to the limitation of the data type of the programming language that we used (Java), the error was increasing when the degree of the polynomials used was bigger than 40 and we had to develop a method to decrease the degree of the polynomials while not losing the method advantages. This paper presents in detail the method that we used in order to decrease the degree of the polynomials and keep the computation error within acceptable limits.
DOI:10.1109/ICSTCC.2014.6982508