# Bezier Curves Method for Fourth-Order Integrodifferential Equations

Authors: F. Ghomanjani; A. V. Kamyad; A. Kılıçman
Journal: Abstract and Applied Analysis
 (2013)

---

## Abstract

The Bezier curves method is applied to solve both linear and nonlinear BVPs for fourth-order integrodifferential equations. Also, the presented method is developed for solving BVPs which arise from the problems in calculus of variation. These BVPs result from the Euler-Lagrange equations which are the necessary conditions of the extremums of problems in calculus of variation. Some numerical examples demonstrate the validity and applicability of the technique.


---

## Body

## 1. Introduction

Recently, there has been much attention devoted to the search for reliable and more efficient solution methods for equations modelling physical phenomena in various fields of engineering (see [1, 2]). One of the methods which has received much concern is the Adomian decomposition method (ADM) (see [3, 4]). The ADM has been employed to solve various scientific models. In [5], Wazwaz's main objective was to obtain the exact solutions to two fourth-order integrodifferential equations. Hashim [4] determined the accuracy and efficiency of the ADM in solving integrodifferential equations. In the present work, we suggest a technique similar to the one which was used in [6–8] for solving both linear and nonlinear boundary value problems (BVPs) for fourth-order integrodifferential equations.Now, we consider the following class of two-point BVPs for fourth-order integrodifferential equations(1)y(iv)(t)=f(t)+γy(t)+∫0t‍(g(t)y(t)+h(t)F(y(t)))dt,t∈(t0,tf),y(t0)=α0,y′′(t0)=α1,y(tf)=β0,y′′(t0)=β1,
where F is a real nonlinear continuous function, γ, α0, α1, β0, and β1 are real constants, and f, g, and h are given and can be approximated by Taylor polynomials. The conditions for existence and uniqueness of solutions of (1) are given in [9].The rest of this paper is organized as follows. In Section2, we review the Beizer curves method. Several illustrative examples are provided in Section 3 for confirming the effectiveness of the presented method. Section 4 contains some conclusions and notations about the future works.


## 2. The Beizer Curves Method

Consider the problem (1). Divide the interval [t0,tf] into a set of grid points such that
(2)tj=t0+jh,j=0,1,…,k,
where h=(tf-t0)/k and k is a positive integer. Let Sj=[tj-1,tj] for j=1,2,…,k. Then, for t∈Sj, the problem (1) can be decomposed to the following problems:
(3)yj(iv)(t)=f(t)+γyj(t)+∫tj-1tj‍(g(t)yj(t)+h(t)F(yj(t)))dt,fggggggggggggggggggft∈[tj-1,tj],y(t0)=α0,y′′(t0)=α1,y(tf)=β0,y′′(tf)=β1,
where yj(t) is considered in t∈Sj. Let y(t)=∑j=1k‍χj1(t)yj(t) where χj1(t) is the characteristic function of yj(t) for t∈[tj-1,tj]. It is trivial that [t0,tf]=⋃j=1k‍Sj.Our strategy is using Bezier curves to approximate the solutionsyj(t) by vj(t) where vj(t) is given below. Individual Bezier curves that are defined over the subintervals are joined together to form the Bezier spline curves. For j=1,2,…,k, define the Bezier polynomials vj(t) of degree n that approximate the action of yj(t) over the interval [tj-1,tj] as follows:
(4)vj(t)=∑r=0n‍arjBr,n(t-tj-1h),
where
(5)Br,n(t-tj-1h)=(nr)1hn(tj-t)n-r(t-tj-1)r,
is the Bernstein polynomial of degree n over the interval [tj-1,tj] and arj is the control points (see [7]). By substituting (4) in (3), one can define R1,j(t) for t∈[tj-1,tj] as
(6)R1,j(t)=yj(iv)(t)-(∫tj-1tj‍f(t)+γyj(t)ffff+∫tj-1tj‍(g(t)yj(t)+h(t)F(yj(t)))dt).
Let v(t)=∑j=1k‍χj1(t)vj(t) where χj1(t) is the characteristic function of vj(t) for t∈[tj-1,tj]. Besides the boundary conditions on v(t), at each node, we need to impose continuity condition on each successive pair of vj(t) to guarantee the smoothness. Since the differential equation is of first order, the continuity of y (or v) and its first derivative gives
(7)vj(s)(tj)=vj+1(s)(tj),s=0,1,j=1,2,…,k-1,
where vj(s)(tj) is the sth derivative vj(t) with respect to t at t=tj. Thus, the vector of control points arj (r=0,1,n-1,n) must satisfy (see [7])
(8)anj(tj-tj-1)n=a0j+1(tj+1-tj)n,(anj-an-1j)(tj-tj-1)n-1=(a1j+1-a0j+1)(tj+1-tj)n-1.
According to the definition of the tj=t0+jh, we get that tj-tj-1=h. Therefore
(9)anj=a0j+1,(anj-an-1j)=(a1j+1-a0j+1).
Ghomanjani et al. [7] proved the convergence of this method where h→0.Now, the residual function can be defined inSj as follows:
(10)Rj=∫tj-1tj‍∥R1,j(t)∥2dt,
where ∥·∥ is the Euclidean norm. Our aim is solving the following problem over S=⋃j=1k‍Sj:
(11)min∑j=1k‍Rjs.t.fanj=a0j+1,fffff(anj-an-1j)=(a1j+1-a0j+1),fffffv1(t0)=α0,v1′′(t0)=α1,fffffvk(tf)=β0,vk′′(tf)=β1.
The mathematical programming problem (11) can be solved by many subroutine algorithms. Here, Maple 12 can solve this optimization problem.Remark 1.
Consider the following functional (see [10]):
(12)J[y1(t),y2(t),…,yN(t)]=∫01‍G(x,y1(t),…,yN(t),y1′(t),…,yN′(t))dt,
to find the extreme value of J, the boundary points of the admissible curves are known as
(13)yi(0)=θi,i=1,2,…,N,yi(1)=δi,i=1,2,…,N.
To extremize the necessary condition,J[y1(t),y2(t),…,yN(t)] is that it should satisfy the Euler-Lagrange equations
(14)∂G∂yi-ddt(∂G∂yi′)=0,i=1,2,…,N,
with boundary conditions given in (13). The system of BVPs (14) does not always have a solution, and if the solution exists, it cannot be unique. Note that in many variational problems, the existence of a solution is obvious from the geometrical or physical meaning of the problem, and if the solution of the Euler equation satisfies the boundary conditions, it is unique. Also this unique extremal will be the solution of the given variational problem. Thus, another approach for solving the variational problem (12) is finding the solution of the system of ordinary differential equations (ODEs) (14) which satisfies the boundary conditions in (13) which were called systems of BVPs. The simplest form of the variational problem (12) is
(15)J[y(t)]=∫01‍G(t,y(t),y′(t))dt,
with the given boundary conditions
(16)y(0)=θ,y(1)=δ.
For the extremum of the functional (15), the necessary condition is to satisfy the following second-order differential equation:
(17)∂G∂y-ddt(∂G∂y′)=0,i=1,2,…,N,
with boundary conditions given in (16).
One can emphasize that our method is to solve BVPs such as (14) and (17).


## 3. Numerical Results and Discussion

To demonstrate the accuracy of the decomposition method, we consider some examples with known exact solutions.Example 1.
First, we consider the linear fourth-order integrodifferential equation as in (1) with f(t)=t(1+et)+3et, γ=1, g(t)=-1, and h(t)=0; that is,
(18)y(iv)(t)=t(1+et)+3et+y(t)-∫0t‍y(t)dt,0<t<1,y(0)=1,y′′(0)=2,y(1)=1+e,y′′(1)=3e,
where the exact solution is
(19)y(t)=1+tet,
with n=3 and k=3, and one can find the following approximated solution
(20)y(t)={0.9999999997+1.004858451t+0.9327855932t2+0.7033912400t3,t∈[0,13],0.9935111555+1.063258052t+0.7575867804t2+0.8785900700t3,t∈[13,23],0.7908249981+1.975345738t-0.6105447271t2+1.562655820t3,t∈[23,1],
where the maximum absolute errors in [4] and presented method are, respectively, 0.008 and 0.0009. The graphs of approximated and exact solution are shown in Figure 1.Figure 1
Graphs of the exact and computed solution of the problem for Example1.Example 2.
Now, consider the nonlinear fourth-order BVP (1) with f(t)=1, γ=0, g(t)=0, and h(t)=e-t, and F(t)=y2(t),
(21)y(iv)(t)=1+∫0t‍e-ty2(t)dt,0<t<1,y(0)=1,y′′(0)=1,y(1)=e,y′′(1)=e,
where the exact solution is
(22)y(t)=et,
with n=3 and k=3, and one can find the following approximated solution:
(23)y(t)={0.9999999997+1.001035251t+0.4854296266t2+0.2130969500t3,t∈[0,13],0.9983270381+1.016091895t+0.4402597035t2+0.2582668700t3,t∈[13,23],0.9556365363+1.208199192t+0.1520987099t2+0.4023473900t3,t∈[23,1],
where the maximum absolute errors in [4] and presented method are, respectively, 0.001 and 0.00018. The graphs of approximated and exact solution are shown in Figure 2.Figure 2
Graphs of the exact and computed solution of the problem for Example2.Example 3.
Consider the problem of finding the minimum of the integral(24)min∫01‍((y′(t))2+ty′(t)+(y(t))2)dt,
with the boundary conditions
(25)y(0)=0,y(1)=14,
where the exact solution is
(26)y(t)=(e-t-1)(e-2e2-2et+et+1)4(e2-1).
According to (17), the associated Euler-Lagrange equation is as follows:
(27)y(t)-y′′(t)-12=0,
with n=3 and k=10, and the computational results are shown in Table 1, where the computed values are compared with the values obtained from the analytical solution and Legendre polynomials in [11].Table 1
Legendre polynomials, presented method, exact, and absolute error ofy(t) for Example 3.
t
Legendre polynomials
Presented method
Exact
Absolute error
0.0
0.0000080
0.00000000000
0.00000000000
0.0
0.1
0.0419474
0.04195072854
0.04195072872
1.773458002
×
1
0
-
10
0.2
0.0793162
0.07931714637
0.07931714637
2.0180492
×
1
0
-
12
0.3
0.1124756
0.1124732287
0.1124732286
6.880859813
×
1
0
-
11
0.4
0.1417531
0.1417508127
0.1417508127
1.025976216
×
1
0
-
11
0.5
0.1674426
0.1674429185
0.1417508127
1.12222848
×
1
0
-
11
0.6
0.1898041
0.1898066812
0.1898066813
6.434997580
×
1
0
-
11
0.7
0.2090640
0.2090659248
0.2090659250
2.239963759
×
1
0
-
10
0.8
0.2254149
0.2254134028
0.2254134028
2.503659231
×
1
0
-
11
0.9
0.2390158
0.2390127258
0.2390127256
2.308402409
×
1
0
-
10
1.0
0.2499920
0.2500000000
0.2500000000
0.0


## 4. Conclusions

In this sequel, the Bezier curves method was employed to solve linear and nonlinear BVPs for fourth-order integrodifferential equations. The presented algorithm produced results which are of reasonable accuracy. Numerical examples show that the proposed method is efficient and very easy to use.



---

*Source: 672058-2013-12-07.xml*