A Database of High Precision Trivial Choreographies for the Planar Three-Body Problem

Trivial choreographies are special periodic solutions of the planar three-body problem. In this work we use a modified Newton’s method based on continuous analog and high precision arithmetic for specialized numerical search new trivial choreographies. As result computed database 462 such orbits, including 397 ones. The initial conditions periods all found given with 180 correct decimal digits. 108 linearly stable, 99 linear stability is tested by computing eigenvalues monodromy matrices.