Table of Contents
Fetching ...

Optimal control for multiscale equations with rough coefficients

Yanping Chen, Jiaoyan Zeng, Xinliang Liu, Lei Zhang

Abstract

This paper concerns the convex optimal control problem governed by multiscale elliptic equations with arbitrarily rough $L^\infty$ coefficients, which has important applications in composite materials and geophysics. We use one of the recently developed numerical homogenization techniques, the so-called Rough Polyharmonic Splines (RPS) and its generalization (GRPS) for the efficient resolution of the elliptic operator on the coarse scale. Those methods have optimal convergence rate which do not rely on the regularity of the coefficients nor the concepts of scale-separation or ergodicity. As the iterative solution of the OCP-OPT formulation of the optimal control problem requires solving the corresponding (state and co-state) multiscale elliptic equations many times with different right hand sides, numerical homgogenization approach only requires one-time pre-computation on the fine scale and the following iterations can be done with computational cost proportional to coarse degrees of freedom. Numerical experiments are presented to validate the theoretical analysis.

Optimal control for multiscale equations with rough coefficients

Abstract

This paper concerns the convex optimal control problem governed by multiscale elliptic equations with arbitrarily rough coefficients, which has important applications in composite materials and geophysics. We use one of the recently developed numerical homogenization techniques, the so-called Rough Polyharmonic Splines (RPS) and its generalization (GRPS) for the efficient resolution of the elliptic operator on the coarse scale. Those methods have optimal convergence rate which do not rely on the regularity of the coefficients nor the concepts of scale-separation or ergodicity. As the iterative solution of the OCP-OPT formulation of the optimal control problem requires solving the corresponding (state and co-state) multiscale elliptic equations many times with different right hand sides, numerical homgogenization approach only requires one-time pre-computation on the fine scale and the following iterations can be done with computational cost proportional to coarse degrees of freedom. Numerical experiments are presented to validate the theoretical analysis.

Paper Structure

This paper contains 11 sections, 12 theorems, 71 equations, 13 figures, 1 algorithm.

Key Result

Theorem 2.1

Let $(y,u,p)$ be the solution of (eqn:ocp-opt), and $(y_h,u_h,p_h)$ be the finite element solution of (eqn:ocp-opt-h). Assume that $u\in H^1(\Omega_U)$, $y,p\in H^2(\Omega)$, it holds true that \newlabelthm:estimatep10

Figures (13)

  • Figure 1: Coefficients $a(x)$ in $log_{10}$ scale.
  • Figure 2: Coarse and fine mesh of the unit square.
  • Figure 3: Local patches for RPS and GRPS basis
  • Figure 4: The shape and 1d slice along $x$ axis for the global RPS basis $\phi_i$ in $log_{10}$ scale.
  • Figure 5: The slice of the localized RPS basis $\phi_i^{l}$ along $x$ axis in $log_{10}$ scale for the node $i=481$ for various degrees of localization (i.e., for $l=1,4, 7$). The coarse mesh $H=1/32$, the fine mesh $h=1/256$, namely, $Nc=32$ and $J=3$.
  • ...and 8 more figures

Theorems & Definitions (20)

  • Remark 2.1
  • Theorem 2.1
  • Remark 3.1
  • Theorem 3.1
  • Theorem 3.2
  • Theorem 3.3
  • Theorem 3.4
  • Theorem 3.5
  • Lemma 4.1
  • Proof 1
  • ...and 10 more