When we look at Eqs. 6.1, 6.2, we see
some familiar features. Neglecting the higher-order term for the
moment, we recognize the leapfrog: the new position is effectively
determined by the mid-point velocity , here approximated as
the average between the two adjacent values
and
.
Similarly, the new velocity is effectively determined by the mid-point
acceleration.
In fact, the analogy can be made more precise. Recalling the leapfrog, as written centered on integer times, Eqs. 4.4, 4.5:
we can transform these back into a pseudo-leap form, without using half-integer times explicitly, by rewriting the first equation as:
In the second line, we have simply rearranged terms. In the third
line, we have used 6.8, and in the fourth line we
have used the definition of , while neglecting higher order terms
in
.
The next step is to remember that the leapfrog is a second-order scheme.
The errors per step are , and therefore it does not
matter whether or not we include the last term
into
our leapfrog version: this term is lost in the noise, and is not going
to improve the accuracy on second-level order. Therefore, we may
equally well leave it out. Doing so transforms Eqs. 6.7,
6.8 into:
Here we see explicitly that our good old leapfrog is equivalent, up to
its second-order accuracy, with the leading terms of
the Hermite algorithm, Eqs. 6.1, 6.2.
It is a curiosity of the leapfrog that at first sight it resembles a
first-order scheme, since the second-order terms are hidden in the
`leapy' way of using average quantities. Yet, as we have seen, the
leapfrog is fully second-order.
In a very similar way, the Hermite scheme is fourth-order, even though it resembles a second-order scheme. For details we refer to the literature, but it is interesting to see in a heuristic way why this is so.