Kunoth, Angela and Schwab, Christoph
(2013)
*Analytic Regularity and GPC Approximation for Control Problems Constrained by Linear Parametric Elliptic and Parabolic PDEs.*
SIAM Journal on Control and Optimization.
(In Press)

Text
acmac-0162.pdf Download (447Kb) |

## Abstract

This paper deals with linear-quadratic optimal control problems constrained by a parametric or stochastic elliptic or parabolic PDE. We address the (difficult) case that the state equation depends on a countable number of parameters i.e., on $\sigma_j$ with $j\in\N$, and that the PDE operator may depend non-affinely on the parameters. We consider tracking-type functionals and distributed as well as boundary controls. Building on recent results in [CDS1, CDS2], we show that the state and the control are analytic as functions depending on these parameters $\sigma_j$. We establish sparsity of generalized polynomial chaos (gpc) expansions of both, state and control, in terms of the stochastic coordinate sequence $\sigma = (\sigma_j)_{j\ge 1}$ of the random inputs, and prove convergence rates of best $N$-term truncations of these expansions. Such truncations are the key for subsequent computations since they do {\em not} assume that the stochastic input data has a finite expansion. In the follow-up paper [KS2], we explain two methods how such best $N$-term truncations can practically be computed, by greedy-type algorithms as in [SG, Gi1], or by multilevel Monte-Carlo methods as in [KSS]. The sparsity result allows in conjunction with adaptive wavelet Galerkin schemes for sparse, adaptive tensor discretizations of control problems constrained by linear elliptic and parabolic PDEs developed in [DK, GK, K], see [KS2].

Item Type: | Article |
---|---|

Depositing User: | Prof. Dr. Angela Kunoth |

Date Deposited: | 11 Mar 2013 11:17 |

Last Modified: | 12 Nov 2017 07:35 |

URI: | http://preprints.acmac.uoc.gr/id/eprint/162 |

### Actions (login required)

View Item |