# Reproducing Kernel Method for Solving Nonlinear Differential-Difference Equations

Authors: Reza Mokhtari; Fereshteh Toutian Isfahani; Maryam Mohammadi
Journal: Abstract and Applied Analysis
 (2012)

---

## Abstract

On the basis of reproducing kernel Hilbert spaces theory, an iterative algorithm for solving some nonlinear differential-difference equations (NDDEs) is presented. The analytical solution is shown in a series form in a reproducing kernel space, and the approximate solutionun,m
is constructed by truncating the series to m terms. The convergence of un,m
to the analytical solution is also proved. Results obtained by the proposed method imply that it can be considered as a simple and accurate method for solving such differential-difference problems.


---

## Body

## 1. Introduction

Differential-difference equations play a crucial role in modelling of much physical phenomena such as particle vibrations in lattices, currents in electrical networks, pulses in biological chains, discretization in solid state, quantum physics, textile engineering, stratified hydrostatic flows, and so on. See, for example [1–14].Recently, there have been lots of efforts in giving exact or approximate solutions of NDDEs. For instance, Zhu [4] extended the Exp-function method for solving NDDEs. In this method, exact solutions are sought in the form of an exponential type rational function in which both the numerator and denominator are polynomials of exponential functions. Mokhtari [5] applied the variational iteration method in which a correction functional is established by a general Lagrange multiplier, which can be identified optimally via the variational theory. The method gives rapidly convergent successive approximations of the exact solution. Qian et al. [6] extended the multilinear variable separation approach to a special differential-difference equation. Baldwin et al. [7] presented an algorithm to find exact travelling wave solutions of differential-difference equations in terms of the tanh function and found kink-type solutions in many spatially discrete nonlinear models. Wu et al. [8] and Wang et al. [9] extended the Adomian decomposition method to solve NDDEs. The technique is based on a decomposition of the solution of NDDE in a series of functions. Each term of the series is obtained from a polynomial generated from an expansion of an analytic function into a power series. Many authors [10–14] applied the homotopy perturbation method to solve NDDEs. The method, which is based on homotopy, constructs a continuous mapping of an initial guess through an auxiliary linear operator, and an auxiliary parameter is used to ensure the convergence of solution series.The theory of reproducing kernels [15] was used for the first time at the beginning of the 20th century by S. Zaremba in his work on boundary value problems for harmonic and biharmonic functions. This theory has been successfully applied to fractal interpolation [16], solving ordinary differential equations [17–20] and partial differential equations [21, 22]. The book [23] provides excellent overviews of the existing reproducing kernel methods for solving various model problems such as integral and integrodifferential equations.In this study, a general technique is proposed for solving some NDDEs in the reproducing kernel space. The main idea is to construct the reproducing kernel space satisfying the conditions for determining solution of the NDDEs. The analytical solution is represented in the form of series through the function value at the right side of the equation. For illustration, we apply this method to the Volterra lattice equation, the discretized mKdV lattice equation and the discrete sine-Gordon equation. The advantages of the approach lie in the following facts. The approximate solutionun,m(t) converges uniformly to the analytical solution un(t). The method is mesh-free, easily implemented and capable in treating various boundary conditions. Since the method needs no time discretization, there is no matter, in which time the approximate solution is computed, from the both elapsed time and stability problem, point of views. Also we can evaluate the approximate solution un,m(t) for fixed m once and use it over and over.In the next section we describe how to solve a NDDE through the reproducing kernel method and verify convergence of the approximate solution to the exact solution. Several numerical results are presented in Section3. The last section is a brief conclusion.


## 2. Construction of the Method

Consider the following NDDE(2.1)Lun(t)=N(t,un+p1,…,un+pd),t∈(0,T],
where L is a linear differential operator of one-order derivative in t, N is a nonlinear differential operator and n,pi∈ℤ. Since nonhomogeneous initial condition can be reduced readily to the homogeneous one, we only consider the following homogeneous initial condition
(2.2)un(0)=0.
We assume that (2.1)-(2.2) has a unique solution.Definition 2.1.
W
[
0
,
T
]
=
{
u
(
t
)
∣
u
(
t
)
,
u
′
(
t
) are absolutely continuous in [0,T],u′′(t)∈L2[0,T], u(0)=0}. The inner product and norm in W[0,T] are defined, respectively, by
(2.3)〈u,v〉W=∑i=01‍u(i)(0)v(i)(0)+∫0T‍u′′(t)v′′(t)dt,u,v∈W[0,T],‖u‖w=〈u,u〉W,u∈W[0,T].Remark 2.2.
The spaceW[0,T] is a reproducing kernel space, and its reproducing kernel is given by
(2.4)Ks(t)={st+s2t2-16t3t≤s,st+s22t-16s3t>s.Definition 2.3.
W
~
[
0
,
T
]
=
{
u
(
t
)
∣
u
(
t
) is absolutely continuous in [0,T],u′(t)∈L2[0,T]}. The inner product and norm in W~[0,T] are defined, respectively, by
(2.5)〈u,v〉W~=u(0)v(0)+∫0T‍u′(t)v′(t)dt,u,v∈W~[0,T],‖u‖W~=〈u,u〉W~,u∈W~[0,T].Remark 2.4.
The spaceW~[0,T] is a reproducing kernel space and its reproducing kernel is given by
(2.6)Gs(t)={1+tt≤s,1+st>s.Remark 2.5.
The definition of the spacesW[0,T] and W~[0,T] is suitable for our numerical examples and in general W[0,T] is defined on the basis of the operator L, and W~[0,T] must be defined based on the operator N.In order to represent the analytical solution of the model problem, we can assume thatL:W[0,T]→W~[0,T] is an invertible bounded linear operator, choose a countable dense subset {ti}i=1∞ in [0,T] and define
(2.7)ϕi(t)=Gti(t),ψi(t)=L*ϕi(t),
where L* is the adjoint operator of L. The orthonormal system {ψ-i(t)}i=1∞ of W[0,T] can be derived from the Gram-Schmidt orthogonalization process of {ψi(t)}i=1∞ as
(2.8)ψ-i(t)=∑k=1i‍βikψk(t).Theorem 2.6.
Suppose that{ti}i=1∞ is dense in [0,T], then {ψi(t)}i=1∞ is a complete system in W[0,T] and ψi(t)=LsKs(t)|s=ti.Proof.
See [22].Theorem 2.7.
If{ti}i=1∞ is dense in [0,T], then the analytical solution of (2.1)-(2.2) will be
(2.9)un(t)=∑i=1∞∑k=1i‍βikN(tk,un+p1(tk),…,un+pd(tk))ψ-i(t).Proof.
Since{ψ-i(t)}i=1∞ is a complete system in W[0,T], we have
(2.10)un(t)=∑i=1∞‍〈un(t),ψ-i(t)〉Wψ-i(t)=∑i=1∞‍∑k=1i‍βik〈un(t),ψk(t)〉Wψ-i(t)=∑i=1∞‍∑k=1i‍βik〈un(t),L*ϕk(t)〉Wψ-i(t)=∑i=1∞‍∑k=1i‍βik〈Lun(t),ϕk(t)〉W~ψ-i(t)=∑i=1∞‍∑k=1i‍βik〈Lun(t),Gtk(t)〉W~ψ-i(t)=∑i=1∞‍∑k=1i‍βikLun(tk)ψ-i(t)=∑i=1∞‍∑k=1i‍βikN(tk,un+p1(tk),…,un+pd(tk))ψ-i(t).Now the approximate solutionun,m(t) can be obtained by the m-term intercept of the analytical solution un(t), that is,
(2.11)un,m(t)=∑i=1m‍∑k=1i‍βikN(tk,un+p1(tk),…,un+pd(tk))ψ-i(t).
Obviously,
(2.12)‖un,m(t)-un(t)‖W⟶0,(m⟶∞).
In the sequel, for evaluating (2.11), we choose nonnegative integer m and put the initial function un,0(t)=0. Then the approximate solution is defined by
(2.13)un,m(t)=∑i=1m‍Biψ-i(t),
where
(2.14)Bi=∑k=1i‍βikN(tk,un+p1,k-1(tk),…,un+pd,k-1(tk)).Lemma 2.8.
Ifun,m→∥.∥u-n, ∥un,m∥ is bounded in (2.13), tm→s and N(t,un+p1(t),…,un+pd(t)) is continuous, then N(tm,un+p1,m-1(tm),…,un+pd,m-1(tm))→N(s,u-n+p1(s),…,u-n+pd(s)).Proof.
Note that(2.15)|un+pi(t)|=|〈un+pi(s),Kt(s)〉W|≤‖un+pi(s)‖W‖Kt(s)‖W≤c0‖un+pi(s)‖W,|∂un+pi(t)∂t|=|〈un+pi(s),∂Kt(s)∂t〉W|≤‖un+pi(s)‖W‖∂Kt(s)∂t‖W≤c1‖un+pi(s)‖W,|un+pi,m-1(s)-u-n+pi(s)|=|〈un+pi,m-1(t)-u-n+pi(t),Ks(t)〉W|≤‖un+pi,m-1(t)-u-n+pi(t)‖W‖Kt(s)‖W≤c0‖un+pi,m-1(t)-u-n+pi(t)‖W.
On the other hand, we have
(2.16)|un+pi,m-1(tm)-u-n+pi(s)|=|un+pi,m-1(tm)-un+pi,m-1(s)+un+pi,m-1(s)-u-n+pi(s)|≤|∂tun+pi,m-1(η)||tm-s|+|un+pi,m-1(s)-u-n+pi(s)|.
From un,m→∥.∥u-n and former statements, it follows that
(2.17)|un+pi,m-1(s)-u-n+pi(s)|⟶0,|∂tun+pi,m-1(η)|≤c1‖un+pi,m-1‖w.
Therefore,
(2.18)|un+pi,m-1(tm)-u-n+pi(s)|⟶0,asm⟶∞,
because of the boundedness of ∥un,m∥. The continuity of N(t,un+p1(t),…,un+pd(t)) implies that
(2.19)N(tm,un+p1,m-1(tm),…,un+pd,m-1(tm))⟶N(s,u-n+p1(s),…,u-n+pd(s)),asm⟶∞.Theorem 2.9.
Suppose that∥un,m∥ is bounded in (2.13), and (2.1)-(2.2) has a unique solution. If {ti}i=1∞ is dense in [0,T], then the m-term approximate solution un,m(t) derived from the above method converges to the analytical solution un(t) of (2.1)-(2.2) and
(2.20)un(t)=∑i=1∞‍Biψ-i(t),
where Bi is given by (2.14).Proof.
At first, we prove the convergence ofun,m(t). From (2.13), we infer that
(2.21)un,m+1(t)=un,m(t)+Bm+1ψ-m+1(t).
The orthonormality of {ψ-i}i=1∞ yields that
(2.22)‖un,m+1‖2=‖un,m‖2+Bm+12=⋯=∑i=1m+1‍Bi2.
In terms of (2.22), it holds that ∥un,m+1∥≥∥un,m∥. Due to the condition that ∥un,m∥ is bounded, ∥un,m∥ is convergent and there exists a constant c such that ∑i=1∞‍Bi2=c. If l>m, and then
(2.23)‖un,l-un,m‖2=‖un,l-un,l-1+un,l-1-un,l-2+⋯+un,m+1-un,m‖2=‖un,l-un,l-1‖2+‖un,l-1-un,l-2‖2+⋯+‖un,m+1-un,m‖2.
On account of ∥un,l-un,l-1∥2=Bl2, consequently, we have
(2.24)‖un,l-un,m‖2=∑i=m+1l‍Bi2⟶0asm⟶∞.
The completeness of W[0,T] shows that un,m→u-n as m→∞. Now, we prove that u-n is the solution of (2.1)-(2.2). Taking limits in (2.13), we get
(2.25)u-n(t)=∑i=1∞‍Biψ-i(t).
Note that
(2.26)(Lu-n)(t)=∑i=1∞‍BiLψ-i(t),(2.27)(Lu-n)(tl)=∑i=1∞‍BiLψ-i(tl)=∑i=1∞‍Bi〈Lψ-i(t),ϕl(t)〉W~=∑i=1∞‍Bi〈ψ-i(t),L*ϕl(t)〉W=∑i=1∞‍Bi〈ψ-i(t),ψl(t)〉W.
Therefore, consider
(2.28)∑l=1i‍βil(Lu-n)(tl)=∑i=1∞‍Bi〈ψ-i(t),∑l=1i‍βilψl(t)〉W=∑i=1∞‍Bi〈ψ-i(t),ψ-l(t)〉W=Bl.
In view of (2.14), we have
(2.29)Lu-n(tl)=N(tl,un+p1,l-1(tl),…,un+pd,l-1(tl)).
Since {ti}i=1∞ is dense in [0,T], for each s∈[0,T], there exist a subsequence {tmj}j=1∞ such that
(2.30)tmj⟶s(j⟶∞).
We have known that
(2.31)Lu-n(tmj)=N(tmj,un+p1,mj-1(tmj),…,un+pd,mj-1(tmj)).
Let j→∞, by Lemma 2.8 and the continuity of N, we have
(2.32)(Lu-n)(s)=N(s,u-n+p1(s),…,u-n+pd(s)),
which indicates that u-n satisfies (2.1)-(2.2).


## 3. Numerical Results

To test the accuracy of the proposed method, three examples are treated in this section. The results are compared with the exact solutions. All experiments are done by takingT=1.Example 3.1.
Consider the Volterra equation of the form(3.1)∂un∂t=un(un-1-un+1).
With the initial condition un(0)=n, it is easy to check that the exact solution will be
(3.2)un(t)=n1+2t.
Taking n=4, relative error (RE) of numerical results for m=16, m=50, and m=150 are reported in Table 1. Accuracy of approximate solutions is getting better as m increases.Table 1
Relative errors ofu4,m(t), for Example 3.1.
t
u
exact
RE (m=16)
RE (m=50)
RE (m=150)
0.1
3.33333
2.39250
E
-
02
2.15212
E
-
03
2.27949
E
-
04
0.2
2.85714
1.81724
E
-
02
1.63061
E
-
03
1.72270
E
-
04
0.3
2.50000
1.47060
E
-
02
1.28701
E
-
03
1.35604
E
-
04
0.4
2.22222
1.21036
E
-
02
1.04777
E
-
03
1.10095
E
-
04
0.5
2.00000
1.02211
E
-
02
8.73935
E
-
04
9.15787
E
-
05
0.6
1.81818
8.78692
E
-
03
7.43272
E
-
04
7.76766
E
-
05
0.7
1.66667
7.65804
E
-
03
6.42308
E
-
04
6.69478
E
-
05
0.8
1.53846
6.77754
E
-
03
5.62483
E
-
04
5.84769
E
-
05
0.9
1.42857
6.04603
E
-
03
4.98142
E
-
04
5.16585
E
-
05
1
1.33333
5.45125
E
-
03
4.45418
E
-
04
4.60794
E
-
05Example 3.2.
Consider the discrete mKdV equation(3.3)∂un∂t=(α-un2)(un+1-un-1).
With the initial conditionun(0)=-αtanh(k/2)(1+cosh(k))sech(kn-2), where k and α are arbitrary constants, the exact solution will be
(3.4)un(t)=-αtanh(k2)(1+cosh⁡(k))sech(kn+2αtanh(k2)(1+cosh⁡(k))t-2).
Taking m=50, α=-0.1 and k=0.3 and choosing n=10 and n=15, we have listed relative error of approximate solutions at some nodal points in Table 2. Numerical results are in good agreement with the exact solutions.Table 2
Relative errors ofun,50(t), for Example 3.2.
t
RE (n=10)
RE (n=15)
0.1
9.28456
E
-
06
1.31645
E
-
05
0.2
4.00254
E
-
06
3.45703
E
-
06
0.3
7.57456
E
-
06
3.88922
E
-
05
0.4
2.41475
E
-
05
8.78319
E
-
05
0.5
4.59293
E
-
05
1.49880
E
-
04
0.6
7.31335
E
-
05
2.24650
E
-
04
0.7
1.05974
E
-
04
3.11759
E
-
04
0.8
1.44666
E
-
04
4.10836
E
-
04
0.9
1.89424
E
-
04
5.21514
E
-
04
1
2.40464
E
-
04
6.43435
E
-
04Example 3.3.
Consider the discrete sine-Gordon equation of the form(3.5)∂un+1∂t-∂un∂t=sin⁡(un+1-un).
With the initial conditionun(0)=2arctan(tanh(kn+δ)) where δ and k≠0 are arbitrary constants, the exact solution will be
(3.6)un(t)=2arctan(tanh(kn-12tanh(k)t+δ)).
Taking m=50, δ=9 and k=0.3 and choosing n=5 and n=10, we have given relative error of approximate solutions at some nodal points in Table 3. Numerical results are in good agreement with the exact solutions.Table 3
Relative errors ofun,50(t), for Example 3.3.
t
RE (n=5)
RE (n=10)
0.1
1.36553
E
-
10
6.79847
E
-
12
0.2
2.58908
E
-
08
6.18223
E
-
08
0.3
1.51271
E
-
07
3.55847
E
-
07
0.4
5.55149
E
-
07
1.27165
E
-
06
0.5
1.79618
E
-
06
3.99090
E
-
06
0.6
5.56118
E
-
06
1.19763
E
-
05
0.7
1.69167
E
-
05
3.53422
E
-
05
0.8
5.10327
E
-
05
1.03601
E
-
04
0.9
1.53212
E
-
04
3.02802
E
-
04
1
4.58423
E
-
04
8.83675
E
-
04


## 4.  Conclusion

In this work, we proposed an algorithm for solving a class of nonlinear differential-difference equations on the basis of reproducing kernel spaces. Results of numerical examples show that the present method is an accurate and reliable analytical-numerical technique for solving such differential-difference equations. The method is shown to be of good convergence, simple in principle, and easy to program.



---

*Source: 514103-2012-07-19.xml*