Abstract

This paper is concerned with the discretization of linear elliptic partial differential equations with Neumann boundary condition in polygonal domains. The focus is on the derivation of error estimates in the L 2 L^2 -norm on the boundary for linear finite elements. Whereas common techniques yield only suboptimal results, a new approach in this context is presented which allows for quasi-optimal ones, i.e., for domains with interior angles smaller than 2 π / 3 2\pi /3 a convergence order two (up to a logarithmic factor) can be achieved using quasi-uniform meshes. In the presence of internal angles greater than 2 π / 3 2\pi /3 which reduce the convergence rates on quasi-uniform meshes, graded meshes are used to maintain the quasi-optimal error bounds. This result is applied to linear-quadratic Neumann boundary control problems with pointwise inequality constraints on the control. The approximations of the control are piecewise constant. The state and the adjoint state are discretized by piecewise linear finite elements. In a postprocessing step approximations of the continuous optimal control are constructed which possess superconvergence properties. Based on the improved error estimates on the boundary and optimal regularity in weighted Sobolev spaces almost second order convergence is proven for the approximations of the continuous optimal control problem. Mesh grading techniques are again used for domains with interior angles greater than 2 π / 3 2\pi /3 . A certain regularity of the active set is assumed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.