876 research outputs found

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

    Get PDF
    Assuming BRB_{R} is a ball in RN\mathbb R^{N}, we analyze the positive solutions of the problem {−Δu+u=∣u∣p−2u, in BR,∂νu=0, on ∂BR, \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=1u=1 as pp grows from 22 to +∞+\infty. The non-zero constant positive solution is the unique positive solution for pp close to 22. We show that there exist arbitrarily many positive solutions as p→∞p\to\infty (in particular, for supercritical exponents) or as R→∞R \to \infty for any fixed value of p>2p>2, answering partially a conjecture in [Bonheure-Noris-Weth]. We give the explicit lower bounds for pp and RR 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

    Adaptive Pseudo-Transient-Continuation-Galerkin Methods for Semilinear Elliptic Partial Differential Equations

    Full text link
    In this paper we investigate the application of pseudo-transient-continuation (PTC) schemes for the numerical solution of semilinear elliptic partial differential equations, with possible singular perturbations. We will outline a residual reduction analysis within the framework of general Hilbert spaces, and, subsequently, employ the PTC-methodology in the context of finite element discretizations of semilinear boundary value problems. Our approach combines both a prediction-type PTC-method (for infinite dimensional problems) and an adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully adaptive PTC-Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for different examples.Comment: arXiv admin note: text overlap with arXiv:1408.522

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

    Full text link
    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

    An hphp-Adaptive Newton-Galerkin Finite Element Procedure for Semilinear Boundary Value Problems

    Full text link
    In this paper we develop an hphp-adaptive procedure for the numerical solution of general, semilinear elliptic boundary value problems in 1d, with possible singular perturbations. Our approach combines both a prediction-type adaptive Newton method and an hphp-version adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully hphp-adaptive Newton-Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for various examples.Comment: arXiv admin note: text overlap with arXiv:1408.522
    • …
    corecore