Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations
arXiv:1311.6282 · doi:10.1007/s10589-014-9718-0
Abstract
This paper is concerned with the discretization error analysis of semilinear Neumann boundary control problems in polygonal domains with pointwise inequality constraints on the control. The approximations of the control are piecewise constant functions. The state and adjoint state are discretized by piecewise linear finite elements. In a postprocessing step approximations of locally optimal controls of the continuous optimal control problem are constructed by the projection of the respective discrete adjoint state. Although the quality of the approximations is in general affected by corner singularities a convergence order of is proven for domains with interior angles smaller than using quasi-uniform meshes. For larger interior angles mesh grading techniques are used to get the same order of convergence.
Cited by in corpus (4)
- The gradient discretisation method for optimal control problems, with super-convergence for non-conforming finite elements and mixed-hybrid mimetic finite differences
- Error estimates for the discretization of bilinear control problems governed by semilinear elliptic PDEs
- Numerical analysis for the pure Neumann control problem using the gradient discretisation method
- Non-coercive Neumann boundary control problems