Abstract
AbstractMethod-of-lines discretizations are demanding test problems for stiff integration methods. However, for PDE problems with known analytic solution, the presence of space discretization errors or the need to use codes to compute reference solutions may limit the validity of numerical test results. To overcome these drawbacks, we present in this short note a simple test problem with boundary control, a situation where one-step methods may suffer from order reduction. We derive exact formulas for the solution of an optimal boundary control problem governed by a one-dimensional discrete heat equation and an objective function that measures the distance of the final state from the target and the control costs. This analytical setting is used to compare the numerically observed convergence orders for selected implicit Runge–Kutta and Peer two-step methods of classical order four, which are suitable for optimal control problems.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference9 articles.
1. Betts, J.T.: Practical Methods for Optimal Control and Estimation Using Nonlinear Programming, 2nd edn. Society for Industrial and Applied Mathematics (2010)
2. Byrd, R.H., Hribar, M., Nocedal, J.: An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9, 877–900 (1999)
3. Hager, W.W.: Runge–Kutta methods in optimal control and the transformed adjoint system. Numer. Math. 87, 247–282 (2000)
4. Hairer, E., Lubich, C., Wanner, G.: Geometric Numerical Integration, Structure-Preserving Algorithms for Ordinary Differential Equations, Springer Series in Computational Mathematics, vol. 31. Springer, Heidelberg, Berlin (2006)
5. Lang, J., Schmitt, B.A.: Discrete adjoint implicit peer methods in optimal control. J. Comput. Appl. Math. 416, 114596 (2022)