53 research outputs found
Analytic Regularity and GPC Approximation for Control Problems Constrained by Linear Parametric Elliptic and Parabolic PDEs
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 with , 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 . We
establish sparsity of generalized polynomial chaos (gpc) expansions of both, state and control, in terms of the stochastic coordinate sequence of the random inputs, and prove convergence rates of best -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 -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]
Recommended from our members
New Discretization Methods for the Numerical Approximation of PDEs
The construction and mathematical analysis of numerical methods for PDEs is a fundamental area of modern applied mathematics. Among the various techniques that have been proposed in the past, some – in particular, finite element methods, – have been exceptionally successful in a range of applications. There are however a number of important challenges that remain, including the optimal adaptive finite element approximation of solutions to transport-dominated diffusion problems, the efficient numerical approximation of parametrized families of PDEs, and the efficient numerical approximation of high-dimensional partial differential equations (that arise from stochastic analysis and statistical physics, for example, in the form of a backward Kolmogorov equation, which, unlike its formal adjoint, the forward Kolmogorov equation, is not in divergence form, and therefore not directly amenable to finite element approximation, even when the spatial dimension is low). In recent years several original and conceptionally new ideas have emerged in order to tackle these open problems.
The goal of this workshop was to discuss and compare a number of novel approaches, to study their potential and applicability, and to formulate the strategic goals and directions of research in this field for the next five years
Multi-level higher order QMC Galerkin discretization for affine parametric operator equations
We develop a convergence analysis of a multi-level algorithm combining higher
order quasi-Monte Carlo (QMC) quadratures with general Petrov-Galerkin
discretizations of countably affine parametric operator equations of elliptic
and parabolic type, extending both the multi-level first order analysis in
[\emph{F.Y.~Kuo, Ch.~Schwab, and I.H.~Sloan, Multi-level quasi-Monte Carlo
finite element methods for a class of elliptic partial differential equations
with random coefficient} (in review)] and the single level higher order
analysis in [\emph{J.~Dick, F.Y.~Kuo, Q.T.~Le~Gia, D.~Nuyens, and Ch.~Schwab,
Higher order QMC Galerkin discretization for parametric operator equations} (in
review)]. We cover, in particular, both definite as well as indefinite,
strongly elliptic systems of partial differential equations (PDEs) in
non-smooth domains, and discuss in detail the impact of higher order
derivatives of {\KL} eigenfunctions in the parametrization of random PDE inputs
on the convergence results. Based on our \emph{a-priori} error bounds, concrete
choices of algorithm parameters are proposed in order to achieve a prescribed
accuracy under minimal computational work. Problem classes and sufficient
conditions on data are identified where multi-level higher order QMC
Petrov-Galerkin algorithms outperform the corresponding single level versions
of these algorithms. Numerical experiments confirm the theoretical results
Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
The numerical approximation of parametric partial differential equations D(u,y)=0 is a computational challenge when the dimension d of of the parameter vector y is large, due to the so-called curse of dimensionality. It was recently shown that, for a certain class of elliptic PDEs with diffusion coefficients depending on the parameters in an affine manner, there exist polynomial approximations to the solution map u -> u(y) with an algebraic convergence rate that is independent of the parametric dimension d. The analysis used, however, the affine parameter dependence of the operator. The present paper proposes a strategy for establishing similar results for some classes parametric PDEs that do not necessarily fall in this category. Our approach is based on building an analytic extension z->u(z) of the solution map on certain tensor product of ellipses in the complex domain, and using this extension to estimate the Legendre coefficients of u. The varying radii of the ellipses in each coordinate zj reflect the anisotropy of the solution map with respect to the corresponding parametric variables yj. This allows us to derive algebraic convergence rates for tensorized Legendre expansions in the case where d is infinite. We also show that such rates are preserved when using certain interpolation procedures, which is an instance of a non-intrusive method. As examples of parametric PDE's that are covered by this approach, we consider (i) elliptic diffusion equations with coefficients that depend on the parameter vector y in a not necessarily affine manner, (ii) parabolic diffusion equations with similar dependence of the coefficient on y, (iii) nonlinear, monotone parametric elliptic PDE's, and (iv) elliptic equations set on a domain that is parametrized by the vector y. We give general strategies that allows us to derive the analytic extension in a unified abstract way for all these examples, in particular based on the holomorphic version of the implicit function theorem in Banach spaces. We expect that this approach can be applied to a large variety of parametric PDEs, showing that the curse of dimensionality can be overcome under mild assumptions
Error bounds for POD expansions of parameterized transient temperatures
We focus on the convergence analysis of the POD expansion for the parameterized solutionof transient heat equations. The parameter of interest is the conductivity coefficient. We provethat this expansion converges with exponential accuracy, uniformly if the conductivity coeffi-cient remains within a compact set of positive numbers. This convergence result is independentof the regularity of the temperature with respect to the space and time variables. We presentsome numerical experiments to show that a reduced number of modes allows to represent withhigh accuracy the family of solutions corresponding to parameters that lie in the compact setunder study.Ministerio de Economía y CompetitividadFondo Europeo de Desarrollo Regiona
- …