On scaling algorithm for finding positive solution of elliptic equation

https://doi.org/10.1016/j.amc.2006.11.099Get rights and content

Abstract

Using a numerical method, we will show the existence of positive solution for the elliptic equation -Δu(x)=-λu(x)+u(x)|u(x)|p-2 with Dirichlet boundary condition for varying λ.

Introduction

Because of wide applications of numerical solutions of PDEs in many branches of science and engineering, many authors are studying this arguments by different tools and approaches. Therefore many algorithms have been found effective [4].

DIA, the direct iteration algorithm; MIA, monotone iteration algorithm; MPA, mountain pass algorithm and SIA, the scaling iteration algorithm and etc. Each algorithm has its advantages and disadvantages and should be chosen according to certain a priori knowledge of the solution manifold structure, if any such knowledge is available. For example, DIA and MIA are useful in capturing the so-called stable solutions while MPA and SIA are useful in capturing the so-called mountain pass solutions which are unstable.

In this paper we want to find numerical solution of semilinear elliptic boundary value problems-Δu(x)=-λu(x)+u(x)|u(x)|p-2xΩu(x)=0xΩ,where Ω is a bounded region with smooth boundary in RN, λ is a real parameter, and Δ is the Laplacian operator. We also assume that p satisfies condition 2<p<2=2NN-2.

The study of (1) is motivated by the fact that the equation has wide applications to physical models (see [5] and references therein).

It is well known that the steady-state solutions of-Δu(x)=λf(x,u(x))xΩu(x)=0xΩcorrespond to critical points of the functional J:H01,2(Ω)RJ(u)=12Ω|u(x)|2dx-ΩF(x,u(x))dx,where F(x,u(x))=0uf(x,s)ds. For convenience we will denote H01,2(Ω) by H and will use the standard norm (see, e.g., [1] or [6])uH2=Ω|u(x)|2dx.The corresponding Euler functional for Eq. (1) is given by:J(u)=12Ω|u(x)|2dx+λ2Ω|u(x)|2dx-1pΩ|u(x)|pdx.First we claim that J(u) has neither a global minimum nor a global maximum. In fact, we can choose a sequence {un} satisfying Ω|u(x)|pdx=1 and Ω|u(x)|2dx, so that J(u) and n, i.e., J(u) is not bounded from above. On the other hand, for fixed u  0, we haveJ(tu)=12t2Ω|u(x)|2dx+λ2t2Ω|u(x)|2dx-1p|t|pΩ|u(x)|pdx=t212Ω|u(x)|2dx+λ2Ω|u(x)|2dx-1p|t|p-2Ω|u(x)|pdx-,as t. Hence J(u) is not bounded from below, so we have proved.

Theorem 1

J(u) is neither bounded from above nor bounded from below.

Mountain Pass Lemma [3] can be applied and we have

Theorem 2

For every λ>0, the problem (1) has a positive solution.

The above theorem proved in [2]. We now provided sketch of proof:

Proof

For the existence of solution to (1) it is sufficient to check conditions of Mountain Pass Lemma are satisfied.

By using Sobolev imbedding inequality we haveJ(u)12Ω|u(x)|2dx-1pΩ|u(x)|pdx12Ω|u(x)|2dx+1pcpΩ|u(x)|2p2dx=12cppup-2u2So by choosing ρ=(p4cp)1p-2 and α=14(p4cp)2p-2 we will J(u)>0 for u{uH:u<ρ}-{0}, J(u)α for u=ρ so J(u) satisfies the first condition.

For given fixed u  0 in H, let us consider the map tJ(tu). Then for t>0 we have J(tu) is negative if t is large enough and is positive for sufficiently small t. Thus by continuity there exists t0>0 such that J(t0u)=0 and so J(u) satisfies the second condition.

Also, J satisfies third condition. Therefore by the Mountain Pass Lemma J has a nontrivial critical point. Since J(u)=J(|u|), without loss of generality, we may assume that u is a nonnegative solution of (1). 

We want to obtain this solution numerically by using scaling iteration algorithm.

Section snippets

Numerical results

The scaling iterative algorithm: To explain how this algorithm works, let us see the following problem as a model:Δu(x)-au(x)+bu(x)p=0,xΩ,u(x)=0,xΩwhere a0 and b>0 are given constants, and p>1. By using Mountain Pass Lemma, we know that (3) has at least one solution. Choose a sequence of numbers βn>0,n=1,2, and define vn(x)=u(x)βn. Then each vn is a scaling of u. vn+1 satisfiesΔvn+1(x)-avn+1(x)+αn+1bvn(x)p=0,xΩ,αn+1=βnpβn+1vn+1(x)>0,xΩ,vn+1(x)=0,xΩ..Eq. (4) suggest the following

References (6)

There are more references available in the full text version of this article.

Cited by (0)

View full text