Local Improvements to Reduced-Order Approximations of Optimal Control Problems Governed by Diffusion-Convection-Reaction Equation

We consider the optimal control problem governed by diffusion convection reaction equation without control constraints. The proper orthogonal decomposition(POD) method is used to reduce the dimension of the problem. The POD method may be lack of accuracy if the POD basis depending on a set of parameters is used to approximate the problem depending on a different set of parameters. We are interested in the perturbation of diffusion term. To increase the accuracy and robustness of the basis, we compute three bases additional to the baseline POD. The first two of them use the sensitivity information to extrapolate and expand the POD basis. The other one is based on the subspace angle interpolation method. We compare these different bases in terms of accuracy and complexity and investigate the advantages and main drawbacks of them.Comment: 19 pages, 5 figures, 2 table

Reduced Order Optimal Control of the Convective FitzHugh-Nagumo Equation

In this paper, we compare three model order reduction methods: the proper orthogonal decomposition (POD), discrete empirical interpolation method (DEIM) and dynamic mode decomposition (DMD) for the optimal control of the convective FitzHugh-Nagumo (FHN) equations. The convective FHN equations consists of the semi-linear activator and the linear inhibitor equations, modeling blood coagulation in moving excitable media. The semilinear activator equation leads to a non-convex optimal control problem (OCP). The most commonly used method in reduced optimal control is POD. We use DEIM and DMD to approximate efficiently the nonlinear terms in reduced order models. We compare the accuracy and computational times of three reduced-order optimal control solutions with the full order discontinuous Galerkin finite element solution of the convection dominated FHN equations with terminal controls. Numerical results show that POD is the most accurate whereas POD-DMD is the fastest

Optimal Control of Convective FitzHugh-Nagumo Equation

We investigate smooth and sparse optimal control problems for convective FitzHugh-Nagumo equation with travelling wave solutions in moving excitable media. The cost function includes distributed space-time and terminal observations or targets. The state and adjoint equations are discretized in space by symmetric interior point Galerkin (SIPG) method and by backward Euler method in time. Several numerical results are presented for the control of the travelling waves. We also show numerically the validity of the second order optimality conditions for the local solutions of the sparse optimal control problem for vanishing Tikhonov regularization parameter. Further, we estimate the distance between the discrete control and associated local optima numerically by the help of the perturbation method and the smallest eigenvalue of the reduced Hessian

POD model order reduction with space-adapted snapshots for incompressible flows

We consider model order reduction based on proper orthogonal decomposition (POD) for unsteady incompressible Navier-Stokes problems, assuming that the snapshots are given by spatially adapted finite element solutions. We propose two approaches of deriving stable POD-Galerkin reduced-order models for this context. In the first approach, the pressure term and the continuity equation are eliminated by imposing a weak incompressibility constraint with respect to a pressure reference space. In the second approach, we derive an inf-sup stable velocity-pressure reduced-order model by enriching the velocity reduced space with supremizers computed on a velocity reference space. For problems with inhomogeneous Dirichlet conditions, we show how suitable lifting functions can be obtained from standard adaptive finite element computations. We provide a numerical comparison of the considered methods for a regularized lid-driven cavity problem

Time adaptivity in model predictive control

The core of the Model Predictive Control (MPC) method in every step of the algorithm consists in solving a time-dependent optimization problem on the prediction horizon of the MPC algorithm, and then to apply a portion of the optimal control over the application horizon to obtain the new state. To solve this problem efficiently, we propose a time-adaptive residual a-posteriori error control concept based on the optimality system of this optimal control problem. This approach not only delivers a tailored time discretization of the the prediction horizon, but also suggests a tailored length of the application horizon for the current MPC step. We apply this concept for systems governed by linear parabolic PDEs and present several numerical examples which demonstrate the performance and the robustness of our adaptive MPC control concept

Mini-Workshop: Adaptive Methods for Control Problems Constrained by Time-Dependent PDEs

Optimization problems constrained by time-dependent PDEs (Partial Differential Equations) are challenging from a computational point of view: even in the simplest case, one needs to solve a system of PDEs coupled globally in time and space for the unknown solutions (the state, the costate and the control of the system). Typical and practically relevant examples are the control of nonlinear heat equations as they appear in laser hardening or the thermic control of flow problems (Boussinesq equations). Specifically for PDEs with a long time horizon, conventional time-stepping methods require an enormous storage of the respective other variables. In contrast, adaptive methods aim at distributing the available degrees of freedom in an a-posteriori-fashion to capture singularities and are, therefore, most promising