Papers › Reducing roundoff errors in numerical integration of planetary ephemeris
Reducing roundoff errors in numerical integration of planetary ephemeris
Maxim Subbotin, Alexander Kodukov, Dmitry Pavlov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Modern lunar-planetary ephemerides are numerically integrated on the observational timespan of more than 100 years (with the last 20 years having very precise astrometrical data). On such long timespans, not only finite difference approximation errors, but also the accumulating arithmetic roundoff errors become important because they exceed random errors of high-precision range observables of Moon, Mars, and Mercury. One way to tackle this problem is using extended-precision arithmetics available on x86 processors. Noting the drawbacks of this approach, we propose an alternative: using double-double arithmetics where appropriate. This will allow to use only double precision floating-point primitives which have ubiquitous support.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections