A Discontinuous Galerkin Method for Biharmonic Dirichlet Control Problems With Patch Reconstruction

In this paper, we present and analyze an interior penalty discontinuous Galerkin method for Dirichlet boundary control problems governed by the biharmonic equation, with the control imposed through the normal derivative. The method is based on a reconstructed discontinuous approximation that admits an arbitrarily high-order approximation space with only one unknown per element. We construct a discretization that approximates the state and adjoint state in this space and derive a priori error estimates in the energy and $L^2$ norms. The analysis is carried out under the limited regularity available on polygonal domains by means of a medius argument. Numerical experiments are provided to support the predicted convergence rates.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.34669
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A Discontinuous Galerkin Method for Biharmonic Dirichlet Control Problems With Patch Reconstruction

Ruo Li, Wei Gong, Jun Yin
arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
preprint

A Discontinuous Galerkin Method for Biharmonic Dirichlet Control Problems With Patch Reconstruction

Ruo Li, Wei Gong, Jun Yin
preprint en

Abstract

In this paper, we present and analyze an interior penalty discontinuous Galerkin method for Dirichlet boundary control problems governed by the biharmonic equation, with the control imposed through the normal derivative. The method is based on a reconstructed discontinuous approximation that admits an arbitrarily high-order approximation space with only one unknown per element. We construct a discretization that approximates the state and adjoint state in this space and derive a priori error estimates in the energy and $L^2$ norms. The analysis is carried out under the limited regularity available on polygonal domains by means of a medius argument. Numerical experiments are provided to support the predicted convergence rates.

arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon