https://doi.org/10.1142/9789814415477_fmatter
The following sections are included:
https://doi.org/10.1142/9789814415477_0001
Boundary value problems (hereafter to be abbreviated as BVPs) manifest themselves in almost all branches of Science, Engineering and Technology, for instance, boundary layer theory in fluid mechanics, heat power transmission theory, space technology and also control and optimization theory, to cite only a few. The following examples provide a variety of situations of occurrence of BVPs and the motivation for some of the problems we shall consider in these notes.
https://doi.org/10.1142/9789814415477_0002
For the nth order linear differential equation
where pi(t), 1 ≤ i ≤ n and f(t) are continuous on I = [a,b], we shall consider the following separated boundary conditions
where a ≤ a1 ≤ a2 ≤ … ≤ an ≤ b…
https://doi.org/10.1142/9789814415477_0003
Throughout, we shall assume that the condition (2.15) is satisfied. Thus, the existence of the fundamental system of solutions {xi(t)}, 1 ≤ i ≤ n of (2.12) satisfying
is assured. We shall denote by Di(t), 1 ≤ i ≤ n the cofactor of the element in the Wronskian W(t). For convenience we shall write a = a0, b = an+1, x0(t) = xn+1(t) = D0(t) = Dn+1(t) = 0. The square a ≤ t, s ≤ b will be represented by K; the same square with straight lines of the form s = ai rejected from it we shall denote by K0; K0 with rejected diagonal t = s by K1…
https://doi.org/10.1142/9789814415477_0004
Shooting methods, in which the numerical solution of a BVP is found by integrating an appropriate initial value problem, have been the subject of several papers [1-5, 9-11 and references therein] and books [8, 13, 14], and a large part of the monographs [7, 12]. The attraction of these methods is in the availability on most computers of reasonably adequate subroutines of the numerical solution of initial value problems. Goodman and Lance [6] gave two such methods for the numerical solution of linear two point BVPs, the method of complementary functions and the method of adjoints, which are now in common use. Here, we shall formulate the method of complementary functions for the BVP (2.1), (2.2) whereas the method of adjoints is the subject of our next section…
https://doi.org/10.1142/9789814415477_0005
As the name suggests we use the adjoint equation of (2.1) to obtain the solution of the BVP (2.1), (2.2). However, to avoid unnecessary differentiability conditions on the functions Pi(t), 1 ≤ i ≤ n appearing in (2.1) we shall formulate this method for the first order differential systems…
https://doi.org/10.1142/9789814415477_0006
This is another practical shooting method originally developed by Gel’fand and Lokutsiyevskii, however first appeared in English literature only recently [4]. Na [6] has briefly described the method and given different formulations for the different particular cases of (2.1), (2.2). Here, we shall follow [1-3] to provide the general formulation of the method for the BVP (2.1), (2.2). The power of the method is illustrated by solving known Holt’s problem…
https://doi.org/10.1142/9789814415477_0007
The BVP
where f(t,x0,x1) is continuous and satisfies a uniform Lipschitz condition
on [a1,a2] × R2 has a long history going back to Picard [11] 1893 (from the literature it appears that before 1893 the main attack was to construct the solution to a given problem tacitly assuming existence and uniqueness). He proved that if (a2-a1) is sufficiently small then the sequence {xm(t)} of functions generated by the iterative scheme
https://doi.org/10.1142/9789814415477_0008
In polynomial interpolation theory, the following result is well known :
Theorem 8.1 Let x(t) ∈ C(n)[a,bl, satisfying (3.8). Then,
where and
…
https://doi.org/10.1142/9789814415477_0009
The necessary and sufficient condition (2.15) for the existence of a unique solution of the BVP (2.1), (2.2) is only of theoretical value because it can be verified only for some trivial problems. Further, the method used in Theorem 7.2 to obtain explicit bounds for the existence of a solution of the BVP (7.1), (7.7), (7.8) leads to an insurmountable task for (2.1), (2.2). However, using the inequalities obtained in the previous section, it is possible to provide explicit bounds for the existence and uniqueness of the solutions even for the nonlinear nth order differential equation
together with each of the boundary conditions (2.3)-(2.9). In the differential equation (9.1), x stands for (x,x′,…,x(q)), 0 ⪯ q ⪯ n-1. Throughout, we shall assume that the function f is continuous at least in the interior of the domain of interest.
https://doi.org/10.1142/9789814415477_0010
The Picard method of successive approximations mentioned in Section 7 for the BVP (7.1), (7.2) has an important characteristic, that it is constructive; moreover, bounds of the difference between iterates and the solution are easily available. In this section we shall discuss this method only for the BVP (9.1), (2.4). For other BVPs analogous results can be stated without much difficulty. For this, we need
Theorem 10.1 (Contraction mapping principle) [3] Let B be a Banach space, and let r > 0; S(x0,r) = {x ∈ B : ||x −x0||≤r}. Let T map into B and
(i) for all x,y ε , ||Tx − Ty|| ≤ α ||x - y|| where 0 ≤ α < 1
(ii) r0 = (1−α)−1 ||Tx0 − x0|| ≤ r.
https://doi.org/10.1142/9789814415477_0011
It is well recognised that quasilinearization is a fruitful practical method to construct the solution of nonlinear problems in an iterative way. Although the technique as originally developed by Bellman and Kalaba [5] was motivated by dynamic programming, it is not necessary to know or to employ dynamic programming to use quasilinear method…
https://doi.org/10.1142/9789814415477_0012
Here, we shall employ weight function technique of Weissinger [15] and Collatz [10] to show that the region of existence and uniqueness of solutions of BVPs can be enlarged as compared to what can be deduced from the results of sections 9 and 10. More so, in some special cases where the explicit form of the Green’s function and some of its properties are known, it is possible to find best existence and uniqueness intervals. For this, we need
Definition 12.1 A system of nonnegative continuous functions (weight functions) wj(t), 0 ≤ j ≤ q in [a1, ar] is called admissible with respect to the Green’s function g2(t,s) if
(i) there exist smallest positive constants kj., 0 ≤ j ≤ q such that
(ii) there exist finite smallest positive constants , 0 ≤ i, j ≤ q such that
https://doi.org/10.1142/9789814415477_0013
In example 12.6, we employed weight function technique for the BVP (9.1), (2.7) when q ≤ p and obtained best possible existence and uniqueness interval in terms of the Lipschitz constants L0, …, Lq. Here, we shall again assume that q ≤ p, but the function f satisfies the condition
whenever xj ≥ yj, 0 ≤ j ≤ q to obtain best possible existence and uniqueness interval for each of the BVPs (9.1), (2.7); (9.1), (2.8) in terms of Mj, Kj, 0 ≤ j ≤ q. Obviously, the condition (13.1) is equivalent to the Lipschitz condition (9.12), but more informative particularly since there are no sign restrictions on the constants.
https://doi.org/10.1142/9789814415477_0014
In [3], a fixed point theorem for isotone operators in partially ordered spaces has been proved which is distinguished for its constructive character. Its slightly strengthened version is given by the following :
Theorem 14.1 Let (E,≤) be a partially ordered space and x0 ≤ y0 be two elements of E. [x0,y0] denotes the interval {x ∈ E : x ≤ x ≤ y0}. Let T : [x0, y0] → E be isotone (T(x) ≤ T(y), whenever x ≤ y) and let it possess the properties
(i) x0 ≤ T(x0)
(ii) the (nondecreasing) sequence {Tm(x0)} where T0(x0) = x0, Tm+1(x0) = T[Tm(x0)] for each m = 0,1,2,… is well defined, i.e., Tm(x0) ≤ y0 for each natural m
(iii) the sequence {Tm(x0)} has sup x ∈ E, i.e., Tm(x0) ↑ x
(iv) Tm+1(x0) ↑ T(x)…
https://doi.org/10.1142/9789814415477_0015
In Section 2, we have noticed that the uniqueness of solutions of the linear BVP (2.1), (2.2) implies the existence of solutions. The argument employed in proving this assertion is algebraic and is based on the linear structure of the fundamental system of solutions of (2.12) and the linearity of the boundary conditions (2.2). The question of whether or not nonlinear equation (9.1) could have this property will be discussed here. For this, we need Kamke’s convergence theorem [2].
https://doi.org/10.1142/9789814415477_0016
The proposition mentioned in Remark 15.4 is that “conditions (A)-(D) of Theorem 15.5 are sufficient to imply the conclusion of Theorem 15.7”. This is indeed the case when the differential equation (9.1) is of second or third order. In fact for these particular cases conditions (A)-(D) imply the compactness condition (E). To show this we note that Theorem 15.1 can be stated as follows :
Theorem 16.1 Assume that for the differential equation (9.1) the conditions (A), (B) and (C) of Theorem 15.5 are satisfied. Then, if {xm(t)} is a sequence of solutions of (9.1) and [c,d] is a compact sub-interval of (a,b), either there is a subsequence {xm(j)(t)} such that converges uniformly on [c,d] for each 0 ≤ i ≤ n-1, or
uniformly on [c,d] as m → ∞…
https://doi.org/10.1142/9789814415477_0017
Let the BVP (7.1), (7.2) have two solutions xl(t) and x2(t). Since x1(ai) - x2(ai) = 0 for i = 1,2 there exists some t0 ∈ (a1,a2) at which . Thus, x1(t) and x2(t) are both solutions of the two BVPs : (7.1) together with
and (7.1) together with
where . Thus, if a1 < t1 < a2 and uniqueness holds for all BVPs (7.1), (17.1) whenever t0 ∈ (a1,t1], and if uniqueness holds for all BVPs (7.1), (17.2) then uniqueness holds for all BVPs (7.1), (7.2) also…
https://doi.org/10.1142/9789814415477_0018
The concept of boundary value functions for the third order linear differential equations appears to have been used first by Azbelev and Tsalyuk [1], whereas for the nth order linear differential equations by Sherman [11]. Peterson [3] was the first to extend this notion to nonlinear differential equation (9.1)…
https://doi.org/10.1142/9789814415477_0019
A number of authors have employed various topological principles to study second order BVPs. For example, in [1-5,13,16] variations and refinements of Wazewski’s topological method have been obtained for the first order differential system u′ = F(t,u) and subsequently these are used to prove the existence and continuous dependence of solutions on boundary data for a class of second order BVPs more general than (7.1), (7.2). In [6] Wazewski’s topological method together with the compactness properties of solution funnels have been used to prove the existence of solutions. In [15] Kelley has employed a method similar to Wazewski’s to study the existence of the solutions of the BVP (9.1), (2.7) with q = n-1 and p = n-2. In this section, we shall use a newly developed topological transversality method due to Granas [10,11] which is a generalization of the continuation theorem of Leray and Schauder found in [9], to study the existence of solutions of a more general class of BVP
where Pi(t), 1 ≤ i ≤ n are continuous on I = [a,b], f is continuous on I × Rq+1, U : C(n-1) (I) → Rn is a continuous linear operator and l is a given vector in Rn.
https://doi.org/10.1142/9789814415477_0020
In Section 10, we have used Contraction Mapping Principle and obtained the conclusion that a given BVP has a unique solution provided certain inequality over the length of the interval is satisfied. In general this inequality does not provide the best possible length estimates in the sense that unique solutions may exist on longer intervals. The results obtained in Sections 12 and 13 are some examples where the weight function technique or shooting methods indeed give best possible intervals. In this section, we shall apply techniques from optimal control theory to obtain some more best possible results…
https://doi.org/10.1142/9789814415477_0021
This technique is useful in proving the existence of solutions of a given BVP with the help of solutions of several other related BVPs. The main idea of this method is contained in the following : Let x1(t) be a solution of a BVP on [a,b] and x2(t) be a solution of a BVP on [b,c], where b ∈ (a,c) and fixed, then the function x(t) defined by
is a solution of the given BVP on [a,c]…
https://doi.org/10.1142/9789814415477_0022
In this section, we shall consider the question of existence of a maximal solution for the initial value problem : (9.1) together with
where t0 ∈ (a,b) and f is assumed to be continuous on (a,b) × Rq+1…
https://doi.org/10.1142/9789814415477_0023
‘Everyone knows’ that if x ∈ C(2) [a1,a2] and x″(t) ≥ 0 on (a1,a2), then x satisfies the maximum principle, i.e., if x attains its maximum at an interior point of [a1,a2], then x is identically constant on [a1,a2]. This principle, however, is not true for functions satisfying higher order inequalities. For example, let x = −t2, it follows that x satisfies the inequality x(4)(t) ≥ 0 on [−1,1], and yet x assumes its maximum at t = 0…
https://doi.org/10.1142/9789814415477_0024
In this section, we are concerned with the existence of solutions of BVPs on semi-infinite and infinite intervals. In Theorems 24.2 and 24.3, we shall provide sufficient conditions for the BVP : (9.1) with q = 0 and
where to have a solution on [a1,∞] and
respectively.…
https://doi.org/10.1142/9789814415477_0025
In this final section, we shall first consider the following differential equation with deviating arguments
where <x(i)> stands for . The function f is assumed to be continuous on [al,ar] × RN, where
. The functions Wij(t); 1 ≤ j ≤ p(i); 0 ≤ i ≤ q are continuous on [a1, a1, ar]…
https://doi.org/10.1142/9789814415477_bmatter
The following sections are included: