Determination of Eccentric Anomaly for Kepler’s Satellite Orbit Using Perturbation-Based Seeded Secant Iteration Scheme

H. Dike, A. Isaac
{"title":"Determination of Eccentric Anomaly for Kepler’s Satellite Orbit Using Perturbation-Based Seeded Secant Iteration Scheme","authors":"H. Dike, A. Isaac","doi":"10.52589/bjcnit-m7xkp8rv","DOIUrl":null,"url":null,"abstract":"In this paper, the determination of eccentric anomaly (E) for Kepler’s satellite orbit using Perturbation-Based Seeded Secant (PBSS) iteration algorithm is presented. The solution is meant for Kepler’s orbit with the value of eccentricity (e) in the range 0 ≤ e ≤ 1. Such orbits are either circular or elliptical. The demonstration of the applicability of the PBSS iteration is presented using sample numerical examples with different values of mean anomaly (M) and eccentricity (e). The summary of the results of E for M = 30° and e in the range 0.001 ≤ e ≤1 showed that the convergence cycle (n) increases as e increases. Particularly, n increased from 2 at e = 0.01 to n = 8 at e =1. The implication is that it takes more iterations to arrive at the value of E with the desired accuracy or error performance (which in this case is set to 10^(-12)). Another implication is that a good choice of the initial value of E is essential especially as the value of e increases. As such, effort should be made to develop a means of estimating the initial value of E which will reduce the convergence cycle for higher values of e.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"British Journal of Computer, Networking and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52589/bjcnit-m7xkp8rv","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the determination of eccentric anomaly (E) for Kepler’s satellite orbit using Perturbation-Based Seeded Secant (PBSS) iteration algorithm is presented. The solution is meant for Kepler’s orbit with the value of eccentricity (e) in the range 0 ≤ e ≤ 1. Such orbits are either circular or elliptical. The demonstration of the applicability of the PBSS iteration is presented using sample numerical examples with different values of mean anomaly (M) and eccentricity (e). The summary of the results of E for M = 30° and e in the range 0.001 ≤ e ≤1 showed that the convergence cycle (n) increases as e increases. Particularly, n increased from 2 at e = 0.01 to n = 8 at e =1. The implication is that it takes more iterations to arrive at the value of E with the desired accuracy or error performance (which in this case is set to 10^(-12)). Another implication is that a good choice of the initial value of E is essential especially as the value of e increases. As such, effort should be made to develop a means of estimating the initial value of E which will reduce the convergence cycle for higher values of e.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于微扰的种子割线迭代法确定开普勒卫星轨道偏心异常
提出了利用基于微扰的种子割线(PBSS)迭代算法确定开普勒卫星轨道偏心异常(E)的方法。求解偏心率e在0≤e≤1范围内的开普勒轨道。这样的轨道不是圆形就是椭圆形。以不同的平均异常(M)和偏心率(e)为例,对PBSS迭代的适用性进行了论证。对M = 30°和e在0.001≤e≤1范围内的结果进行了总结,表明收敛周期(n)随着e的增大而增大。特别是,n从e = 0.01时的2增加到e =1时的n = 8。这意味着需要更多的迭代才能达到期望的精度或误差性能(在本例中设置为10^(-12))。另一个含义是,E的初始值的良好选择是至关重要的,特别是当E的值增加时。因此,应该努力开发一种估计E初始值的方法,以减少较高E值的收敛周期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Curbing the Effect of Climate Change for Sustainable Development through Digital Transformation and Environmental Sustainability An Efficient Security Routing Protocol for Cloud-Based Networks Using Cisco Packet Tracer Fake News Detection System Using Logistic Regression, Decision Tree and Random Forest Automation of a Complaint Management System Using RPA Information Systems and Operational Efficiency of Maritime Firms in Port Harcourt
×
引用
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