Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems

Details Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems

2012-02-06

arxiv.org/abs/1202.1166v1

Mathematics

Numerical Analysis

Scientific paper

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge-Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable transformations of the adjoint equation, order conditions up to order three are proven as well as the relation between adjoint schemes obtained through different transformations is investigated. Conditions for the IMEX Runge-Kutta methods to be symplectic are also derived. A numerical example illustrating the theoretical properties is presented.

Affiliated with

Also associated with

No associations

Rating

Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119676