An error estimate for symplectic euler approximation of optimal control problems

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns symplectic Euler solutions of the Hamiltonian system connected with the optimal control problem. The error representation has a leading-order term consisting of an error density that is computable from symplectic Euler solutions. Under an assumption of the pathwise convergence of the approximate dual function as the maximum time step goes to zero, we prove that the remainder is of higher order than the leading-error density part in the error representation. With the error representation, it is possible to perform adaptive time stepping. We apply an adaptive algorithm originally developed for ordinary differential equations. The performance is illustrated by numerical tests.

Cite

CITATION STYLE

APA

Karlsson, J., Larsson, S., Sandberg, M., Szepessy, A., & Tempone, R. (2015). An error estimate for symplectic euler approximation of optimal control problems. SIAM Journal on Scientific Computing, 37(2), A946–A969. https://doi.org/10.1137/140959481

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free