Papers › Few Observation Binary Orbit Solver (FOBOS) from two (or more) astrometric observations
Few Observation Binary Orbit Solver (FOBOS) from two (or more) astrometric observations
Rebecca J. Houghton, Simon P. Goodwin
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.
We have developed a new, fast method of estimating the orbital properties of a binary or triple system using as few as two epochs of astrometric data. FOBOS (Few Observation Binary Orbit Solver) uses a flat prior brute force Monte Carlo method to produce probability density functions of the likely orbital parameters. We test the code on fake observations and show that it can (fairly often) constrain the semi-major axis to within a factor of 2-3, and the inclination to within ∼20° from only two astrometric observations. We also show that the 68 and 95 per cent confidence intervals are statistically reliable. Applying this method to triple systems allows the relative inclination of the secondary and tertiary star orbits to be constrained. FOBOS can usually find a statistically significant number of possible matches in CPU minutes for binary systems, and CPU hours for triple systems.
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