HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

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

Abstract : We discuss the derivation of 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 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. Our software is able to compute conditions up to order 7 (we display them up to order 6). The results are in accordance with those of Hager (where they were computed for order up to 4) as well as those of Murua where the number of conditions up to order 7 is stated.
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070605
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:59:17 PM
Last modification on : Thursday, February 3, 2022 - 11:14:24 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:33:51 PM

Identifiers

  • HAL Id : inria-00070605, version 1

Collections

Citation

J. Frederic Bonnans, Julien Laurent-Varin. Computation of order conditions for symplectic partitioned Runge-Kutta schemes with application to optimal control. [Research Report] RR-5398, INRIA. 2004, pp.18. ⟨inria-00070605⟩

Share

Metrics

Record views

146

Files downloads

393