1 Introduction
In studies of solutions of various types of nonlinear boundary value problems for ordinary differential equations side by side with numerical methods, it is often used an appropriate technique based upon some types of successive approximations constructed in analytic form. This class of methods includes, in particular, the approach suggested at first in
1
2
for investigation of periodic solutions. Later, appropriate versions of this method were developed for handling more general types of nonlinear boundary value problems for ordinary and functional-differential equations. We refer, e.g., to the books
3
4
5
, the articles
6
7
8
9
10
11
12
, and the series of survey articles
13
for the related references.
According to the basic idea, the given boundary value problem is replaced by the Cauchy problem for a suitably modified system of integro-differential equations containing some artificially introduced parameters. The solution of the perturbed problem is searched in analytic form by successive iterations. The perturbation term, which depends on the original differential equation, on the introduced parameters and on the boundary conditions, yields a system of algebraic or transcendental determining equations. These equations enable us to determine the values of the introduced parameters for which the original and the perturbed problems coincide. Moreover, studying solvability of the approximate determining systems, we can establish existence results for the original boundary value problem.
In this article, we introduce the Chebyshev polynomial version of the known numerical-analytic method based on successive iterations. At the beginning, we follow the ideas presented by Rontó and Rontó
14
and by Rontó and Shchobak
15
, which contains existence results for a system of two nonlinear differential equations with separated boundary conditions. In order to avoid some technical difficulties, we deal in this article, for simplicity, with nonlinear differential equations with homogeneous Dirichlet boundary conditions. On the other hand, our basic recurrence relation has the same general form as it is presented in
15
. In Section 2, we state the studied problem and the corresponding setting. Sections 3 and 4 contain the construction of the sequence of successive approximations, its convergence analysis, the properties of the limit function, and its correspondence to the solution of the original boundary value problem. The existence questions are discussed as well. Main results of the article are in Section 5, which contains a justification of the Chebyshev polynomial version of the introduced method with corresponding convergence analysis and error estimates. Results in Section 5 allow us to construct the Chebyshev polynomial approximations of the solution of the nonlinear boundary value problem, which essentially simplify the computations of successive approximations in analytic form and simplify also the form of the determining equation. In Section 6, we illustrate the applicability of our approach to three Dirichlet boundary value problems: the linear one, the semilinear one, and the quasi-linear one containing the p-Laplace operator. Finally, let us note that presented polynomial version of the numerical-analytic method in this article can be extended to more general nonlinear boundary value problems studied in
14
.
2 Problem setting and preliminaries
We consider the following system of two nonlinear differential equations with Dirichlet boundary conditions
d
x
1
d
t
=
f
1
(
t
,
x
1
,
x
2
)
,
t
∈
(
0
,
T
)
,
d
x
2
d
t
=
f
2
(
t
,
x
1
,
x
2
)
,
x
1
(
0
)
=
x
1
(
T
)
=
0
.
In the vector form, we have
d
x
d
t
=
f
(
t
,
x
)
,
t
∈
(
0
,
T
)
,
A
x
(
0
)
+
C
1
x
(
T
)
=
0
,
where x = col(x
1, x
2), f(t, x) = col(f
1(t, x), f
2(t, x)) and
A
=
1
0
0
0
,
C
1
=
0
0
1
0
.
Let the function f(t, x) be defined and continuous in the domain
[
0
,
T
]
×
D
,
D
=
[
-
a
1
,
a
1
]
×
[
a
2
,
b
2
]
⊂
ℝ
2
.
To avoid dealing with singular matrix C
1 in (2), which does not enable us to express explicitly x(T), it is useful to carry out the following parametrization
x
2
(
T
)
=
λ
,
where
λ
∈
Λ
⊆
[
a
2
,
b
2
]
.
Thus, instead of (2) we use the equivalent problem with two-point parameterized boundary conditions
d
x
d
t
=
f
(
t
,
x
)
,
t
∈
(
0
,
T
)
,
A
x
(
0
)
+
C
x
(
T
)
=
d
(
λ
)
,
x
2
(
T
)
=
λ
,
where
C
=
0
1
1
0
,
d
(
λ
)
=
col(
λ
,
0
)
.
The two-point parameterized boundary conditions in (6) allow us to write
x
(
T
)
=
C
-
1
d
(
λ
)
-
C
-
1
A
x
(
0
)
,
which will be used in the sequel for the construction of the iterative scheme.
Throughout the text, C([0, T], ℝ2) is the Banach space of vector functions with continuous components and L
1([0, T], ℝ2) is the usual Banach space of vector functions with Lebesgue integrable components.
Moreover, the signs |·|, ≤, ≥, max, and min operations will be everywhere understood componentwise. Let us define the vector
δ
D
(
f
)
;
=
1
2
maxf(t,u)
(
t
,
u
)
∈
[
0
,
T
]
×
D
-minf(t,u)
(
t
,
u
)
∈
[
0
,
T
]
×
D
,
for which the following estimate is true (cf.
5
16
)
δ
D
(
f
)
≤
max|f(t,u)|
(
t
,
u
)
∈
[
0
,
T
]
×
D
.
For z ∈ ℝ2 of the form
z
=
co
1
(
0
,
z
2
)
,
z
2
∈
[
a
2
′
,
b
2
′
]
⊆
[
a
2
,
b
2
]
and λ ∈ Λ we define the vector
γ
:
D
×
Λ
→
ℝ
+
2
γ
=
γ
(
z
,
λ
)
:
=
T
2
δ
D
(
f
)
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
,
where I
2 is the unit matrix of order 2. In the sequel, we use the following assumptions.
(A1) The function f : [0, T] × D → ℝ2 is continuous.
(A2) The function f satisfies the following Lipschitz condition: there exists a nonnegative constant square matrix K of order 2 such that
∀
t
∈
[
0
,
T
]
∀
u
,
v
∈
D
:
|
f
(
t
,
u
)
-
f
(
t
,
v
)
|
≤
K
|
u
-
v
|
.
(A3) The subset
D
γ
:
=
{
z
=
col
(
0
,
z
2
)
∈
D
:
B
(
z
,
γ
(
z
,
λ
)
)
⊂
D
for all
λ
∈
Λ
}
is non-empty, where B(z, γ(z, λ)) := {u ∈ ℝ2 : |u - z| ≤ γ(z, λ)}.
(A4) The greatest eigenvalue r(Q) of the non-negative matrix
Q
:
=
3
T
10
K
satisfies the inequality r(Q) < 1.
Remark 1. The history and possible improvements of the constant
3
10
in the definition of Q can be found in
5
17
18
.
We will use the auxiliary sequence {αm
} of continuous functions αm
= αm
(t), t ∈ [0, T], defined by
α
0
(
t
)
:
=
1
,
α
m
+
1
(
t
)
:
=
1
-
t
T
∫
0
t
α
m
(
s
)
d
s
+
t
T
∫
t
T
α
m
(
s
)
d
s
,
m
=
0
,
1
,
2
,
…
It is obvious that, in particular,
α
1
(
t
)
=
1
-
t
T
∫
0
t
d
s
+
t
T
∫
t
T
d
s
=
2
t
1
-
t
T
,
t
∈
[
0
,
T
]
.
According to [
16
, Lemma 4] or [
5
, Lemma 2.4], we have the following estimates
α
m
+
1
(
t
)
≤
3
T
10
α
m
(
t
)
,
m
=
2
,
3
,
…
,
α
m
+
1
(
t
)
≤
10
9
3
T
10
m
α
1
(
t
)
,
m
=
0
,
1
,
2
,
…
3 Successive approximations and convergence analysis
To investigate the solution of the parameterized boundary value problem (6) let us introduce the sequence of functions defined by the recurrence relation
x
m
+
1
(
t
,
z
,
λ
)
:
=
z
+
∫
0
t
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
d
s
-
t
T
∫
0
T
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
d
s
+
t
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
,
where d(λ) = col(λ, 0) and x
0(t, z, λ) = z, z ∈ Dγ
. Let us note that for m = 0, 1, 2, ..., we have xm
(t, z, λ) = col (x
m,1(t, z, λ), x
m,2(t, z, λ)). Moreover, all the functions xm
= xm
(t, z, λ) are continuously differentiable and satisfy the initial condition xm
(0, z, λ) = z as well as the boundary conditions in (6).
Let us establish the uniform convergence of the sequence (14) and the relation of the limit function to the solution of some additively modified boundary value problem.
Theorem 2. Let the assumptions (A1)-(A4) be satisfied. Then for all z ∈ Dγ and λ ∈ Λ, the following statements hold
1. The sequence {xm
} converges uniformly in t ∈ [0, T] to the limit function
x
*
(
t
,
z
,
λ
)
=
lim
m
→
+
∞
x
m
(
t
,
z
,
λ
)
,
which satisfies the initial condition x*(0, z, λ) = z and the boundary conditions in (6).
2. For all t ∈ [0, T], the limit function x* satisfies the identity
x
*
(
t
,
z
,
λ
)
=
z
+
∫
0
t
f
(
s
,
x
*
(
s
,
z
,
λ
)
)
d
s
-
t
T
∫
0
T
f
(
s
,
x
*
(
s
,
z
,
λ
)
)
d
s
+
t
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
.
Moreover, x* is continuously differentiable and it is a unique solution of the Cauchy problem for the additively modified differential equation
d
x
(
t
)
d
t
=
f
(
t
,
x
(
t
)
)
+
1
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
-
1
T
∫
0
T
f
(
s
,
x
(
s
)
)
d
s
,
t
∈
(
0
,
T
)
,
x
(
0
)
=
z
.
3. The following error estimate holds
|
x
*
(
t
,
z
,
λ
)
-
x
m
(
t
,
z
,
λ
)
|
≤
10
9
Q
m
-
1
K
(
I
2
-
Q
)
-
1
γ
α
1
(
t
)
,
t
∈
[
0
,
T
]
.
Remark 3. We emphasize that the first component of the vector z is fixed and coincide with the value of x
1(0) in the first boundary condition in (1), while its second component z
2 is considered as free parameter. Thus, the expression "for all z", actually means "for all z
2".
Proof (of Theorem 2). First, we show that for all (t, z, λ) ∈ [0, T] × Dγ
× Λ and m ∈ ℕ, all functions xm
= xm
(t, z, λ) belong to D. Indeed, using the estimate in [
19
, Lemma 2], an arbitrary continuous function u : [0, T] → ℝ satisfies
∫
0
t
u
(
s
)
-
1
T
∫
0
T
u
(
τ
)
d
τ
d
s
≤
1
2
α
1
(
t
)
max
t
∈
[
0
,
T
]
u
(
t
)
-
min
t
∈
[
0
,
T
]
u
(
t
)
.
Thus, we have
|
x
1
(
t
,
z
,
λ
)
-
x
0
(
t
,
z
,
λ
)
|
=
|
x
1
(
t
,
z
,
λ
)
-
z
|
≤
∫
0
t
f
(
s
,
z
)
-
1
T
∫
0
T
f
(
τ
,
z
)
d
τ
d
s
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
≤
α
1
(
t
)
δ
D
(
f
)
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
≤
T
2
δ
D
(
f
)
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
=
γ
.
Therefore, we conclude that x
1(t, z, λ) ∈ D, whenever (t, z, λ) ∈ [0, T] × Dγ
× Λ. By induction, we obtain that for all m ∈ ℕ, we have
|
x
m
(
t
,
z
,
λ
)
-
x
0
(
t
,
z
,
λ
)
|
≤
γ
,
i.e., all functions xm
are also contained in D.
For m = 0, 1, 2, ..., let us define
r
m
+
1
(
t
,
z
,
λ
)
:
=
x
m
+
1
(
t
,
z
,
λ
)
-
x
m
(
t
,
z
,
λ
)
.
Due to the assumption (A2), we have
|
r
m
+
1
(
t
,
z
,
λ
)
|
=
1
-
t
T
∫
0
t
[
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
-
f
(
s
,
x
m
-
1
(
s
,
z
,
λ
)
)
]
d
s
-
t
T
∫
t
T
[
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
-
f
(
s
,
x
m
-
1
(
s
,
z
,
λ
)
)
]
d
s
≤
K
1
-
t
T
∫
0
t
r
m
(
s
,
z
,
λ
)
|
d
s
|
+
t
T
∫
t
T
|
r
m
(
s
,
z
,
λ
)
|
d
s
.
Relation (19) yields
|
r
1
(
t
,
z
,
λ
)
|
≤
γ
and thus using (20), we obtain
|
r
2
(
t
,
z
,
λ
)
|
≤
K
1
-
t
T
∫
0
t
γ
d
s
+
t
T
∫
t
T
γ
d
s
=
K
γ
α
1
(
t
)
.
By induction, we obtain for m = 1, 2, ... that
|
r
m
+
1
(
t
,
z
,
λ
)
|
≤
K
m
γ
α
m
(
t
)
.
Using (12) and (13), we have
|
r
m
+
1
(
t
,
z
,
λ
)
|
≤
10
9
3
T
10
K
m
-
1
K
γ
α
1
(
t
)
=
10
9
Q
m
-
1
K
γ
α
1
(
t
)
,
and thus, for all (t, z, λ) ∈ [0, T] × Dγ
× Λ and j, m ∈ ℕ, we obtain
|
x
m
+
j
(
t
,
z
,
λ
)
-
x
m
(
t
,
z
,
λ
)
|
≤
∑
i
=
1
j
|
r
m
+
i
(
t
,
z
,
λ
)
|
≤
10
9
∑
i
=
1
j
Q
m
+
i
-
2
K
γ
α
1
(
t
)
=
10
9
Q
m
-
1
K
∑
i
=
0
j
Q
i
γ
α
1
(
t
)
≤
10
9
Q
m
-
1
K
∑
i
=
0
+
∞
Q
i
γ
α
1
(
t
)
=
10
9
Q
m
-
1
K
(
I
2
-
Q
)
-
1
γ
α
1
(
t
)
.
Due to the assumption (A4), the sequence {Qm
} converges to the zero matrix for m → +∞. Hence, (21) implies that {xm
} is a Cauchy sequence in the Banach space C([0, T], ℝ2) and therefore, the limit function x* = x*(t, z, λ) exists. Passing to the limit for j → +∞ in (21), we obtain the final error estimate (17).
The limit function x* satisfies the initial condition x*(0, z, λ) = z as well as the boundary conditions in (6), since these conditions are satisfied by all functions xm
= xm
(t, z, λ) of the sequence {xm
}. Passing to the limit in the recurrence relation (14) for xm
, we show that the limit function x* satisfies the identity (15). If we differentiate this identity, we obtain that x* is a unique solution of the Cauchy problem (16).
Let us find a relation of the limit function x* = x*(t, z, λ) of the sequence {xm
} and the solution of the parameterized boundary value problem (6). For this purpose, let us define the function Δ : ℝ2 → ℝ2
Δ
(
z
,
λ
)
:
=
1
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
-
1
T
∫
0
T
f
(
s
,
x
*
(
s
,
z
,
λ
)
)
d
s
.
Theorem 4. Let the assumptions (A1)-(A4) be satisfied. The limit function x* of the sequence {xm
} is a solution of the boundary value problem (6) if and only if the value of the vector parameters z ∈ Dγ and λ ∈ Λ are such that
Δ
(
z
,
λ
)
=
0
.
Proof. It is sufficient to apply Theorem 2 and notice that the equation in (16) coincides with the original equation in (6) if and only if the relation Δ(z, λ) = 0 holds.
Remark 5. The function Δ = Δ(z, λ) is called the determining function and the equation Δ(z, λ) = 0 is called the determining equation, because it determines the values of the unknown parameters z ∈ Dγ
and λ ∈ Λ involved in the recurrence relation (14).
4 Properties of the limit function and the existence theorem
Let us investigate some properties of the limit function x* of the sequence {xm
} and the determining function Δ.
Lemma 6. Under the assumptions (A1)-(A4), the limit function x* satisfies the following Lipschitz condition for all t ∈ [0, T], all z, y ∈ Dγ and λ ∈ Λ
|
x
*
(
t
,
z
,
λ
)
-
x
*
(
t
,
y
,
λ
)
|
≤
I
2
+
10
9
α
1
(
t
)
K
(
I
2
-
Q
)
-
1
R
|
z
-
y
|
,
where
R
:
=
sup
t
∈
[
0
,
T
]
|
I
2
-
t
T
(
C
-
1
A
+
I
2
)
|
.
Proof. Using the assumption (A2), we obtain
|
x
1
(
t
,
z
,
λ
)
-
x
1
(
t
,
y
,
λ
)
|
=
(
z
-
y
)
+
∫
0
t
[
f
(
s
,
z
)
-
f
(
s
,
y
)
]
d
s
-
t
T
∫
0
T
[
f
(
s
,
z
)
-
f
(
s
,
y
)
]
d
s
-
t
T
(
C
-
1
A
+
I
2
)
(
z
-
y
)
≤
1
-
t
T
∫
0
t
d
s
+
t
T
∫
0
T
d
s
K
|
z
-
y
|
+
R
|
z
-
y
|
=
[
R
+
α
1
(
t
)
K
]
|
z
-
y
|
.
Similarly, using the above estimate, we have
|
x
2
(
t
,
z
,
λ
)
-
x
2
(
t
,
y
,
λ
)
|
≤
R
+
K
1
-
t
T
∫
0
t
(
R
+
α
1
(
s
)
K
)
d
s
+
K
t
T
∫
t
T
(
R
+
α
1
(
s
)
K
)
d
s
|
z
-
y
|
=
[
R
+
K
R
α
1
(
t
)
+
K
2
α
2
(
t
)
]
|
z
-
y
|
and by induction, we obtain
|
x
m
(
t
,
z
,
λ
)
-
x
m
(
t
,
y
,
λ
)
|
≤
R
+
∑
i
=
1
m
-
1
K
i
R
α
i
(
t
)
+
K
m
α
m
(
t
)
|
z
-
y
|
.
Using the estimates in (13), we get
|
x
m
(
t
,
z
,
λ
)
-
x
m
(
t
,
y
,
λ
)
|
≤
R
+
∑
i
=
0
m
-
2
10
9
K
R
3
T
10
K
i
α
1
(
t
)
+
10
9
K
3
T
10
K
m
-
1
α
1
(
t
)
|
z
-
y
|
and passing to the limit for m → +∞, due to the assumption (A4), we obtain the final inequality
|
x
*
(
t
,
z
,
λ
)
-
x
*
(
t
,
y
,
λ
)
|
≤
R
+
∑
i
=
0
+
∞
10
9
K
R
Q
i
α
1
(
t
)
|
z
-
y
|
,
≤
R
+
10
9
K
R
α
1
(
t
)
(
I
2
-
Q
)
-
1
|
z
-
y
|
.
Lemma 7. Under the assumptions (A1)-(A4), the determining function Δ is well defined and bounded in Dγ
× Λ. Furthermore, it satisfies the following Lipschitz condition for all z, y ∈ Dγ and λ ∈ Λ
|
Δ
(
z
,
λ
)
-
Δ
(
y
,
λ
)
|
≤
1
T
|
C
-
1
A
+
I
2
|
+
K
R
+
10
27
T
K
(
I
2
-
Q
)
-
1
R
|
z
-
y
|
.
Proof. It follows from Theorem 2 that the limit function x* of the sequence {xm
} exists and is continuously differentiable in Dγ
× Λ. Therefore, Δ is bounded and the assumption (A2) implies
|
Δ
(
z
,
λ
)
-
Δ
(
y
,
λ
)
|
≤
1
T
C
-
1
A
+
I
2
|
z
-
y
|
+
1
T
∫
0
T
K
|
x
*
(
s
,
z
,
λ
)
-
x
*
(
s
,
y
,
λ
)
|
d
s
.
Using Lemma 6 and taking into account that
∫
0
T
α
1
(
t
)
d
t
=
T
2
3
, we get
|
Δ
(
z
,
λ
)
-
Δ
(
y
,
λ
)
|
≤
1
T
C
-
1
A
+
I
2
|
z
-
y
|
+
1
T
∫
0
T
I
2
+
10
9
α
1
(
s
)
K
(
I
2
-
Q
)
-
1
K
R
d
s
|
z
-
y
|
=
1
T
|
C
-
1
A
+
I
2
|
+
K
R
+
10
27
T
2
K
(
I
2
-
Q
)
-
1
R
|
z
-
y
|
.
Let us define the mth approximate determining function
Δ
m
(
z
,
λ
)
:
=
1
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
-
1
T
∫
0
T
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
d
s
,
m
∈
ℕ
∪
{
0
}
,
which has the following property.
Lemma 8. Let the assumptions (A1)-(A4) be satisfied. Then for any z ∈ Dγ, λ ∈ Λ and m ∈ ℕ,
|
Δ
(
z
,
λ
)
-
Δ
m
(
z
,
λ
)
|
≤
10
27
T
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
.
Proof. Using the assumption (A2) and (17), we have
|
Δ
(
z
,
λ
)
-
Δ
m
(
z
,
λ
)
|
=
1
T
∫
0
T
[
f
(
s
,
x
*
(
s
,
z
,
λ
)
)
-
f
(
s
,
x
m
(
s
,
z
,
λ
)
)
]
d
s
≤
K
T
∫
0
T
|
x
*
(
s
,
z
,
λ
)
-
x
m
(
s
,
z
,
λ
)
|
d
s
≤
1
T
10
9
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
∫
0
T
α
1
(
s
)
d
s
=
10
27
T
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
.
Let us introduce the relation f
1 ⊳Ω
f
2 of two vector functions f
1 = f
1(x) and f
2 = f
2(x), which means that for all x ∈ Ω, at least one component of f
1(x) is greater then the corresponding component of f
2(x).
Definition 9. Let Ω be an arbitrary non-empty set. For any pair of functions
f
1
=
co
1
(
f
11
(
x
)
,
f
12
(
x
)
)
,
f
2
=
co
1
(
f
21
(
x
)
,
f
22
(
x
)
)
we write f
1 ⊳Ω
f
2 if and only if there exists a function k : Ω → {1, 2} such that for all x ∈ Ω
f
1
,
k
(
x
)
(
x
)
>
f
2
,
k
(
x
)
(
x
)
.
The following statement provides sufficient conditions for the solvability of the boundary value problem (6).
Theorem 10. Let the assumptions (A1)-(A4) be satisfied. Moreover, let there exist m ∈ ℕ and non-empty set Ω ⊂ Dγ
× Λ such that the approximate determining function Δ
m satisfies
|
Δ
m
(
z
,
λ
)
|
⊳
∂
Ω
10
T
27
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
and the Brouwer degree of Δ
m over Ω with respect to 0 satisfies
deg
(
Δ
m
,
Ω
,
0
)
≠
0
.
Then, there exists a pair (z*, λ*) ∈ Ω such that
Δ
(
z
*
,
λ
*
)
=
0
and the corresponding limit function x* = x*(t, z*, λ*) of the sequence {xm
} solves the boundary value problem (6).
Proof. Let us introduce the mapping P : [0, 1] × Ω → ℝ2
P
(
Θ
,
z
,
λ
)
;
=
Δ
m
(
z
,
λ
)
+
Θ
[
Δ
(
z
,
λ
)
-
Δ
m
(
z
,
λ
)
]
.
Since the mappings (z, λ) ↦ Δ(z, λ) and (z, λ) ↦ Δ
m
(z, λ) are continuous due to the continuity of xm
, x* and f, the mapping P is continuous as well. Moreover, using Lemma 8 and (23), we have
|
P
(
Θ
,
z
,
λ
)
|
=
|
Δ
m
(
z
,
λ
)
+
Θ
[
Δ
(
z
,
λ
)
-
Δ
m
(
z
,
λ
)
]
|
≥
|
Δ
m
(
z
,
λ
)
|
-
|
Δ
(
z
,
λ
)
-
Δ
m
(
z
,
λ
)
|
⊳
∂
Ω
0
for all Θ ∈ [0, 1] and (z, λ) ∈ ∂Ω. Thus, the mapping P is the admissible homotopy connecting Δ
m
and Δ and the Brouwer degrees deg(Δ, Ω, 0) and deg (Δ
m
, Ω, 0) are well defined. The invariance property of the Brouwer degree under homotopy implies that
deg
(
Δ
,
Ω
,
0
)
=
deg
(
Δ
m
,
Ω
,
0
)
.
The assumption (24) then guarantees the existence of (z*, λ*) ∈ Ω such that
Δ
(
z
*
,
λ
*
)
=
0
.
Applying Theorem 4, we obtain that the limit function x* = x* (t, z*, λ*) of the sequence {xm
} is the solution of the boundary value problem (6).
5 Polynomial successive approximations
In order to make the computations of xm
possible or more easier, we give a justification of a polynomial version of the iterative scheme (14). At first, we recall some results of the theory of approximations in
20
.
We denote by Hq
a set of all polynomials of degree not higher than q and by Eq
(f, Pq
) the deviation of the function f from the polynomial Pq
∈ Hq
E
q
(
f
,
P
q
)
;
=
max
t
∈
[
0
,
T
]
|
f
(
t
)
-
P
q
(
t
)
|
.
There exists a unique polynomial
P
q
0
∈
H
q
for which
E
q
(
f
,
P
q
0
)
=
inf
P
q
∈
H
q
E
q
(
f
,
P
q
)
=
:
E
q
(
f
)
.
This polynomial
P
q
0
is said to be a polynomial of the best uniform approximation of f in Hq
and the number Eq
(f) is called the error of the best uniform approximation. It is known that
lim
q
→
+
∞
E
q
(
f
)
log
q
=
0
.
Definition 11. Let f : [0, T] → ℝ be a uniformly continuous function and δ be a positive real number. Then we define the modulus of continuity of f as
ω
(
f
,
δ
)
:
=
sup
|
f
(
t
)
-
f
(
s
)
|
,
where the supremum is taken over all t, s ∈ [0, T] for which |t - s| ≤ δ.
Let us note that the modulus of continuity ω(f, δ) is a continuous non-decreasing function of the variable δ, such that
lim
δ
→
0
ω
(
f
,
δ
)
=
0
.
Definition 12. We say that the function f : [0, T] → ℝ satisfies the Dini condition if
lim
δ
→
0
ω
(
f
,
δ
)
log
1
δ
=
0
.
Let us note that, e.g., all α-Hölder continuous functions on [0, T] with 0 < α ≤ 1 satisfy the Dini condition.
For a given function f, let us denote by fq
the interpolation Chebyshev polynomial of degree q, q ∈ ℕ, which satisfies
f
q
(
t
i
)
=
f
(
t
i
)
,
i
=
1
,
…
,
q
+
1
,
where ti
are the Chebyshev interpolation nodes in the interval [0, T]
t
i
=
T
2
1
+
cos
(
2
i
-
1
)
π
2
(
q
+
1
)
,
i
=
1
,
…
,
q
+
1
.
Lemma 13 (see
20
). If the function f satisfies the Dini condition, then the sequence {fq
} of the corresponding interpolation Chebyshev polynomials converges uniformly on [0, T] to f and the following estimate holds
|
f
(
t
)
-
f
q
(
t
)
|
≤
(
5
+
log
q
)
E
q
(
f
)
for all t ∈ [0, T].
Let us introduce the sufficiency for the Dini condition for a composite function F(t) = f(t, x(t)).
Lemma 14. Let the function f = f(t, x) satisfy the Dini condition with respect to t ∈ [0, T] and the Lipschitz condition with respect to x ∈ D. Then for any continuously differentiable function x = x(t), t ∈ [0, T], with the values in D, the composite function F(t) = f(t, x(t)) satisfies the Dini condition in the interval [0, T].
Proof. Taking into account the Lipschitz condition, we obtain
|
F
(
t
)
-
F
(
s
)
|
=
|
f
(
t
,
x
(
t
)
)
-
f
(
s
,
x
(
s
)
)
|
≤
|
f
(
t
,
x
(
t
)
)
-
f
(
t
,
x
(
s
)
)
|
+
|
f
(
t
,
x
(
s
)
)
-
f
(
s
,
x
(
s
)
)
|
≤
K
|
x
(
t
)
-
x
(
s
)
|
+
|
f
(
t
,
x
(
s
)
)
-
f
(
s
,
x
(
s
)
)
|
.
Since f and x both satisfy the Dini condition, we conclude that F satisfies the Dini condition as well.
For a given function f = f(t, z), let us define
L
q
:
=
(
5
+
log
q
)
sup
z
∈
D
E
q
(
f
(
⋅
,
z
)
)
.
Using Lemmas 13 and 14, the function F(t) = f(t, x(t)) and its interpolation Chebyshev polynomial Fq
(t) = fq
(t, x(t)) satisfy
|
F
(
t
)
-
F
q
(
t
)
|
≤
(
5
+
log
q
)
E
q
(
F
)
≤
L
q
.
Let us note that
lim
q
→
∞
L
q
=
0
and the sequence {Fq
} uniformly converges to the function F on the interval [0, T].
Remark 15. In the case of vector functions f, the error of the best uniform approximation Eq
(f), the modulus of continuity ω(f, δ) and Lq
are vectors as well. The Dini condition and the construction of the corresponding Chebyshev polynomials are understood componentwise.
Let us return again to the boundary value problem (6) considered in the domain [0, T] × D × Λ. To investigate the solution of the parameterized boundary value problem (6), instead of (14), we introduce the sequence
{
x
m
q
+
1
}
of vector polynomials
x
m
q
+
1
=
col
(
x
m
,
1
q
+
1
,
x
m
,
2
q
+
1
)
of degree (q + 1)
x
0
q
+
1
(
t
,
z
,
λ
0
)
:
=
z
,
z
=
co
1
(
0
,
z
2
)
,
x
m
+
1
q
+
1
(
t
,
z
,
λ
)
:
=
z
+
∫
0
t
f
q
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
d
s
-
t
T
∫
0
T
f
q
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
d
s
+
+
t
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
,
m
=
0
,
1
,
2
,
…
where
f
q
=
col
(
f
1
q
,
f
2
q
)
is the vector of interpolation Chebyshev polynomial of degree q corresponding to f . Let us point out that the coefficients of the interpolation polynomials depend on the parameters z and λ. Moreover, all the functions
x
m
q
+
1
=
x
m
q
+
1
(
t
,
z
,
λ
)
are continuously differentiable and satisfy the initial condition
x
m
q
+
1
(
0
,
z
,
λ
)
=
z
as well as the boundary conditions in (6).
Let us define the domain
D
γ
q
:
=
{
z
∈
D
⊂
ℝ
2
:
B
(
z
,
γ
q
(
z
,
λ
)
)
⊂
D
for all
λ
∈
Λ
}
⊂
D
γ
,
where
γ
q
=
γ
q
(
z
,
λ
)
:
=
T
2
(
δ
D
(
f
)
+
L
q
)
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
.
Theorem 16. Let the assumptions (A1)-(A4) be satisfied with
D
γ
q
instead of Dγ. Then for all
z
∈
D
γ
q
, λ ∈ Λ, the following statements hold
1. The sequence
{
x
m
q
+
1
}
converges uniformly in t ∈ [0, T] to the limit function
x
*
(
t
,
z
,
λ
)
=
lim
q
→
+
∞
lim
m
→
+
∞
x
m
q
+
1
(
t
,
z
,
λ
)
=
lim
m
→
+
∞
x
m
(
t
,
z
,
λ
)
,
which satisfies the initial condition x*(0, z, λ) = z and the boundary conditions in (6).
2. The following error estimate holds
|
x
*
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
≤
10
9
Q
m
-
1
K
(
I
2
-
Q
)
-
1
γ
(
z
,
λ
)
α
1
(
t
)
+
10
9
(
I
2
-
Q
)
-
1
α
1
(
t
)
L
q
.
Proof. We show that for all
(
t
,
z
,
λ
)
∈
[
0
,
T
]
×
D
γ
q
×
Λ
and m ∈ ℕ, all functions
x
m
q
+
1
=
x
m
q
+
1
(
t
,
z
,
λ
)
belong to D. Similarly as in the proof of Theorem 2, we have
x
1
q
+
1
(
t
,
z
,
λ
)
-
x
0
q
+
1
(
t
,
z
,
λ
)
=
x
1
q
+
1
(
t
,
z
,
λ
)
-
z
≤
∫
0
t
f
q
(
s
,
z
)
-
1
T
∫
0
T
f
q
(
τ
,
z
)
d
τ
d
s
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
≤
∫
0
t
[
(
f
q
(
s
,
z
)
-
f
(
s
,
z
)
)
+
f
(
s
,
z
)
]
-
1
T
∫
0
T
[
(
f
q
(
τ
,
z
)
-
f
(
τ
,
z
)
)
+
f
(
τ
,
z
)
]
d
τ
d
s
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
≤
[
L
q
+
δ
D
(
f
)
]
α
1
(
t
)
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
≤
T
2
[
L
q
+
δ
D
(
f
)
]
+
|
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
|
=
γ
q
.
Therefore, we conclude that
x
1
q
+
1
(
t
,
z
,
λ
)
∈
D
, whenever
(
t
,
z
,
λ
)
∈
[
0
,
T
]
×
D
γ
q
×
Λ
. By induction, we obtain that for all m ∈ ℕ, we have
|
x
m
q
+
1
(
t
,
z
,
λ
)
-
x
0
q
+
1
(
t
,
z
,
λ
)
|
≤
γ
q
,
i.e., all functions
x
m
q
+
1
are also contained in D.
For j = 1, 2, ..., m and for all
(
t
,
z
,
λ
)
∈
[
0
,
T
]
×
D
γ
q
×
Λ
, we estimate
x
j
(
t
,
z
,
λ
)
-
x
j
q
+
1
(
t
,
z
,
λ
)
=
∫
0
t
f
(
s
,
x
j
-
1
(
s
,
z
,
λ
)
)
-
f
q
(
s
,
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
)
d
s
-
t
T
∫
0
T
f
(
s
,
x
j
-
1
(
s
,
z
,
λ
)
)
-
f
q
(
s
,
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
)
d
s
≤
1
-
t
T
∫
0
t
f
(
s
,
x
j
-
1
(
s
,
z
,
λ
)
)
-
f
q
(
s
,
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
)
d
s
+
t
T
∫
t
T
f
(
s
,
x
j
-
1
(
s
,
z
,
λ
)
)
-
f
q
(
s
,
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
)
d
s
.
Taking into account that
f
(
t
,
x
j
-
1
(
s
,
z
,
λ
)
)
-
f
q
(
t
,
x
j
-
1
q
+
1
(
t
,
z
,
λ
)
)
≤
f
(
t
,
x
j
-
1
(
t
,
z
,
λ
)
)
-
f
(
t
,
x
j
-
1
q
+
1
(
t
,
z
,
λ
)
)
+
f
(
t
,
x
j
-
1
q
+
1
(
t
,
z
,
λ
)
)
-
f
q
(
t
,
x
j
-
1
q
+
1
(
t
,
z
,
λ
)
)
and using the assumption (A2) and the estimate (26), we get
x
j
(
t
,
z
,
λ
)
-
x
j
q
+
1
(
t
,
z
,
λ
)
≤
K
1
-
t
T
∫
0
t
x
j
-
1
(
s
,
z
,
λ
)
-
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
d
s
+
t
T
∫
t
T
x
j
-
1
(
s
,
z
,
λ
)
-
x
j
-
1
q
+
1
(
s
,
z
,
λ
)
d
s
+
1
-
t
T
∫
0
t
L
q
d
s
+
t
T
∫
t
T
L
q
d
s
.
In particular, for j = 1 and j = 2 we have
x
1
(
t
,
z
,
λ
)
-
x
1
q
+
1
(
t
,
z
,
λ
)
≤
α
1
(
t
)
L
q
,
x
2
(
t
,
z
,
λ
)
-
x
2
q
+
1
(
t
,
z
,
λ
)
≤
α
1
(
t
)
L
q
+
α
2
(
t
)
K
L
q
,
and by induction
|
x
m
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
≤
[
α
1
(
t
)
+
α
2
(
t
)
K
+
⋅
⋅
⋅
+
α
m
(
t
)
K
m
-
1
]
L
q
.
Using (12) and (13), we get
|
x
m
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
≤
10
9
I
2
+
3
T
10
K
+
⋅
⋅
⋅
+
3
T
10
K
m
-
1
α
1
(
t
)
L
q
and due to the assumption (A4), we obtain
|
x
m
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
≤
10
9
(
I
2
-
Q
)
-
1
α
1
(
t
)
L
q
.
By Theorem 2, we can write
|
x
*
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
=
|
x
*
(
t
,
z
,
λ
)
-
x
m
(
t
,
z
,
λ
)
+
x
m
(
t
,
z
,
λ
)
-
x
m
q
+
1
(
t
,
z
,
λ
)
|
≤
10
9
Q
m
-
1
K
(
I
2
-
Q
)
-
1
γ
α
1
(
t
)
+
10
9
(
I
2
-
Q
)
-
1
α
1
(
t
)
L
q
.
Recall that the sequence {Qm
} converges to the zero matrix for m → +∞ and Lq
tends to the zero vector for q → +∞, which implies immediately that the sequence
{
x
m
q
+
1
}
converges uniformly to x* on [0, T].
Let us define the mth approximate polynomial determining function
Δ
m
q
(
z
,
λ
)
:
=
1
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
-
1
T
∫
0
T
f
q
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
d
s
.
Lemma 17. Let the assumptions (A1)-(A4) be satisfied with
D
γ
q
instead of Dγ. Then, for all
z
∈
D
γ
q
, λ ∈ Λ and m ∈ ℕ,
|
Δ
(
z
,
λ
)
-
Δ
m
q
(
z
,
λ
)
|
≤
10
T
27
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
+
K
(
I
2
-
Q
)
-
1
L
q
+
L
q
.
Proof. Due to the assumption (A2), (26) and the error estimate (28), we get
|
Δ
(
z
,
λ
)
−
Δ
m
q
(
z
,
λ
)
|
=
|
1
T
∫
0
T
[
f
(
s
,
x
*
(
s
,
z
,
λ
)
)
−
f
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
+
f
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
−
f
q
(
s
,
x
m
q
+
1
(
s
,
z
,
λ
)
)
]
d
s
|
≤
K
T
∫
0
T
|
x
*
(
s
,
z
,
λ
)
−
x
m
q
+
1
(
s
,
z
,
λ
)
|
d
s
+
L
q
≤
10
9
T
K
[
Q
m
−
1
K
(
I
2
−
Q
)
−
1
γ
+
(
I
2
−
Q
)
−
1
L
q
]
∫
0
T
α
1
(
s
)
d
s
+
L
q
=
10
T
27
[
Q
m
−
1
K
2
(
I
2
−
Q
)
−
1
γ
+
K
(
I
2
−
Q
)
−
1
L
q
]
+
L
q
.
Theorem 18. Let the assumptions (A1)-(A4) be satisfied with
D
γ
q
instead of Dγ. Moreover, let there exist m ∈ ℕ and nonempty set Ω
q
⊂ Dγ
× Λ such that the approximate polynomial determining function
Δ
m
q
satisfies
|
Δ
m
q
(
z
,
λ
)
|
⊳
∂
Ω
q
10
T
27
Q
m
-
1
K
2
(
I
2
-
Q
)
-
1
γ
+
K
(
I
2
-
Q
)
-
1
L
q
+
L
q
and the Brouwer degree of
Δ
m
q
over Ω
q with respect to 0 satisfies
deg
(
Δ
m
q
,
Ω
q
,
0
)
≠
0
.
Then there exists a pair (z*, λ*) ∈ Ω
q such that
Δ
(
z
*
,
λ
*
)
=
0
and the corresponding limit function x* = x*(t, z*, λ*) of the sequence
{
x
m
q
+
1
}
solves the boundary value problem (6).
Proof. Using the same steps as in the proof of Theorem 10, we construct the admissible homotopy Pq
: [0, 1] × Ω
q
→ ℝ2
P
q
(
Θ
,
z
,
λ
)
:
=
Δ
m
q
(
z
,
λ
)
+
Θ
[
Δ
(
z
,
λ
)
-
Δ
m
q
(
z
,
λ
)
]
and we get
deg
(
Δ
,
Ω
q
,
0
)
=
deg
(
Δ
m
q
,
Ω
q
,
0
)
.
The assumption (31) then guarantees the existence of (z*, λ*) ∈ Ω
q
such that
Δ
(
z
*
,
λ
*
)
=
0
.
Applying Theorem 4, we obtain that the limit function x* = x* (t, z*, λ*) of the sequence
{
x
m
q
+
1
}
is the solution of the boundary value problem (6).
6 Examples
In this section, we introduce three particular boundary value problems in the form of the system (1). The first problem is a linear one and enables us to build the sequence {xm
} directly by the recurrence relation (14). The second problem is nonlinear and it is impossible to integrate in (14) in a closed form. Thus, we use the Chebyshev interpolation of the integrand to construct the sequence of successive approximations also in this case. In the last example, we use again the polynomial version of presented method in order to approximate a solution of the nonlinear Dirichlet problem containing p-Laplacian.
Example 1. Let us consider the following linear problem with the Dirichlet boundary conditions
x
1
′
(
t
)
=
x
2
(
t
)
,
t
∈
(
0
,
1
)
,
x
2
′
(
t
)
=
-
1
2
x
1
(
t
)
+
3
π
+
1
2
(
1
3
π
sin
(
3
π
t
)
)
3
,
x
1
(
0
)
=
x
1
(
1
)
=
0
,
which has a unique solution given in a closed form. Let us denote this solution by
x
o
(
t
)
=
col
(
x
1
∘
(
t
)
,
x
2
∘
(
t
)
)
.
All the assumptions (A1)-(A4) are satisfied. Let us take x
0(t, z, λ) = col(0, z
2) and construct the successive approximations Xm
of the exact solution x° for m = 0, 1, 2, ... in the following way:
1. using the recurrence relation (14), evaluate x
m+1(t, z, λ),
2. solve the (m+1)-th approximate determining equation Δ
m+1(z, λ) = 0 (system of two linear equations) and denote its solution by (z
m+1, λ
m+1),
3. define X
m+1(t) := x
m+1(t, z
m+1, λ
m+1).
Figure 1 contains both components X
m,1 and X
m,2 of approximations Xm
for m = 1, 2, 11 and also their differences from the exact solution x°. Let us point out that the maxima of both components of |X
11(t) - x°(t)| for t ∈ 〈0, 1〉 are both less then 10-9.
<p>Figure 1</p>The approximations X1, X2 and X11 of the exact solution x° of (32)
The approximations X1, X2 and X11 of the exact solution x° of (32).
![]()
Example 2. Let us investigate the nonlinear Dirichlet boundary value problem
x
′
1
(
t
)
=
sin
(
x
2
(
t
)
)
,
t
∈
(
0
,
1
)
,
x
′
2
(
t
)
=
-
1
2
(
x
1
(
t
)
)
3
+
3
π
+
1
2
(
1
3
π
sin
(
3
π
t
)
)
3
,
x
1
(
0
)
=
x
1
(
1
)
=
0
,
which has a solution in the form
x
∘
(
t
)
=
col
(
x
1
∘
(
t
)
,
x
2
∘
(
t
)
)
=
(
1
3
π
sin
(
3
π
t
)
,
3
π
t
+
π
2
-
2
π
)
. In this case, it is not possible to construct the sequence {Xm
} of approximations using the iterative scheme as in the previous Example 1. Thus, we use the following polynomial version of the iterative scheme. Choose
X
0
q
+
1
(
t
)
and for m = 0, 1, 2, ..., proceed the steps:
1. define
F
m
q
(
t
)
:
=
f
q
(
t
,
X
m
q
+
1
(
t
)
)
and realize the Chebyshev interpolation,
2. define
X
m
+
1
q
+
1
(
t
,
z
,
λ
)
:
=
z
+
∫
0
t
F
m
q
(
s
)
d
s
-
t
T
∫
0
T
F
m
q
(
s
)
d
s
+
t
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
,
3. define
ℱ
m
+
1
q
(
t
,
z
,
λ
)
:
=
f
q
(
t
,
X
m
+
1
q
+
1
(
t
,
z
,
λ
)
)
and realize the Chebyshev interpolation with parameters z and λ
f
1
q
t
,
X
m
+
1
q
+
1
(
t
,
z
,
λ
)
=
a
1
,
0
(
z
,
λ
)
+
a
1
,
1
(
z
,
λ
)
t
+
⋅
⋅
⋅
+
a
1
,
q
(
z
,
λ
)
t
q
,
f
2
q
t
,
X
m
+
1
q
+
1
(
t
,
z
,
λ
)
=
a
2
,
0
(
z
,
λ
)
+
a
2
,
1
(
z
,
λ
)
t
+
⋅
⋅
⋅
+
a
2
,
q
(
z
,
λ
)
t
q
,
4. solve the (m + 1)-th approximate polynomial determining equation
1
T
[
C
-
1
d
(
λ
)
-
(
C
-
1
A
+
I
2
)
z
]
-
1
T
∫
0
T
ℱ
m
+
1
q
(
s
,
z
,
λ
)
d
s
=
0
and denote its solution by (z
m+1, λ
m+1),
5. define
X
m
+
1
q
+
1
(
t
)
:
=
X
m
+
1
q
+
1
(
t
,
z
m
+
1
,
λ
m
+
1
)
.
In Figure 2, it is possible to compare polynomial approximations
X
m
q
+
1
for q = 15, m = 1, 2, 11 and the corresponding differences from the exact solution x°. Let us note that the maximum of
X
11
,
j
q
+
1
(
t
)
-
x
j
∘
(
t
)
for t ∈ 〈0, 1〉 is less then 10-7 for j = 1 and less then 2·10-7 for j = 2.
<p>Figure 2</p>The polynomial approximations of the exact solution x° of (33) for q = 15
The polynomial approximations of the exact solution x° of (33) for q = 15.
![]()
Example 3. Let us consider the following nonlinear problem with the Dirichlet boundary conditions
x
1
′
(
t
)
=
ϕ
p
p
-
1
(
x
2
(
t
)
)
,
t
∈
(
0
,
1
)
,
x
2
′
(
t
)
=
-
1
2
g
ε
(
x
1
(
t
)
)
-
(
p
-
1
)
π
p
p
ϕ
p
(
sin
p
(
π
p
t
)
)
+
1
2
g
ε
(
sin
p
(
π
p
t
)
)
,
x
1
(
0
)
=
x
1
(
1
)
=
0
,
where p > 1, sin
p
is the generalized sine function (see
21
for the definition),
ϕ
p
(
s
)
:
=
|
s
|
p
-
1
sgn
s
,
s
∈
ℝ
,
g
ε
(
x
)
:
=
ϕ
p
(
x
+
ε
)
-
ε
p
-
1
,
ε
∈
ℝ
,
π
p
:
=
2
π
p
sin
π
p
,
Let us recall that sin
p
is 2πp
-periodic function on ℝ, which coincide with the sin function for p = 2. Moreover, the pair (sin
p
(πpt), (πp
cos
p
(πpt))
p-1) is a solution of the following initial value problem
x
1
′
(
t
)
=
ϕ
p
p
-
1
(
x
2
(
t
)
)
,
t
∈
(
0
,
1
)
,
x
2
′
(
t
)
=
-
(
p
-
1
)
π
p
p
ϕ
p
(
x
1
(
t
)
)
,
x
1
(
0
)
=
0
,
x
2
(
0
)
=
π
p
p
-
1
.
For ε = 0, the problem (34) reads as the Dirichlet boundary value problem with p-Laplacian
ϕ
p
(
x
1
′
(
t
)
)
′
+
1
2
ϕ
p
(
x
1
(
t
)
)
=
(
1
2
-
(
p
-
1
)
π
p
p
)
ϕ
p
(
sin
p
(
π
p
t
)
)
,
t
∈
(
0
,
1
)
,
x
1
(
0
)
=
x
1
(
1
)
=
0
.
For the problem (34), all the assumptions (A1)-(A4) are satisfied in the linear case p = 2. If p ≠ 2, then there exist bounded domains D = 〈a
1, a
2〉 × 〈b
1, b
2〉 for which the second assumption (A2) concerning the Lipschitz condition of f is not satisfied. Thus, we have to take into account the following additional assumptions on D in order to satisfy the assumption (A2):
1. for 1 < p < 2, we have to ensure that -ε < a
1
< a
2 or a
1
< a
2
< -ε,
2. for 2 < p, we have to ensure that 0 < b
1
< b
2 or b
1
< b
2
< 0.
Let us note that for p > 2, the function
ϕ
p
p
-
1
, which appears in the first component of f, is not Lipschitz continuous on any interval containing zero. On the other hand, in the case of 1 < p < 2, the function gε
in the second component of f is not Lipschitz continuous on any interval containing -ε.
Thus, all the assumptions (A1)-(A4) are satisfied if we take, e.g.,
p
=
8
7
<
2
,
ε
=
1
10
and
a
1
=
1
11
. The polynomial version of the iterative scheme from the previous Example 2 is applicable in this case. Figure 3 shows
X
m
q
+
1
for q = 15, m = 1, 2, 11. Their differences from the exact solution
(
x
1
∘
(
t
)
,
x
2
∘
(
t
)
)
=
(
sin
p
(
π
p
t
)
,
π
p
cos
p
(
π
p
t
)
)
p
−
1
)
of the problem (34) are also available. Let us note that the maximum of
X
11
,
j
q
+
1
(
t
)
-
x
j
∘
(
t
)
for t ∈ 〈0, 1〉 is less then 7·10-4 for j = 1 and less then 6·10-4 for j = 2.
<p>Figure 3</p>The approximations of the exact solution x° of (34) for p
=
8
7
, ε
=
1
10
and q = 15
The approximations of the exact solution x° of (34) for p=87, ε=110 and q = 15.
![]()
Last Figure 4 shows
X
m
q
+
1
for
p
=
5
2
>
2
, ε = 0 and q = 15, m = 1, 2, 11. In spite of the fact that the assumption (A2) is not satisfied in this case, we obtain the polynomial approximation
X
11
q
+
1
, which differs from the exact solution x° less than 4·10-3 in both components.
<p>Figure 4</p>The approximations of the exact solution x° of (34) for p
=
5
2
, ε = 0 and q = 15
The approximations of the exact solution x° of (34) for p=52, ε = 0 and q = 15.
![]()
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
All authors contributed to each part of this study equally, and also read and approved the final manuscript.