Abstract
We discuss optimization and control of unsteady partial differential equations (PDEs), where some coefficient of the PDE as well as the control may be uncertain. This may be due to the lack of knowledge about the exact physical parameters, like material properties describing a real-world problem (”epistemic uncertainty”) or the inability to apply a computed optimal control exactly in practice. Using a stochastic Galerkin space-time discretization of the optimality system resulting from such PDE-constrained optimization problems under uncertainty leads to large-scale linear or nonlinear systems of equations in saddle point form. Nonlinearity is treated with a Picard-type iteration in which linear saddle point systems have to be solved in each iteration step. Using data compression based on separation of variables and the tensor train (TT) format, we show how these large-scale indefinite and (non)symmetric systems that typically have 10⁸ to 10¹⁵ unknowns can be solved without the use of HPC technology. The key observation is that the unknown and the data can be well approximated in a new block TT format that reduces complexity by several orders of magnitude. As examples, we consider control and optimization problems for the linear heat equation, the unsteady Stokes and Stokes-Brinkman equations, as well as the incompressible unsteady Navier-Stokes equations. The talk surveys the results published in [1,2] and provides new results for the Navier-Stokes case. [1] P. Benner, A. Onwunta, M. Stoll, Block-diagonal preconditioning for optimal control problems constrained by PDEs with uncertain inputs, SIAM Journal on Matrix Analysis and Applications, 37(2):491–518, 2016. [2] P. Benner, S. Dolgov, A. Onwunta, M. Stoll, Low-rank solvers for unsteady Stokes-Brinkman optimal control problem with random data, Computer Methods in Applied Mechanics and Engineering, 304:26–54, 2016. Location: Sala Seminari Ovest, Dipartimento di Informatica.