Computational Efficiency of the Recursion of Hansen Coefficents |
| |
| Institution: | 1. Purple Mountain Observatory, Chinese Academy of Sciences, Nanjing 210023 China;2. Laboratory of Space Object and Debris Observation, Chinese Academy of Sciences, Nanjing 210023 China;1. School of Physics and Electronic Science, Guizhou Normal University, Guiyang 550025 China;2. Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing, Guizhou Normal University, Guiyang 550001, China;1. Purple Mountain Observatory, Chinese Academy of Sciences, Nanjing 210023 China;2. National Astronomical Observatory of Japan, Mitaka 181-8511, China;1. Purple Mountain Observatory, Chinese Academy of Sciences, Nanjing 210023;2. Key Laboratory of Dark Matter and Space Astronomy, Chinese Academy of Sciences, Nanjing 210023;3. University of Chinese Academy of Sciences, Beijing 100049;1. National Time Service Center, Chinese Academy of Sciences, Xi’an 710600 China;2. Key Laboratory of Time and Frequency Primary Standards, National Time Service Center, Chinese Academy of Sciences, Xi’an 710600 China;3. School of Astronomy and Space Science, University of Chinese Academy of Sciences, Beijing 100049 China;1. Purple Mountain Observatory, Chinese Academy of Sciences, Nanjing 210023;2. Key Laboratory of Radio Astronomy, Chinese Academy of Sciences, Nanjing 210023;3. School of Astronomy and Space Science, University of Science and Technology of China, Hefei 230026 |
| |
| Abstract: | Computational efficiency of the recursion of eccentricity functions is investigated, and a kind of batch recursion method is given. Its computational efficiency is significantly superior to the direct calculation method. Moreover, this kind of batch recursion is forward so that the magnitudes of eccentricity functions experience from small to large change in the recursive process. Hence in this way the high accuracy of the recursion of eccentricity functions can be guaranteed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
