Optimal complexity solution of space-time finite element systems for state-based parabolic distributed optimal control problems
Richard Löscher, Michael Reichelt, Olaf Steinbach
TL;DR
The work addresses distributed optimal control of the parabolic heat equation by employing an energy norm defined on the anisotropic Sobolev space $H^{1,1/2}_{0;0,}(Q)$, realized computably via a modified Hilbert transform ${\mathcal{H}}_T$. This enables a reduced formulation with a regularization term $\varrho\langle D u_\varrho,u_\varrho\rangle_Q$ and a space-time tensor-product finite element discretization that yields anisotropic error estimates and stable, efficient solvers. A key contribution is an optimal-complexity solver based on diagonalizing the temporal operator and decoupling into independent spatial problems, solvable with conjugate gradients and accelerated by a fast discrete sine transform, achieving $\mathcal{O}(M_x N_t\log N_t)$ complexity. Numerical experiments across smooth, anisotropic, and discontinuous targets, as well as nonlinear and constrained variants, validate the theory and demonstrate robust convergence and scalability. The framework offers a scalable approach for large-scale parabolic control problems and can be extended to adaptive schemes and more general state or control constraints.
Abstract
We consider a distributed optimal control problem subject to a parabolic evolution equation as constraint. The control will be considered in the energy norm of the anisotropic Sobolev space $[H_{0;,0}^{1,1/2}(Q)]^\ast$, such that the state equation of the partial differential equation defines an isomorphism onto $H^{1,1/2}_{0;0,}(Q)$. Thus, we can eliminate the control from the tracking type functional to be minimized, to derive the optimality system in order to determine the state. Since the appearing operator induces an equivalent norm in $H_{0;0,}^{1,1/2}(Q)$, we will replace it by a computable realization of the anisotropic Sobolev norm, using a modified Hilbert transformation. We are then able to link the cost or regularization parameter $\varrho>0$ to the distance of the state and the desired target, solely depending on the regularity of the target. For a conforming space-time finite element discretization, this behavior carries over to the discrete setting, leading to an optimal choice $\varrho = h_x^2$ of the regularization parameter $\varrho$ to the spatial finite element mesh size $h_x$. Using a space-time tensor product mesh, error estimates for the distance of the computable state to the desired target are derived. The main advantage of this new approach is, that applying sparse factorization techniques, a solver of optimal, i.e., almost linear, complexity is proposed and analyzed. The theoretical results are complemented by numerical examples, including discontinuous and less regular targets. Moreover, this approach can be applied also to optimal control problems subject to non-linear state equations.
