74 T. S. Aleroev, H. T. Aleroeva, Ning-Ming Nie, and Yi-Fa TangDue to (3.44)–(3.45), we consider {|y(t n ) − y n |} N n=0. Then we getmax |y(t n) − y n | = O(h r ). (3.47)0≤n≤NAs to the linear case of (3.7)–(3.8), we only need to replace (3.42) and(3.43) with the initial value conditionsRLa D γ−1t y(t) ∣ = ξ 1 , lim J 2−γt=a t→a + a y(t) = 0, (3.48)D γ−1y(t) ∣ = ξ 2 , ;t=aRLatlim J 2−γt→a + a y(t) = 0. (3.49)Again, the shooting procedures for linear FBVPs (3.3)–(3.4) and (3.9)–(3.10) are similar to that of (3.1)–(3.2) and (3.7)–(3.8), respectively.3.2. Shooting method for nonlinear problems. For nonlinearFBVP (3.1) and (3.7) with homogeneous boundary value conditions (3.41),we consider the following FIVP:Ca D γ t y(t) + f(t, y(t)) = 0, a ≤ t ≤ b, 1 < γ ≤ 2, (3.50)y(a) = 0, y ′ (a) = ξ, (3.51)The FIVPs (3.50) is corresponding to FBVP (3.1), (3.41) with analyticsolutions denoted as y(t; ξ). In general, y(b; ξ) ≠ 0. Once a zero point ξ ∗of φ(ξ) := y(b; ξ) is found, one obtains y(t; ξ ∗ ), the solution of FBVP (3.1),(3.41). When y(t; ξ), and hence φ(ξ) are continuously differentiable withrespect to ξ, Newton’s method can be employed to determine ξ ∗ . Startingwith an initial approximation ξ (0) , one gets ξ (k) as follows:ξ (k+1) = ξ (k) − φ(ξ(k) )φ ′ (ξ (k) ) . (3.52)On one hand, y(b; ξ), hence φ(ξ) can be determined by solving FIVP (3.50)numerically. On the other hand, it is easy to check that w(t; ξ) := ∂y(t;ξ)∂ξisa solution of the following FIVP (refer to [30]):Ca D γ ∂f(t, y(t; ξ))t w(t; ξ) + w(t; ξ) = 0, (3.53)∂yw(a; ξ) = 0, w ′ (a; ξ) = 1, a ≤ t ≤ b, 1 < γ ≤ 2. (3.54)So we can compute w(b; ξ), i.e., φ ′ (ξ) by solving FIVPs (3.53) numerically.However, considering the computation complexity for ∂f(t,y(t;ξ))∂yin practice,we usually calculate the difference quotient△φ(ξ (k) ) := φ(ξ(k) + △ξ (k) ) − φ(ξ (k) )△ξ (k)instead of the derivative φ ′ (ξ (k) ) itself, where △ξ (k) is a sufficiently smallnumber. And the formula (3.52) is replaced byξ (k+1) = ξ (k) − φ(ξ(k) )△φ(ξ (k) ) . (3.55)
Boundary Value Problems for Differential Equations of Fractional Order 75In short, the procedure of solving FBVP (3.1), (3.41) by shootingmethod is displayed as follows:step 1. choose a starting value ξ (0) and an iterative precision ɛ for Newton’smethod; then for k = 0, 1, 2, . . . ;step 2. obtain y(b; ξ (k) ) by solving FIVP (3.50) with y ′ (a) = ξ (k) andcompute φ(ξ (k) );step 3. choose a sufficiently small number △ξ (k) ≠ 0 and determiney(b; ξ (k) + △ξ (k) ) by solving the FIVP (3.50) with y ′ (a) = ξ (k) +△ξ (k) , and then compute φ(ξ (k) + △ξ (k) );step 4. compute △φ(ξ (k) ) and determine ξ (k+1) by the formula (3.55);repeat steps 2–4 until |ξ (k+1) − ξ (k) | ≤ ɛ and denote the finalξ (k+1) by ξ ∗ ;step 5. finally, we obtain the numerical solution of FBVP (3.1), (3.41) bysolving FIVP (3.50) with y ′ (a) = ξ ∗ .Next, we want to give the error analysis of shooting method for nonlinearFBVP (3.1), (3.7). The error consists of two parts. One is from the errorbetween |ξ ∗ − ˜ξ|. By shooting method, we can only get the approximation˜ξ of the exact initial value ξ ∗ (= y ′ (a)). That is to say, we solve FIVP{CaDt α y(t) + f(t, y(t)) = 0,y(a) = 0, y ′ (a) = ˜ξ(3.56)instead of FIVP {CaD α t y(t) + f(t, y(t)) = 0,y(a) = 0, y ′ (a) = ξ ∗ .(3.57)which is an initial perturbation problem in fact. Denote the exact solutionsof (3.56) and (3.57) as y(t; ˜ξ) and y(t; ξ ∗ ), respectively.Lemma 3.4 (see [32]). Suppose α > 0, A(t) is a nonnegative functionlocally integrable on [a, b] and B(t) is a nonnegative, nondecreasing continuousfunction defined on [a, b], and suppose ψ(t) is nonnegative and locallyintegrable on [a, b] withψ(t) ≤ A(t) + B(t)on this interval. Then∫ ta(t − τ) α−1 ψ(τ) dτ, t ∈ [a, b] (3.58)ψ(t) ≤ A(t)E α(B(t)Γ(α)(t − a)α ) , (3.59)where E α is the Mittag–Leffler function defined by∞∑ x kE α (x) :=Γ(kα + 1) . (3.60)k=0
- Page 4 and 5: 24 T. S. Aleroev, H. T. Aleroeva, N
- Page 8 and 9: 28 T. S. Aleroev, H. T. Aleroeva, N
- Page 10 and 11: 30 T. S. Aleroev, H. T. Aleroeva, N
- Page 12 and 13: 32 T. S. Aleroev, H. T. Aleroeva, N
- Page 14 and 15: 34 T. S. Aleroev, H. T. Aleroeva, N
- Page 16 and 17: 36 T. S. Aleroev, H. T. Aleroeva, N
- Page 18 and 19: 38 T. S. Aleroev, H. T. Aleroeva, N
- Page 20 and 21: CHAPTER 2The Sturm-Liouville Proble
- Page 22 and 23: 42 T. S. Aleroev, H. T. Aleroeva, N
- Page 24 and 25: 44 T. S. Aleroev, H. T. Aleroeva, N
- Page 26 and 27: 46 T. S. Aleroev, H. T. Aleroeva, N
- Page 28 and 29: 48 T. S. Aleroev, H. T. Aleroeva, N
- Page 30 and 31: 50 T. S. Aleroev, H. T. Aleroeva, N
- Page 32 and 33: 52 T. S. Aleroev, H. T. Aleroeva, N
- Page 34 and 35: 54 T. S. Aleroev, H. T. Aleroeva, N
- Page 36 and 37: 56 T. S. Aleroev, H. T. Aleroeva, N
- Page 38 and 39: 58 T. S. Aleroev, H. T. Aleroeva, N
- Page 40 and 41: 60 T. S. Aleroev, H. T. Aleroeva, N
- Page 42 and 43: 62 T. S. Aleroev, H. T. Aleroeva, N
- Page 44 and 45: 64 T. S. Aleroev, H. T. Aleroeva, N
- Page 46 and 47: CHAPTER 3Solving Two-Point Boundary
- Page 48 and 49: 68 T. S. Aleroev, H. T. Aleroeva, N
- Page 50 and 51: 70 T. S. Aleroev, H. T. Aleroeva, N
- Page 52 and 53: 72 T. S. Aleroev, H. T. Aleroeva, N
- Page 56 and 57: 76 T. S. Aleroev, H. T. Aleroeva, N
- Page 58 and 59: Since∣∣f(t, u 2 ) − f(t, u 1
- Page 60 and 61: agreement with the fact that (3.33)
- Page 62: 82 T. S. Aleroev, H. T. Aleroeva, N