Some notes concerning preconditioning of linear parabolic optimal control problems
Luise Blank
TL;DR
This work analyzes conditioning in linear parabolic PDE-constrained optimization with Neumann boundaries and end-time tracking. It proves mesh-independent conditioning for the reduced system under implicit $dG(0)$ time discretization and conforming spatial FE, and develops a Greif–Schötzau-based preconditioner for the all-at-once saddle-point system that yields spectrally clustered, discretization-insensitive behavior. Numerical experiments in multiple space dimensions validate the theoretical bounds and demonstrate robust, low iteration counts for both reduced and all-at-once formulations. The results provide practical preconditioning strategies for fast solvers in PDE-constrained parabolic optimization and clarify a trade-off between reduced and full-system approaches.
Abstract
In this paper we study the conditioning of optimal control problems constrained by linear parabolic equations with Neumann boundary conditions. While we concentrate on a given end-time target function the results hold also when the target function is given over the whole time horizon. When implicit time discretization and conforming finite elements in space are employed we show that the reduced problem formulation has condition numbers which are bounded independently of the discretization level in arbitrary space dimension. In addition we propose for the all-at-once approach, i.e. for the first-order conditions of the unreduced system a preconditioner based on work by Greif and Schötzau, which provides also bounds on the eigenvalue distribution independently of the discretization level. Numerical experiments demonstrate the obtained results and the efficiency of the suggested preconditioners.
