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