Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations

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 $h^2|\ln h|^{3/2}$ is proven for domains with interior angles smaller than $2\pi/3$ using quasi-uniform meshes. For larger interior angles mesh grading techniques are used to get the same order of convergence

Multiple radial positive solutions of semilinear elliptic problems with Neumann boundary conditions

Assuming $B_{R}$ is a ball in $\mathbb R^{N}$, we analyze the positive solutions of the problem $$\begin{cases} -\Delta u+u= |u|^{p-2}u, &\text{ in } B_{R},\newline \partial_{\nu}u=0,&\text{ on } \partial B_{R}, \end{cases}$$ that branch out from the constant solution $u=1$ as $p$ grows from $2$ to $+\infty$. The non-zero constant positive solution is the unique positive solution for $p$ close to $2$. We show that there exist arbitrarily many positive solutions as $p\to\infty$ (in particular, for supercritical exponents) or as $R \to \infty$ for any fixed value of $p>2$, answering partially a conjecture in [Bonheure-Noris-Weth]. We give the explicit lower bounds for $p$ and $R$ so that a given number of solutions exist. The geometrical properties of those solutions are studied and illustrated numerically. Our simulations motivate additional conjectures. The structure of the least energy solutions (among all or only among radial solutions) and other related problems are also discussed.Comment: 37 pages, 24 figure

Fully Adaptive Newton-Galerkin Methods for Semilinear Elliptic Partial Differential Equations

In this paper we develop an adaptive procedure for the numerical solution of general, semilinear elliptic problems with possible singular perturbations. Our approach combines both a prediction-type adaptive Newton method and an adaptive finite element discretization (based on a robust a posteriori error analysis), thereby leading to a fully adaptive Newton-Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for different examples

A Computer-Assisted Uniqueness Proof for a Semilinear Elliptic Boundary Value Problem

A wide variety of articles, starting with the famous paper (Gidas, Ni and Nirenberg in Commun. Math. Phys. 68, 209-243 (1979)) is devoted to the uniqueness question for the semilinear elliptic boundary value problem -{\Delta}u={\lambda}u+u^p in {\Omega}, u>0 in {\Omega}, u=0 on the boundary of {\Omega}, where {\lambda} ranges between 0 and the first Dirichlet Laplacian eigenvalue. So far, this question was settled in the case of {\Omega} being a ball and, for more general domains, in the case {\lambda}=0. In (McKenna et al. in J. Differ. Equ. 247, 2140-2162 (2009)), we proposed a computer-assisted approach to this uniqueness question, which indeed provided a proof in the case {\Omega}=(0,1)x(0,1), and p=2. Due to the high numerical complexity, we were not able in (McKenna et al. in J. Differ. Equ. 247, 2140-2162 (2009)) to treat higher values of p. Here, by a significant reduction of the complexity, we will prove uniqueness for the case p=3