skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Analysis of an hybridizable discontinuous Galerkin scheme for the tangential control of the Stokes system
We consider an unconstrained tangential Dirichlet boundary control problem for the Stokes equations with an $ L^2 $ penalty on the boundary control.  The contribution of this paper is twofold.  First, we obtain well-posedness and regularity results for the tangential Dirichlet control problem on a convex polygonal domain.  The analysis contains new features not found in similar Dirichlet control problems for the Poisson equation; an interesting result is that the optimal control has higher local regularity on the individual edges of the domain compared to the global regularity on the entire boundary.  Second, we propose and analyze a hybridizable discontinuous Galerkin (HDG) method to approximate the solution.  For convex polygonal domains, our theoretical convergence rate for the control is optimal with respect to the global regularity on the entire boundary.  We present numerical experiments to demonstrate the performance of the HDG method.  more » « less
Award ID(s):
2005696
PAR ID:
10166491
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
ESAIM: Mathematical Modelling and Numerical Analysis
ISSN:
0764-583X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We consider the linearized third order SMGTJ equation defined on a sufficiently smooth boundary domain in and subject to either Dirichlet or Neumann rough boundary control. Filling a void in the literature, we present a direct general system approach based on the vector state solution {position, velocity, acceleration}. It yields, in both cases, an explicit representation formula: input solution, based on the s.c. group generator of the boundary homogeneous problem and corresponding elliptic Dirichlet or Neumann map. It is close to, but also distinctly and critically different from, the abstract variation of parameter formula that arises in more traditional boundary control problems for PDEs L‐T.6. Through a duality argument based on this explicit formula, we provide a new proof of the optimal regularity theory: boundary control {position, velocity, acceleration} with low regularity boundary control, square integrable in time and space. 
    more » « less
  2. Abstract In their article “Coupling at a distance HDG and BEM” , Cockburn, Sayas and Solano proposed an iterative coupling of the hybridizable discontinuous Galerkin method (HDG) and the boundary element method (BEM) to solve an exterior Dirichlet problem. The novelty of the numerical scheme consisted of using a computational domain for the HDG discretization whose boundary did not coincide with the coupling interface. In their article, the authors provided extensive numerical evidence for convergence, but the proof of convergence and the error analysis remained elusive at that time. In this article we fill the gap by proving the convergence of a relaxation of the algorithm and providing a priori error estimates for the numerical solution. 
    more » « less
  3. A nonlinear least-squares finite element method for strong solutions of the Dirichlet boundary value problem of a two-dimensional Pucci equation on convex polygonal domains is investigated in this paper. We obtain a priori and a posteriori error estimates and present corroborating numerical results, where the discrete nonsmooth and nonlinear optimization problems are solved by an active set method and an alternating direction method with multipliers. 
    more » « less
  4. We design and analyze a C0 interior penalty method for the approximation of classical solutions of the Dirichlet boundary value problem of the Monge–Ampère equation on convex polygonal domains. The method is based on an enhanced cubic Lagrange finite element that enables the enforcement of the convexity of the approximate solutions. Numerical results that corroborate the a priori and a posteriori error estimates are presented. It is also observed from numerical experiments that this method can capture certain weak solutions. 
    more » « less
  5. null (Ed.)
    Abstract We design and analyze a $$C^0$$ C 0 interior penalty method for the approximation of classical solutions of the Dirichlet boundary value problem of the Monge–Ampère equation on convex polygonal domains. The method is based on an enhanced cubic Lagrange finite element that enables the enforcement of the convexity of the approximate solutions. Numerical results that corroborate the a priori and a posteriori error estimates are presented. It is also observed from numerical experiments that this method can capture certain weak solutions. 
    more » « less