A numerical method to obtain positive solution for classes of sublinear semipositone problems
Introduction
In this paper, we consider the semipositone problemwhere λ > 0 is a constant, Ω is a bounded region in Rn with smooth boundary, and f is a smooth function such that f′(u) is bounded below,and
We prove under some additional conditions the existence of a positive solution for λ ∈ I, where I is an interval close to the smallest eigenvalue of −Δ with Dirichlet boundary condition. It was shown that if λ is small then (1), (1.1), (1.2) has no positive solution. In fact, if λ is small, and if uλ is a solution, then uλ ⩽ 0 in Ω. Next we consider an anti-maximum principle by Clement and Peletier [3], from which we obtain the existence of a δ = δ(Ω) > 0 and a solution zλ, positive in Ω, offor λ ∈ (λ1, λ1 + δ), where λ1 is the smallest eigenvalue of the problemLet I = [α, γ], where α > λ1 and γ < λ1 + δ, and letwhere ∥·∥ denotes the supremum norm. Now assuming that there exists a m > 0 such that(note here that (γσ > 1)) we prove that, (1), (1.1), (1.2) has a non-negative solution for λ ∈ I. Here the solution zλ of (2) will be used to create a sub-solution, that is, a function ψ(x) such that Theorem 1 There exists λ0 > 0 such that if 0 < λ < λ0 and u is a solution of (1), (1.1), (1.2) then u ⩽ 0 in Ω.
The above theorem (proved in [1]) shows that if λ is small then (1), (1.1), (1.2) has no positive solution. In fact, if λ is small, and if uλ is a solution, then uλ ⩽ 0 in Ω. Theorem 2 Let λ ∈ I and assume that f satisfies (1.1), (1.2), (1.4). Then (1) has a non-negative solution.
Theorem 2 also proved in [1] that we give a proof for the sake of completeness. Let ψ(x)≔(γm)z(x), where γ, m and z are as before. ThenBut
Thus ψ(x) is a sub-solution of (1) for λ ∈ I. Now let v(x) to be the unique positive solution ofand consider ϕ(x) = J v(x); J > 0 (to be chosen). Then ϕ satisfiesBut by (1.2), there exists a J0 > 0 such that for J > J0,and thus ϕ(x) will be a super-solution for (1). Now choose J > J0 large enough that
This is clearly possible by Hopfs maximum principle, and hence by the well-known method of sub- and super-solutions, (1) has a non-negative solution u(x) such that γm z(x) ⩽ u(x) ⩽ J v(x), and Theorem 2 is proven. Here we give a simple example that satisfies (1.1), (1.2), (1.4). ConsiderThen and . Thus (1.1), (1.2) are satisfied. Now let p > 0 be such that f(p) = p − m. That is,andHence in order that (1.4) is satisfied, we must havethat is,(Note here that γ and α are quantities that depend on only Ω). Clearly for a given γ and α, there exists a m0 such that if m > m0 then (1.7) is satisfied and equivalently (1.4) will be satisfied.
We investigate numerically positive solutions. Our numerical method is based on monotone iteration.
We say that u is a positive solution of (1) if u is a classical solution with u(x) ∈ I for all and u(x) > 0 for all x ∈ Ω.
Section snippets
Numerical results
It is well known that there must always exists a solution for problems such as (2) between a sub-solution v and a super-solution such that for all x ∈ Ω (see [2]).
Consider the boundary value problemLet , satisfy as well asChoose a number c > 0 such that and such that the operator (Δ − c) with Dirichlet boundary condition has its spectrum strictly contained
References (5)
- et al.
An anti-maximum principle for second order elliptic operators
Differential Equations
(1979) Numerical procedures for a boundary value problem with a non-linear boundary condition
Applied Mathematics and Computation
(2004)