{"title":"基于微扰的种子割线迭代法确定开普勒卫星轨道偏心异常","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":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"130 1\",\"pages\":\"0\"},\"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}","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}
Determination of Eccentric Anomaly for Kepler’s Satellite Orbit Using Perturbation-Based Seeded Secant Iteration Scheme
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.