 Research
 Open access
 Published:
A onedimensional prescribed curvature equation modeling the corneal shape
Boundary Value Problems volume 2014, Article number: 127 (2014)
Abstract
We prove existence, uniqueness, and stability of solutions of the prescribed curvature problem {({u}^{\prime}/\sqrt{1+{u}^{\prime 2}})}^{\prime}=aub/\sqrt{1+{u}^{\prime 2}} in [0,1], {u}^{\prime}(0)=u(1)=0, for any given a>0 and b>0. We also develop a linear monotone iterative scheme for approximating the solution. This equation has been proposed as a model of the corneal shape in the recent paper (Okrasiński and Płociniczak in Nonlinear Anal., Real World Appl. 13:14981505, 2012), where a simplified version obtained by partial linearization has been investigated.
1 Introduction
In this paper we study existence, uniqueness, stability, and approximation of classical solutions of the onedimensional prescribed curvature problem
where a>0 and b>0 are given constants. This problem, together with its Ndimensional counterpart
has been proposed in [1–4] as a mathematical model for the geometry of the human cornea. However, in these papers a simplified version of (2) has been investigated, where the mean curvature operator div(\mathrm{\nabla}u/\sqrt{1+{\mathrm{\nabla}u}^{2}}) has been replaced by its linearization div(\mathrm{\nabla}u) around 0. In particular, it has been proved in [1] that, if b\in \phantom{\rule{0.2em}{0ex}}]0,\frac{3\sqrt{3}}{2}\frac{\sqrt{a}}{tanh\sqrt{a}}[, then the problem
has a unique solution which is the limit of a sequence of successive approximations. The above limitations on the parameters have recently been removed in [4].
Unlike all these works we tackle here the fully nonlinear problem (1) and we prove the existence of a unique solution for the whole range of positive parameters a, b. The study of problem (1) requires some care because, even if pairs of constant lower and upper solutions can easily be exhibited, the presence of the curvature term rules out in general the possibility of applying the standard existence results, due to the possible occurrence of derivative blowup phenomena (see, e.g., [5]). On the other hand, the nonvariational structure of (1) puts the problem, as it stands, out of the scope of the methods developed in [6–8] for the curvature equation. Nevertheless, we show that an a priori bound in {C}^{1} for all possible solutions can be obtained by an elementary, but delicate, argument which exploits the qualitative properties  positivity, monotonicity, and concavity  of the solutions themselves. These estimates eventually enable us to use a degree argument in order to prove the existence of solutions. The proof of the uniqueness is then based on suitable fixed point index calculations, which are performed via linearization. A similar approach, applied to an associated evolutionary problem, is exploited for detecting the linear stability of the solution.
Next, taking inspiration from [9, 10], we develop a linear iterative scheme for approximating the solution by two monotone sequences of strict lower and upper solutions, starting from an explicit pair of constant lower and upper solutions. These two sequences, besides providing accurate twosided bounds on the solution, yield the strict order stability and hence, according to [11], the (Lyapunov) asymptotic stability of the solution itself, yielding as well an explicitly computable estimate of its basin of attractivity. We finally illustrate the use of this approximation scheme in order to compute numerically the solution u of (1) for the same choice of the parameters a and b as the one considered in [1].
We finally mention that part of our results extends to the general Ndimensional problem (2); this topic will be discussed elsewhere.
2 Existence, qualitative properties and approximation
In this section we are concerned with the study of the existence, the qualitative properties and the approximation of classical solutions, i.e., belonging to {C}^{2}([0,1]), of problem (1), where a>0 and b>0 are fixed constants. Clearly, problem (1) can be written in the equivalent form
Let us set for convenience, for all (s,\xi )\in {\mathbb{R}}^{2},
It is obvious that, due to the symmetry properties of the function f, the mixed problem (4) is equivalent to the Dirichlet problem
Notations As usual, for functions u,v\in {C}^{0}([c,d]), we write u\le v in [c,d] if u(t)\le v(t) for all t\in [c,d] and u<v in [c,d] if u\le v and u\ne v. We also write u\ll v in [c,d] if u(t)<v(t) for all t\in [c,d[ and, if u(d)=v(d), {D}_{}u(d)>{D}^{}v(d), where {D}_{}, {D}^{} denote the left Dini derivatives; this is equivalent to requiring that there exists \delta >0 such that v(t)u(t)\ge \delta (dt) for all t\in [c,d]. Whenever no confusion occurs, we omit the indication of the interval.
Existence, uniqueness, and linear stability
We start with a preliminary result, where some properties of the possible solutions of problem (1) are highlighted.
Lemma 2.1 The following assertions hold.

(i)
Any solution u of (1) satisfies u(t)>0 for all t\in [0,1[ and u(t)<\frac{b}{a} for all t\in [0,1].

(ii)
Any solution u of (1) is such that {u}^{\prime}(t)<0 and {u}^{\u2033}(t)\le 0 for all t\in \phantom{\rule{0.2em}{0ex}}]0,1].

(iii)
Any solution u of (1) is such that {u}^{\prime}(t)>R for all t\in [0,1], where R=\sqrt{exp(\frac{2{b}^{2}}{a})1}.
Proof In the following steps u denotes a solution of (1), or equivalently of (4). From the equation in (4) it follows that, if \stackrel{\u02c6}{t}\in [0,1] is such that {u}^{\prime}(\stackrel{\u02c6}{t})=0 and u(\stackrel{\u02c6}{t})\ne \frac{b}{a}, then
Step 1. Proof of (i). Let us first show that u\ge 0 in [0,1]. Assume by contradiction that {min}_{[0,1]}u=u(\stackrel{\u02c6}{t})<0. The boundary condition u(1)=0 implies that \stackrel{\u02c6}{t}\in \phantom{\rule{0.2em}{0ex}}[0,1[. Suppose that \stackrel{\u02c6}{t}=0. We have u(0)<0 and {u}^{\prime}(0)=0. Condition (6) yields {u}^{\u2033}(0)<0. Hence there exists \delta >0 such that {u}^{\prime}(t)<0 for all t\in \phantom{\rule{0.2em}{0ex}}]0,\delta [ and therefore u(t)<u(0)={min}_{[0,1]}u for all t\in \phantom{\rule{0.2em}{0ex}}]0,\delta [, which is a contradiction. Now suppose that \stackrel{\u02c6}{t}\in \phantom{\rule{0.2em}{0ex}}]0,1[. We have u(\stackrel{\u02c6}{t})<0 and {u}^{\prime}(\stackrel{\u02c6}{t})=0 and condition (6) yields again a contradiction. Hence we conclude that u\ge 0 in [0,1]. In a completely similar way we prove that u\le \frac{b}{a} in [0,1].
Next, in order to prove that
for all t\in [0,1[, it is sufficient to note that, if u(\stackrel{\u02c6}{t})={u}^{\prime}(\stackrel{\u02c6}{t})=0 for some \stackrel{\u02c6}{t}\in [0,1[, then (6) would yield {u}^{\u2033}(\stackrel{\u02c6}{t})<0, which is impossible. Moreover, as the constant function \frac{b}{a} is a solution of the equation in (4), the uniqueness of solutions for any Cauchy problem associated with this equation implies that
for all t\in [0,1].
Step 2. Proof of (ii). As {u}^{\prime}(0)=0, assertion (i) implies that there exists \delta >0 such that {u}^{\u2033}(t)<0 for all t\in [0,\delta [ and {u}^{\prime}(t)<0 for all t\in \phantom{\rule{0.2em}{0ex}}]0,\delta [. Let us show that
for all t\in \phantom{\rule{0.2em}{0ex}}]0,1]. If this is not the case, set \stackrel{\u02c6}{t}=min\{t\in \phantom{\rule{0.2em}{0ex}}]0,1]:{u}^{\prime}(t)=0\}. Then, by (6), we have {u}^{\u2033}(\stackrel{\u02c6}{t})<0 and hence there exists \eta >0 such that {u}^{\prime}(t)>{u}^{\prime}(\stackrel{\u02c6}{t})=0, for all t\in \phantom{\rule{0.2em}{0ex}}]\stackrel{\u02c6}{t}\eta ,\stackrel{\u02c6}{t}[, which contradicts the definition of \stackrel{\u02c6}{t}.
Let us now prove that
in [0,1]. By contradiction, assume that there exists \overline{t}\in \phantom{\rule{0.2em}{0ex}}]0,1] such that {u}^{\u2033}(\overline{t})>0. As {u}^{\u2033}(0)<0, there exist {t}_{0}\in \phantom{\rule{0.2em}{0ex}}]0,\overline{t}[ and \delta >0 such that {u}^{\u2033}({t}_{0})=0 and {u}^{\u2033}(t)>0 for all t\in \phantom{\rule{0.2em}{0ex}}]{t}_{0},{t}_{0}+\delta [. Since we have {u}^{\prime}(t){u}^{\u2033}(t)<0 for all t\in \phantom{\rule{0.2em}{0ex}}]{t}_{0},{t}_{0}+\delta [, the function b{(1+{u}^{\prime 2})}^{\frac{1}{2}} is decreasing in ]{t}_{0},{t}_{0}+\delta [. We also know that the function au is decreasing in [0,1]. Hence the function aub{(1+{u}^{\prime 2})}^{\frac{1}{2}} is decreasing in ]{t}_{0},{t}_{0}+\delta [. On the other hand, as {u}^{\u2033}({t}_{0})=0, from the equation in (4) we get
and therefore
for all t\in \phantom{\rule{0.2em}{0ex}}]{t}_{0},{t}_{0}+\delta [. Then the equation in (4) yields {u}^{\u2033}(t)<0 for all t\in \phantom{\rule{0.2em}{0ex}}]{t}_{0},{t}_{0}+\delta [, which is a contradiction.
Step 3. Proof of (iii). Since by assertion (i) u\ge 0 in [0,1], we get f(u,{u}^{\prime})\ge b(1+{u}^{\prime 2}) in [0,1], and then, from the equation in (4), we conclude that
in [0,1]. Multiplying by {u}^{\prime}, where {u}^{\prime}\le 0 in [0,1] by assertion (ii), and integrating between 0 and 1, we obtain
On the one hand, using the boundary condition {u}^{\prime}(0)=0 we have
On the other hand, the boundary condition u(1)=0 and assertion (i) imply
In conclusion, setting
we get {u}^{\prime}(1)>R. Since {u}^{\prime} is nonincreasing, we conclude
for all t\in [0,1]. □
We are now in position to prove the existence of a unique solution of problem (1), which is linearly stable.
Theorem 2.2 Let a>0 and b>0 be given. Then there exists a unique solution u of (1) and it satisfies the conditions (i), (ii), and (iii). Further, u is linearly stable as an equilibrium of the parabolic problem
Proof The proof is divided into three steps.
Step 1. Existence. Let us prove that there exists at least one solution of (1), or equivalenty of (4). Let \mathfrak{K}:{C}^{0}([0,1])\to {C}^{1}([0,1]) be the operator which associates with any h\in {C}^{0}([0,1]) the unique solution w of
Clearly, is completely continuous. Moreover, let \mathfrak{F}:{C}^{1}([0,1])\to {C}^{0}([0,1]) be the Nemitski operator associated with f, i.e., \mathfrak{F}(w)=f(w,{w}^{\prime}) for any w\in {C}^{1}([0,1]). The operator is continuous and maps bounded sets into bounded sets. Introduce the open bounded subset of {C}^{1}([0,1])
Finally, define a completely continuous operator \mathfrak{T}:\overline{\mathcal{Q}}\to {C}^{1}([0,1]) by \mathfrak{T}=\mathfrak{K}\circ \mathfrak{F}. The fixed points of are precisely the solutions of (4).
An inspection of the assertions of Lemma 2.1 shows that, if u\in \overline{\mathcal{Q}} satisfies, for some \lambda \in [0,1],
i.e.,
then u\in \mathcal{Q}. The invariance property of the degree under homotopy implies that
where ℑ stands for the identity operator. Therefore there exists a fixed point u\in \mathcal{Q} of , which is a solution of (4).
By Lemma 2.1, u satisfies the conditions (i), (ii), and (iii).
Step 2. Uniqueness. Set \mathrm{\Phi}=\mathfrak{I}\mathfrak{T}. As the function f:{\mathbb{R}}^{2}\to \mathbb{R} is of class {C}^{1}, the operators \mathfrak{F}:{C}^{1}([0,1])\to {C}^{0}([0,1]) and, hence, \mathrm{\Phi}:{C}^{1}([0,1])\to {C}^{1}([0,1]) are of class {C}^{1}, with Fréchet differentials
for any given u\in {C}^{1}([0,1]) and all w\in {C}^{1}([0,1]).
Observe that, for any u\in {C}^{1}([0,1]), {\mathrm{\Phi}}^{\prime}(u) is invertible. Indeed, let us fix u\in {C}^{1}([0,1]) and assume that {\mathrm{\Phi}}^{\prime}(u)w=0 for some w\in {C}^{1}([0,1]). This means that w is the solution of
Since
for all (s,\xi )\in {\mathbb{R}}^{2}, the maximum principle [[5], Appendix, Theorem 5.2] implies that w=0. Hence the local inversion theorem applies to Φ at every point u\in {C}^{1}([0,1]) and thus any fixed point of is isolated. The compactness in {C}^{1}([0,1]) of the set of all fixed points of then implies that is finite, i.e., \mathcal{S}=\{{u}_{1},\dots ,{u}_{N}\} for some positive integer N.
Denote by B(u,r) the open ball in {C}^{1}([0,1]) centered at u and having radius r. Pick r>0 so small that B({u}_{k},r)\subseteq \mathcal{Q} for all k\in \{1,\dots ,N\}, and B({u}_{i},r)\cap B({u}_{j},r)=\mathrm{\varnothing} for all i,j\in \{1,\dots ,N\}, with i\ne j. The excision and the additivity properties of the degree yield
where, for each k\in \{1,\dots ,N\},
denotes the fixed point index of {u}_{k}. Using again (15), we see as above that, for any given u\in {C}^{1}([0,1]) and all \mu >0, the problem
has no nontrivial solution w. Accordingly, for any given u\in {C}^{1}([0,1]), the operator {\mathfrak{T}}^{\prime}(u) does not have any eigenvalue \mu >0. Therefore, we infer from [[12], Theorem 3.20] that
for all k\in \{1,\dots ,N\}. Finally, by (13), (16), and (17) we conclude that N=1, i.e., there is a unique solution u of problem (4).
Step 3. Linear stability. The solution u of (4) is an equilibrium of the parabolic problem (11), in particular, it is a 1periodic solution of (11). In order to show that u is linearly stable, and hence locally exponentially asymptotically stable, it is enough, after a standard cutoff argument, to show that the eigenvalue problem
does not have any eigenvalue \mu \le 0 (see, e.g., [[13], Chapter III.23]), or [[14], Chapter V.22]). Indeed, if w is a solution of (18) for some \mu \le 0, then using again condition (15), together with the interior form of the parabolic maximum principle and the Hopf boundary point lemma (see, e.g., [[14], Chapter III.13]), we conclude that w=0. □
Monotone approximation and order stability
In this section we discuss approximation and stability of the solution of (1), or equivalently of (4). To this end, we define a linear iterative scheme that allows one to construct an increasing sequence of strict lower solutions and a decreasing sequence of strict upper solutions of (4) which converge in {C}^{2}([0,1]) to the unique solution u of (4), that is, of (1). Then, according to [11, 13], we see that u is strictly order stable from above and from below and hence it is (Lyapunov) asymptotically stable as an equilibrium of the parabolic problem (11). In addition, the converging sequences of lower and upper solutions provide explicitly computable estimates of the basin of attractivity of the solution.
Lower and upper solutions Let us consider the problem
where g:[0,1]\times \mathbb{R}\times \mathbb{R}\to \mathbb{R} is locally Lipschitz continuous. A lower solution of (19) is a function \alpha \in {C}^{2}([0,1]) which satisfies
Similarly an upper solution of (19) is a function \beta \in {C}^{2}([0,1]) which satisfies
Remark 2.1 The Lipschitz character of g implies (see [[5], Chapter 3, Proposition 1.7, Proposition 2.7]) that a lower solution α of (19), which is not a solution, is a strict lower solution, that is, any solution u of (19), such that u\ge \alpha, satisfies u\gg \alpha in [0,1]. Similarly, an upper solution β of (19), which is not a solution, is a strict upper solution, that is, any solution u of (19), such that u\le \beta, satisfies u\ll \beta in [0,1].
Remark 2.2 Any constant \alpha \le 0 is a strict lower solution of (4) and any constant \beta \ge \frac{b}{a} is a strict upper solution of (4). In particular, one can choose \alpha =0 and \beta =\frac{b}{a}. We wish to point out that, with this choice of lower and upper solutions, the existence of at least one solution u of problem (4) between α and β can be alternatively achieved by applying [[5], Chapter 2, Theorem 3.1]; the relevant observations being here the facts that {u}^{\prime}(0)=0, {u}^{\prime}(1)\le 0 and f satisfies the onesided Nagumo condition
for all (s,\xi )\in {\mathbb{R}}^{2} such that 0\le s\le \frac{b}{a}. We point out that onesided Nagumo conditions were introduced for the first time by Kiguradze in [15].
Let us consider the following modified problem:
Here \stackrel{\u02c6}{f}:{\mathbb{R}}^{2}\to \mathbb{R} is defined as follows. We first introduce an auxiliary function \tilde{f} by setting, for all (s,\xi )\in {\mathbb{R}}^{2},
where R is defined in (10). Then we set, for all (s,\xi )\in {\mathbb{R}}^{2},
The function \stackrel{\u02c6}{f} is locally Lipschitz continuous and satisfies the following conditions:
(h_{1}) there exists \stackrel{\u02c6}{a}>0 such that
holds for all ({s}_{1},\xi ),({s}_{2},\xi )\in {\mathbb{R}}^{2} , with {s}_{1}\le {s}_{2} ;
(h_{2}) there exists N>0 such that
holds for all (s,{\xi}_{1}),(s,{\xi}_{2})\in {\mathbb{R}}^{2} .
We can choose \stackrel{\u02c6}{a}=a{(1+{R}^{2})}^{3/2} in (h_{1}) and N=max\{b\sqrt{1+{R}^{2}},bR(2+3\sqrt{1+{R}^{2}})\} in (h_{2}).
Remark 2.3 Any constant \alpha \le 0 and any constant \beta \ge \frac{b}{a} are, respectively, a strict lower and a strict upper solution of (21) too.
Lemma 2.3 A function u\in {C}^{2}([0,1]) is a solution of (21) if and only if it is a solution of (1).
Proof Let u be a solution of (21). In order to prove that u is also a solution of (1), or equivalently of (4), it is sufficient to show that u satisfies 0\le u\le \frac{b}{a} and R\le {u}^{\prime}\le 0 in [0,1].
The function \stackrel{\u02c6}{f} satisfies the following conditions:
and
It can be verified, proceeding as in the proof of Lemma 2.1 and using the maximum principle, that 0\le u\le \frac{b}{a} and hence 0\ll u\ll \frac{b}{a} in [0,1].
Next we prove that R\le {u}^{\prime}\le 0 in [0,1]. The proof of assertion (ii) in Lemma 2.1 can be repeated verbatim in order to show that {u}^{\prime}(t)<0 for all t\in \phantom{\rule{0.2em}{0ex}}]0,1] and {u}^{\u2033}\le 0 in [0,1]. Assume now that there exists {t}_{0}\in \phantom{\rule{0.2em}{0ex}}]0,1] such that {u}^{\prime}({t}_{0})=R. In particular, we have R\le {u}^{\prime}\le 0 in [0,{t}_{0}] and {u}^{\prime}\le R in [{t}_{0},1]. By definition of \stackrel{\u02c6}{f}, u satisfies
in [0,{t}_{0}] and
in [{t}_{0},1]. As u\ge 0 and {u}^{\prime}\le 0 in [0,1], we easily get from (23)
From (24), using again u\ge 0 and {u}^{\prime}\le 0 in [0,1], we obtain
and hence
in [{t}_{0},1]. Since
in [{t}_{0},1] and {u}^{\prime}{u}^{\u2033}\ge 0 in [0,1], we finally get from (26)
Combining (25) and (27) yields
which is precisely (9) in Step 3 of the proof of Lemma 2.1. As there we conclude that {u}^{\prime}\ge R in [0,1]. Accordingly, u is a solution of (4).
Conversely, the definition of \stackrel{\u02c6}{f} implies that any solution of (1), or equivalently of (4), is a solution of (21) as well. □
Let us consider the following auxiliary linear problem:
Here, h:[0,1]\to \mathbb{R} is a continuous function and L>0 and m\in \mathbb{R} are given constants. Notice that problem (28) has a unique solution w\in {C}^{2}([0,1]). The following result is inspired from [9] and [[10], Chapter 5].
Lemma 2.4 There exists {L}_{0}>0 such that for all L\ge {L}_{0}, for all h\in {C}^{0}([0,1]), with h\le 0 in [0,1], and for all m\ge 0, the solution w of (28) satisfies
In addition, if h<0 in [0,1] or m>0, then
Proof Let us denote by {w}_{1} and {w}_{2} the respective solutions of
and
Step 1. The functions {w}_{1} and {w}_{2} satisfy
and
A simple computation yields
where
The conclusion then easily follows by direct calculations.
Step 2. There exists {L}_{0}>0 such that, for any L\ge {L}_{0}, the following inequalities hold:
and
Let us first show that (37) holds. We have, for all t\in [0,1],
Since {c}_{1}<1 and {c}_{2}<0, we can conclude that, for any L>0 sufficiently large, {W}_{1}(t)<0 for all t\in [0,1]. Namely, if we set
and we take L\ge {L}_{0}, we have
Moreover, since {L}_{0}>\stackrel{\u02c6}{a}, the inequality
holds as well. This yields the validity of (37).
As for (38), by the sign properties of {w}_{2} and {w}_{2}^{\prime}, we see that {W}_{2}(t)<0 for all t\in [0,1] provided that L>max\{\stackrel{\u02c6}{a},{N}^{2}\}: this condition holds as {L}_{0}>max\{\stackrel{\u02c6}{a},{N}^{2}\}.
Fix now L\ge {L}_{0}, h\in {C}^{0}([0,1]), with h\le 0 in [0,1], and m\ge 0. Let w be the solution of problem (28). If h=0 in [0,1] and m=0, then (29) trivially follows. Therefore suppose that h<0 in [0,1] or m>0. We can express w as
for all t\in [0,1]. Inequality (29) now reads
for t\in [0,1]. The sign properties of {w}_{1}, {w}_{2}, {W}_{1}, {W}_{2} and the assumptions on h and m immediately yield (30). □
We introduce now a linear monotone iterative scheme for approximating the solution of (1); namely, we define by recurrence two sequences {({\alpha}_{n})}_{n}, and {({\beta}_{n})}_{n} as follows:

let {\alpha}_{0} be any constant, with {\alpha}_{0}\le 0 , and, for n\in \mathbb{N} , let {\alpha}_{n+1} be the solution of
\{\begin{array}{c}{\alpha}_{n+1}^{\u2033}+\sqrt{L}{\alpha}_{n+1}^{\prime}L{\alpha}_{n+1}=\stackrel{\u02c6}{f}({\alpha}_{n},{\alpha}_{n}^{\prime})+\sqrt{L}{\alpha}_{n}^{\prime}L{\alpha}_{n}\phantom{\rule{1em}{0ex}}\mathit{\text{in}}[0,1],\hfill \\ {\alpha}_{n+1}^{\prime}(0)={\alpha}_{n+1}(1)=0,\hfill \end{array}(41) 
let {\beta}_{0} be any constant, with {\beta}_{0}\ge \frac{b}{a} , and, for n\in \mathbb{N} , let {\beta}_{n+1} be the solution of
\{\begin{array}{c}{\beta}_{n+1}^{\u2033}+\sqrt{L}{\beta}_{n+1}^{\prime}L{\beta}_{n+1}=\stackrel{\u02c6}{f}({\beta}_{n},{\beta}_{n}^{\prime})+\sqrt{L}{\beta}_{n}^{\prime}L{\beta}_{n}\phantom{\rule{1em}{0ex}}\mathit{\text{in}}[0,1],\hfill \\ {\beta}_{n+1}^{\prime}(0)={\beta}_{n+1}(1)=0.\hfill \end{array}(42)
Theorem 2.5 Let a>0 and b>0 be given. Then there exists {L}_{0}>0, given by (39), such that for any L\ge {L}_{0} the sequences {({\alpha}_{n})}_{n} and {({\beta}_{n})}_{n} recursively defined in (41) and (42), respectively, converge in {C}^{2}([0,1]) to the unique solution u of (21) and hence of (1). In addition, for each n\in \mathbb{N} the following conditions hold:

{\alpha}_{n}is a strict lower solution and{\beta}_{n}is a strict upper solution of (21), and

{\alpha}_{n}\ll {\alpha}_{n+1}\ll u\ll {\beta}_{n+1}\ll {\beta}_{n}in[0,1].
Proof Let us fix L\ge {L}_{0}, where {L}_{0} is given by (39).
Step 1. The sequence {({\alpha}_{n})}_{n} is such that, for each n\in \mathbb{N}, {\alpha}_{n}\ll {\alpha}_{n+1} in [0,1] and {\alpha}_{n} is a strict lower solution of (21).
The proof is done by induction. Define, for each n\in \mathbb{N}, {u}_{n+1}={\alpha}_{n+1}{\alpha}_{n}. The function {u}_{1} satisfies
Notice that \stackrel{\u02c6}{f}({\alpha}_{0},{\alpha}_{0}^{\prime}){\alpha}_{0}^{\u2033}<0 in [0,1]. Hence the maximum principle implies that {u}_{1}\gg 0, that is, {\alpha}_{0}\ll {\alpha}_{1}, in [0,1]. Now, let us show that {\alpha}_{1} is a strict lower solution of (21). Using the definition of {\alpha}_{1}, together with conditions (h_{1}) and (h_{2}), we get
in [0,1]. Since {u}_{1} is a solution of (43), which is of the form of (28), with h=\stackrel{\u02c6}{f}({\alpha}_{0},{\alpha}_{0}^{\prime}){\alpha}_{0}^{\u2033}<0 in [0,1] and m\ge 0, Lemma 2.4 applies and yields
for all t\in [0,1]. From (44), (45) and from the boundary conditions {\alpha}_{1}^{\prime}(0)={\alpha}_{1}(1)=0, we conclude that {\alpha}_{1} is a strict lower solution of (21).
Assume now that, for some integer n\ge 1, {\alpha}_{n} is strict lower solution of (21) satisfying the boundary conditions. The function {u}_{n+1} satisfies
As {\alpha}_{n} is strict and satisfies the boundary conditions, we have \stackrel{\u02c6}{f}({\alpha}_{n},{\alpha}_{n}^{\prime}){\alpha}_{n}^{\u2033}<0 in [0,1]. Hence the maximum principle yields {u}_{n+1}\gg 0, i.e., {\alpha}_{n}\ll {\alpha}_{n+1} in [0,1]. Finally, {\alpha}_{n+1} satisfies
in [0,1]. Since {u}_{n+1} is the solution of problem (46), which is of the form of (28), with h=\stackrel{\u02c6}{f}({\alpha}_{n},{\alpha}_{n}^{\prime}){\alpha}_{n}^{\u2033}<0 in [0,1] and m=0, Lemma 2.4 applies and yields
for all t\in [0,1]. From (47), (48), and from the boundary conditions {\alpha}_{n+1}^{\prime}(0)={\alpha}_{n+1}(1)=0, we conclude that {\alpha}_{n+1} is a strict lower solution of (21), such that \stackrel{\u02c6}{f}({\alpha}_{n+1},{\alpha}_{n+1}^{\prime}){\alpha}_{n+1}^{\u2033}<0 in [0,1].
In a similar way, one can prove the following conclusion.
Step 2. The sequence {({\beta}_{n})}_{n} is such that, for each n\in \mathbb{N}, {\beta}_{n+1}\ll {\beta}_{n} in [0,1] and {\beta}_{n} is a strict upper solution of (21).
Step 3. We have, for each n\in \mathbb{N}, {\alpha}_{n}\ll {\beta}_{n} in [0,1].
For each n\in \mathbb{N}, let us set
where, clearly, {z}_{n+1} and {h}_{n} satisfy
By construction, we have {z}_{0}\gg 0 in [0,1] and
As L\ge {L}_{0}>\stackrel{\u02c6}{a}>a, we conclude that {h}_{0}(t)<0 for all t\in [0,1].
Take now any n\in \mathbb{N} and suppose that {z}_{n}\gg 0 and {h}_{n}<0 in [0,1]. From (49) we infer, using the maximum principle, that {z}_{n+1}\gg 0 in [0,1]. Let us prove that {h}_{n+1}<0 in [0,1]. We easily see that
in [0,1]. As {z}_{n+1} is the solution of problem (49), which is of the form of (28), with h={h}_{n}<0 in [0,1] and m=0, Lemma 2.4 applies and yields
and hence {h}_{n+1}(t)<0 for all t\in [0,1]. The conclusion {z}_{n}\gg 0, i.e., {\alpha}_{n}\ll {\beta}_{n}, in [0,1] for all n\in \mathbb{N}, then follows by induction.
Step 4. There exists C>0 such that, for all n\in \mathbb{N},
We know that {\alpha}_{1}\le {\alpha}_{n}\le {\beta}_{n}\le {\beta}_{1} in [0,1] for all n\ge 1, with {\alpha}_{1}(1)=0={\beta}_{1}(1). Hence we get
for all n\ge 1. Let us set B={\beta}_{1}^{\prime}(1).
Suppose, by contradiction, that (51) does not hold, i.e., for every C>B there exists j=j(C)\in \mathbb{N} such that {\parallel {\alpha}_{j}^{\prime}\parallel}_{\mathrm{\infty}}>C or {\parallel {\beta}_{j}^{\prime}\parallel}_{\mathrm{\infty}}>C. Assume that the former eventuality occurs. By Step 1, using conditions (h_{1}) and (h_{2}), we get
in [0,1]. Suppose that {max}_{[0,1]}{\alpha}_{j}^{\prime}>C. Since {\alpha}_{j}^{\prime}(0)=0, there exists {t}_{C}\in \phantom{\rule{0.2em}{0ex}}]0,1[ such that {\alpha}_{j}^{\prime}({t}_{C})=C. Let {t}_{B}\in \phantom{\rule{0.2em}{0ex}}]{t}_{C},1] be such that {\alpha}_{j}^{\prime}({t}_{B})=B and {\alpha}_{j}^{\prime}(t)\in \phantom{\rule{0.2em}{0ex}}]B,C[ for all t\in \phantom{\rule{0.2em}{0ex}}]{t}_{C},{t}_{B}[. From (53) we infer
The righthand side of (54) diverges as C\to +\mathrm{\infty}, then a contradiction follows.
In a completely similar way, we achieve the conclusion if {min}_{[0,1]}{\alpha}_{j}^{\prime}<C, or if {\parallel {\beta}_{j}^{\prime}\parallel}_{\mathrm{\infty}}>C.
Step 5. The sequence {({\alpha}_{n})}_{n} converges in {C}^{2}([0,1]) to the solution u of (1).
It follows from the previous steps that the sequence {({\alpha}_{n})}_{n} is increasing and bounded in {C}^{2}([0,1]). Therefore there exists a function u:[0,1]\to \mathbb{R} which is the pointwise limit of {({\alpha}_{n})}_{n} in [0,1]; in particular, {\alpha}_{n}\ll u in [0,1] for all n\in \mathbb{N}. Moreover, by the ArzelàAscoli theorem, any subsequence {({\alpha}_{{n}_{l}})}_{l} of {({\alpha}_{n})}_{n} admits a subsequence which is convergent in {C}^{1}([0,1]) to u. Then the whole sequence {({\alpha}_{n})}_{n} converges in {C}^{1}([0,1]) to u. From the equation in (41) we see that the convergence takes place in {C}^{2}([0,1]). Hence u is a solution of problem (21) and, by Lemma 2.3 and Theorem 2.2, it is in fact the unique solution of problem (1).
In a similar way, one can prove the following conclusion.
Step 6. The sequence {({\beta}_{n})}_{n} converges in {C}^{2}([0,1]) to the solution u of (1).
Thus the proof is completed. □
Corollary 2.6 Let a>0 and b>0 be given. Then the unique solution u of (21) is (Lyapunov) globally asymptotically stable as an equilibrium of the parabolic problem
Proof Let us note that any lower, respectively upper, solution of (21) is a lower, respectively upper, solution of the parabolic problem
Arguing as in the proof of Theorem 2.2 we see that u is the unique solution of (56). Then Theorem 2.5 implies that u is strictly order stable from below and from above. Actually, since any constant {\alpha}_{0}\le 0 is a strict lower solution and any constant {\beta}_{0}\ge \frac{b}{a} is a strict upper solution of (56), the results in [[11], Section 2.6] imply that u is (Lyapunov) globally asymptotically stable as a solution of (56) and hence as an equilibrium of (55). □
Remark 2.4 The definition of \stackrel{\u02c6}{f} implies that the solution u of (1) is strictly order stable from below and from above and (Lyapunov) asymptotically stable as an equilibrium of the parabolic problem (11).
Numerical experiments
We present here some experiments concerning the numerical approximation of the solution of problem (1), for the same choice a=b=1 of the parameters as in [1].
The iterative scheme in case L\ge {L}_{0} We have computed various approximations, at different precision levels, of the unique solution u of problem (1) by implementing in MatLab the linear iterative scheme defined by (41) and (42); at each step of the iteration the resulting linear equations have been solved using the bvp4c routine with a 100point grid. We have chosen L={L}_{0}, with {L}_{0}=1,828.5 given by (39), {\alpha}_{0}=0 and {\beta}_{0}=\frac{b}{a}=1. Theorem 2.5 guarantees that the approximating sequences {({\alpha}_{n})}_{n} and {({\beta}_{n})}_{n} are constituted by lower and upper solutions and monotonically converge to u, in an increasing or decreasing fashion, respectively; thus, for each n, the couple {\alpha}_{n}, {\beta}_{n} brackets the solution u, thus providing lower and upper estimates. In what follows the {L}^{\mathrm{\infty}}norm of a given function is intended to have been computed as the {L}^{\mathrm{\infty}}norm of its discretization on the given grid. We have denoted by {n}_{k} the minimum number of iterations needed in order that {\parallel {\beta}_{{n}_{k}}{\alpha}_{{n}_{k}}\parallel}_{\mathrm{\infty}}<{10}^{k} for k\in \{1,2,3\}; the corresponding values are {n}_{1}=1,421, {n}_{2}=2,788 and {n}_{3}=4,155. In Table 1 we have tabulated {\alpha}_{{n}_{k}}, {\beta}_{{n}_{k}}, for k\in \{1,2,3\}, at the mesh points t\in \{0,0.2,0.4,0.6,0.8,1\}; the graphs of {\alpha}_{{n}_{k}}, {\beta}_{{n}_{k}} are displayed in Figure 1; whereas Figure 2 describes the rate of decay of {\parallel {\beta}_{n}{\alpha}_{n}\parallel}_{\mathrm{\infty}}, as well as of the errors {\parallel {\alpha}_{n}u\parallel}_{\mathrm{\infty}} and {\parallel {\beta}_{n}u\parallel}_{\mathrm{\infty}}, plotted against the number n of iterations. Here u denotes a reference approximation of the solution of (1), calculated using the same scheme up to a precision of 10^{−5}. Although the lower solutions {\alpha}_{n} converge slightly faster than the upper solutions {\beta}_{n}, it is evident that the monotone iterative scheme defined by (41) and (42) turns out to be extremely slow.
The iterative scheme in case L\in [0,{L}_{0}[ We start from the obvious observation that the iterative scheme given by (41) and (42) is well defined for any fixed L\ge 0; hence it is clear that, if the resulting sequences {({\alpha}_{n})}_{n} and {({\beta}_{n})}_{n} are Cauchy sequences in {C}^{1}([0,1]), then, by the uniqueness of the solution of (1), they converge in {C}^{2}([0,1]) to u. Of course, if L<{L}_{0} we cannot anymore guarantee that either {\alpha}_{n} is a lower solution, or {\beta}_{n} is an upper solution, or the sequences {({\alpha}_{n})}_{n} and {({\beta}_{n})}_{n} enjoy any monotonicity property. Let us take {\alpha}_{0}=0 in (41) and let {({\alpha}_{n})}_{n} be the sequence of iterates obtained for some given L\ge 0. The numerical experiments, we have performed for several different choices of L\in [0,{L}_{0}[, show that the sequence {({\alpha}_{n})}_{n} converges to u, but the magnitude of L strongly affects the speed of convergence; namely, as L decreases, the required number of iterations n in order that {\parallel {\alpha}_{n}u\parallel}_{\mathrm{\infty}} goes beneath a prescribed threshold, decreases. In particular, the speed of convergence significantly increases as L approximates 1 and, for this choice of L, it becomes comparable even with the speed of Newton’s method. Indeed, if we fix an error tolerance of 10^{−3}, the iterative scheme defined by (41), with L=1 and {\alpha}_{0}=0, converges in 4 iterations, whereas Newton’s method, starting from {\alpha}_{0}=0 too, converges in 2 iterations: these results are displayed in Tables 2 and 3. This computational remark suggests the possibility of using the iterative scheme also in case the condition L\ge {L}_{0} fails; however, its convergence properties should be theoretically analyzed.
A comparison between the solutions of (1) and (3) Here we present a numerical comparison between the solution u of the fully nonlinear problem (1) and the solution \tilde{u} of the partially linearized problem (3) investigated in [1]. We have approximated u by the lower solution obtained by implementing the monotone iterative scheme given by (41), with {\alpha}_{0}=0, L={L}_{0} and stopping criterion {\parallel {\beta}_{n}{\alpha}_{n}\parallel}_{\mathrm{\infty}}<{10}^{5}. An approximation of \tilde{u}, matching the one obtained in [1], has been calculated using the bvp4c routine of MatLab with a 100point grid. Table 4 reports the values of u and \tilde{u} at the mesh points t\in \{0,0.2,0.4,0.6,0.8,1\} and Figure 3 displays the graphs of u and \tilde{u}.
References
Okrasiński W, Płociniczak Ł: A nonlinear mathematical model of the corneal shape. Nonlinear Anal., Real World Appl. 2012, 13: 14981505. 10.1016/j.nonrwa.2011.11.014
Okrasiński W, Płociniczak Ł: Bessel function model for corneal topography. Appl. Math. Comput. 2011, 223: 436443.
Okrasiński W, Płociniczak Ł: Regularization of an illposed problem in corneal topography. Inverse Probl. Sci. Eng. 2013, 21: 10901097. 10.1080/17415977.2012.753443
Płociniczak Ł, Okrasiński W, Nieto JJ, Domínguez O: On a nonlinear boundary value problem modeling corneal shape. J. Math. Anal. Appl. 2014, 414: 461471. 10.1016/j.jmaa.2014.01.010
De Coster C, Habets P: TwoPoint Boundary Value Problems: Lower and Upper Solutions. Elsevier, Amsterdam; 2006.
Le VK: On a subsupersolution method for the prescribed mean curvature problem. Czechoslov. Math. J. 2008, 58: 541560. 10.1007/s1058700800347
Obersnel F, Omari P: Existence and multiplicity results for the prescribed mean curvature equation via lower and upper solutions. Differ. Integral Equ. 2009, 22: 853880.
Obersnel F, Omari P, Rivetti S: Existence, regularity and stability properties of periodic solutions of a capillarity equation in the presence of lower and upper solutions. Nonlinear Anal., Real World Appl. 2012, 13: 28302852. 10.1016/j.nonrwa.2012.04.012
Cherpion M, De Coster C, Habets P: A constructive monotone iterative method for secondorder BVP in the presence of lower and upper solutions. Appl. Math. Comput. 2001, 123: 7591. 10.1016/S00963003(00)000588
Cherpion, M: La Méthode des Sous et SurSolutions: Itérations Monotones et Problèmes Singuliers. Ph.D. thesis, Université Catholique de Louvain, LouvainlaNeuve (2002)
De Coster C, Obersnel F, Omari P: A qualitative analysis, via lower and upper solutions, of first order periodic evolutionary equations with lack of uniqueness. III. In Handbook of Differential Equations: Ordinary Differential Equations. Edited by: Canada A, Drábek P, Fonda A. Elsevier/NorthHolland, Amsterdam; 2006:203339.
Ambrosetti A, Malchiodi A: Nonlinear Analysis and Semilinear Elliptic Problem. Cambridge University Press, New York; 2007.
Hess P: PeriodicParabolic Boundary Value Problems and Positivity. Longman, Harlow; 1991.
Daners D, Koch Medina P: Abstract Evolution Equations, Periodic Problems and Applications. Longman, Harlow; 1992.
Kiguradze IT: A priori estimates for the derivatives of bounded functions satisfying secondorder differential inequalities. Differ. Uravn. 1967, 3: 10431052.
Acknowledgements
This paper was written under the auspices of INdAMGNAMPA. The first named author has been supported by Fundação para a Ciência e a Tecnologia (SFRH/BD/61484/2009). The last two named authors have been supported by Università di Trieste, in the frame of the FRA projects ‘Equazioni differenziali ordinarie: aspetti qualitativi e numerici’ and ‘Nonlinear Ordinary Differential Equations: Qualitative Theory, Numerics and Applications’. They also wish to thank Igor Moret for some useful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Coelho, I., Corsato, C. & Omari, P. A onedimensional prescribed curvature equation modeling the corneal shape. Bound Value Probl 2014, 127 (2014). https://doi.org/10.1186/168727702014127
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/168727702014127