On the Computation of the Hansen Coefficients

Petru Calin Bazavan, Lucian Barbulescu, P. Cefola
{"title":"On the Computation of the Hansen Coefficients","authors":"Petru Calin Bazavan, Lucian Barbulescu, P. Cefola","doi":"10.1109/SYNASC.2014.24","DOIUrl":null,"url":null,"abstract":"The Hansen coefficients are one of the most important tools in the analytical or semi-analytical methods of celestial mechanics. The problem of efficient computation was investigated in detail in many papers, but this subject is still open and to date there are not standard algorithms to generate the Hansen coefficients with accuracy and good computation time. Although the analytical expressions are known through their accuracy, the formulation by recurrent relations was preferred due to their stability and applicability in the case when a large number of the Hansen coefficients are needed. In this paper we turn our attention to the polynomial approximations and we present a method to generate the polynomials associated to the Hansen coefficients and their derivatives in the particular case used in expression of disturbing function due to central-body. Using the recurrent formulas corresponding to this particular case, we define difference equations and, by their iteration, we generate the polynomials. By computational tests, we compare our polynomial approximations for the Hansen coefficients and their derivatives with the recurrent solutions in order to prove the non-regression of the accuracy and the gain in computation time.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The Hansen coefficients are one of the most important tools in the analytical or semi-analytical methods of celestial mechanics. The problem of efficient computation was investigated in detail in many papers, but this subject is still open and to date there are not standard algorithms to generate the Hansen coefficients with accuracy and good computation time. Although the analytical expressions are known through their accuracy, the formulation by recurrent relations was preferred due to their stability and applicability in the case when a large number of the Hansen coefficients are needed. In this paper we turn our attention to the polynomial approximations and we present a method to generate the polynomials associated to the Hansen coefficients and their derivatives in the particular case used in expression of disturbing function due to central-body. Using the recurrent formulas corresponding to this particular case, we define difference equations and, by their iteration, we generate the polynomials. By computational tests, we compare our polynomial approximations for the Hansen coefficients and their derivatives with the recurrent solutions in order to prove the non-regression of the accuracy and the gain in computation time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于Hansen系数的计算
汉森系数是天体力学解析或半解析方法中最重要的工具之一。许多论文对高效计算问题进行了详细的研究,但这一课题仍然是开放的,迄今为止还没有标准的算法来生成精确且计算时间长的汉森系数。虽然解析表达式的准确性是众所周知的,但由于递归关系的公式在需要大量汉森系数的情况下具有稳定性和适用性,因此首选递归关系公式。在本文中,我们将注意力转向多项式逼近,并提出了一种生成与汉森系数及其导数相关的多项式的方法,用于中心体干扰函数的特殊情况的表达。使用对应于这种特殊情况的循环公式,我们定义差分方程,并通过它们的迭代,我们生成多项式。通过计算试验,我们将Hansen系数及其导数的多项式近似与循环解进行了比较,以证明精度和计算时间增益的非回归性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluating Weighted Round Robin Load Balancing for Cloud Web Services Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms Open and Interoperable Socio-technical Networks Computing Homological Information Based on Directed Graphs within Discrete Objects Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1