Computation of order conditions for symplectic partitioned Runge-Kutta schemes with application to optimal control

We derive order conditions for the discretization of (unconstrained) optimal control problems, when the scheme for the state equation is of Runge-Kutta type. This problem appears to be essentially the one of checking order conditions for symplectic partitioned Runge-Kutta schemes. We show that the computations using bi-coloured trees are naturally expressed in this case in terms of oriented free tree. This gives a way to compute them by an appropriate computer program. This study is supported by CNES and ONERA, in the framework of the CNES fellowship of the second author.