Hindawi Publishing Corporation

Discrete Dynamics in Nature and Society

Volume 2015, Article ID 206264, 8 pages
http://dx.doi.org/10.1155/2015/206264

Research Article
Discrete-Time Orthogonal Spline Collocation Method for
One-Dimensional Sine-Gordon Equation

Xiaoquan Ding,1 Qing-Jiang Meng,2 and Li-Ping Yin3

1
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, Henan 471023, China
2
China Investment Securities, Shenzhen, Guangdong 518048, China
3
First Institute of Oceanography, State Oceanic Administration, Qingdao, Shandong 266061, China

Correspondence should be addressed to Qing-Jiang Meng; qjmeng04@163.com

Received 13 September 2015; Revised 23 November 2015; Accepted 1 December 2015

Academic Editor: Pilar R. Gordoa

Copyright © 2015 Xiaoquan Ding et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

We present a discrete-time orthogonal spline collocation scheme for the one-dimensional sine-Gordon equation. This scheme uses
Hermite basis functions to approximate the solution throughout the spatial domain on each time level. The convergence rate with
order O(ℎ4 + 𝜏2 ) in 𝐿2 norm and stability of the scheme are proved. Numerical results are presented and compared with analytical
solutions to confirm the accuracy of the presented scheme.

1. Introduction or Neumann boundary conditions

We consider the following one-dimensional sine-Gordon 𝜕𝑢
(𝐿 , 𝑡) = 𝛼 (𝑡) ,
equation: 𝜕𝑥 0
𝜕𝑢 (4)
𝜕 2 𝑢 𝜕2 𝑢 (𝐿 , 𝑡) = 𝛽 (𝑡) ,
− + 𝐹 (𝑢, 𝑢𝑡 ) = 𝑓 (𝑥, 𝑡) , 𝜕𝑥 1
𝜕𝑡2 𝜕𝑥2 (1)
𝑡 ≥ 𝑡0 .
𝑥 ∈ (𝐿 0 , 𝐿 1 ) , 𝑡 > 𝑡0 ,
Here we require that ℎ0 (𝑡0 ) = 𝑔(𝐿 0 ) and ℎ1 (𝑡0 ) = 𝑔(𝐿 1 )
for consistency, 𝐿 0 < 𝐿 1 ∈ R. When 𝐹(𝑢, 𝑢𝑡 ) = sin(𝑢)
with initial conditions
and 𝑓(𝑥, 𝑡) = 0, (1) is a classical sine-Gordon equation. The
sine-Gordon equation has applications in various research
𝑢 (𝑥, 𝑡0 ) = 𝑔 (𝑥) ,
areas such as the Lie group of methods [1] and the inverse
𝜕𝑢 󵄨󵄨 scattering transform [2]. It also appears in a number of other
󵄨
(𝑥, 𝑡)󵄨󵄨󵄨 = 𝑔̂ (𝑥) , (2) physical applications, including the propagation of fluxons
𝜕𝑡 󵄨󵄨𝑡=𝑡0
in Josephson junctions between two superconductors, the
𝑥 ∈ [𝐿 0 , 𝐿 1 ] motion of rigid pendulums attached to a stretched wire, and
dislocations in crystals [3, 4].
and Dirichlet boundary conditions The numerical solution to the sine-Gordon equation
has received considerable attention in the literature. Among
others Khaliq et al. [5] use a predictor-corrector scheme to
𝑢 (𝐿 0 , 𝑡) = ℎ0 (𝑡) ,
solve the finite difference scheme using the methods of line.
𝑢 (𝐿 1 , 𝑡) = ℎ1 (𝑡) , (3) Bratsos [6] applies a predictor-corrector scheme from the use
of rational approximation to the matrix-exponential term.
𝑡 ≥ 𝑡0 Mohebbi and Dehghan [7] propose a high-order and accurate
2 Discrete Dynamics in Nature and Society

method for solving sine-Gordon equation using compact For 𝑢, V ∈ 𝐶1 (Ω), we define a discrete inner product and its
finite difference and DIRKN methods. Xu and Chang [8] induced norm by
present an implicit scheme and a compact scheme for the
solution of an initial-boundary value problem of the general- 𝑁 2
ized nonlinear sine-Gordon equation with a convergence rate ⟨V, V⟩G = ∑ ℎ𝑗 ∑ 𝜔𝑘 𝑢 (𝜉𝑗,𝑘 ) V (𝜉𝑗,𝑘 ) ,
O(𝜏2 + ℎ2 ), where ℎ and 𝜏 denote the spatial and temporal 𝑗=1 𝑘=1 (9)
mesh sizes, respectively. Cui [9] gives a three-level implicit
‖𝑢‖G = ⟨𝑢, 𝑢⟩1/2
G .
compact difference scheme with a convergence rate O(𝜏2 +ℎ4 )
by using the Padé approximant.
The purpose of this paper is to investigate the use of the We always use the following difference quotient notations:
orthogonal spline collocation (OSC) method with piecewise
𝑢𝑛+1 − 𝑢𝑛
Hermite cubic polynomials for the spatial discretization of 𝑢𝑡𝑛 = ,
(1). The accuracy and stability of solutions with order O(𝜏2 + 𝜏
ℎ4 ) in 𝐿2 norm are verified. This method has evolved as 𝑢𝑛 − 𝑢𝑛−1
a valuable technique for the solution of many types of 𝑢𝑡𝑛 = ,
𝜏 (10)
partial differential equations. See [10] for a comprehensive
survey. The popularity of such a method is due in part to 𝑢𝑡𝑡𝑛 = (𝑢𝑡𝑛 )𝑡 ,
its conceptual simplicity and ease of implementation. One
obvious advantage of the OSC method over the finite element 𝑢𝑛+1 − 𝑢𝑛−1
𝑢𝑡𝑛 = .
method is that the calculation of the coefficient matrices 2𝜏
is very efficient since no integral calculation is required.
Another advantage of this method is that it systematically Let 𝑟 be a nonnegative integer; we have
incorporates boundary conditions and interface conditions.
1/2
The paper is organized as follows. In Section 2, we briefly 󵄩󵄩 𝑗 󵄩󵄩2
𝑟
󵄩󵄩 𝜕 𝑢 󵄩󵄩
review the OSC method and give the discretization scheme of ‖𝑢‖𝐻𝑟 (Ω) = ( ∑ 󵄩󵄩󵄩 𝑗 󵄩󵄩󵄩 ) . (11)
the sine-Gordon equation. In Section 3, we demonstrate the 𝑗=0 󵄩 󵄩 𝜕𝑥 󵄩󵄩𝐿2 (Ω)
accuracy and stability of the scheme. Numerical results are
presented in Section 4. We denote by 𝐿𝑠 (0, 𝑇; 𝐻𝑟+3 (Ω)) the Banach space of all 𝐿𝑠
integrable functions from (0, 𝑇) into 𝐻𝑟+3 (Ω) with norm
2. The OSC Method for Sine-Gordon Equation
𝑇 1/𝑠
With a positive integer 𝑁, let Δ be a partition of Ω = [𝐿 0 , 𝐿 1 ]: ‖𝑢‖𝐿𝑠 (0,𝑇;𝐻𝑟+3 (Ω)) = (∫ ‖𝑢‖𝑠𝐻𝑟+3 (Ω) 𝑑𝑡) (12)
0
Δ : 𝐿 0 = 𝑥0 < 𝑥1 < ⋅ ⋅ ⋅ < 𝑥𝑁 = 𝐿 1 . (5)
Let ℎ𝑗 = 𝑥𝑗 − 𝑥𝑗−1 , 𝑗 = 1, 2, . . . , 𝑁, and ℎ = max1≤𝑗≤𝑁 ℎ𝑗 . for 𝑠 ∈ [1, +∞) and the standard modification for 𝑠 = +∞.
A family F of partitions is said to be quasi-uniform if there In this paper, we take 𝑟 = 3.
exists a finite positive number 𝜎 such that Let {𝜙𝑗𝑛 }2𝑁
𝑗=1 be basis functions of M(Δ). So one may write

ℎ
max ≤𝜎 (6) 2𝑁
1≤𝑗≤𝑁 ℎ𝑗 𝑢ℎ𝑛 (𝑥) = ∑𝑢̂𝑗𝑛 𝜙𝑗𝑛 (𝑥) , 𝑛 = 0, 1, 2, . . . , 𝐽, (13)
𝑗=1
for every partition Δ in F. We assume that the partition Δ
is a member of a quasi-uniform family F. Let {𝑡𝑛 }𝐽𝑛=0 be a where 𝑢̂𝑗𝑛 (𝑗 = 1, 2, . . . , 2𝑁; 𝑛 = 0, 1, 2, . . . , 𝐽) are unknown
partition of [0, 𝑇], where 𝑡𝑛 = 𝑛𝜏 and 𝜏 = 𝑇/𝐽.
coefficients which should be worked out.
Let M be the space of piecewise Hermite cubics on Ω
We introduce the following lemmas.
defined by
󵄨 Lemma 1 (Lemma 2.2 in [11], Equation 2.2 in [12]). For 𝑢 ∈
M (Δ) = { V | V ∈ 𝐶1 (Ω) : V󵄨󵄨󵄨󵄨[𝑥 ∈ P𝑟 } ,
𝑗−1 ,𝑥𝑗 ] M(Δ), there exist positive constants 𝐶1 and 𝐶2 such that
(7)
𝑗 = 1, 2, . . . , 𝑁, 𝐶1 ‖𝑢‖G ≤ ‖𝑢‖𝐿2 (Ω) ≤ 𝐶2 ‖𝑢‖G . (14)
where P𝑟 denotes the set of all polynomials of degree less
than or equal to 𝑟. Lemma 2 (Lemma 3.1, Lemma 3.2 in [11]). For 𝑢, V ∈ M(Δ),
Let {𝜆 𝑘 }2𝑘=1 denote the roots of the Legendre polynomial one has
of degree 2, where 𝜆 1 ≡ (1/2)(1 − 1/√3) and 𝜆 2 ≡ (1/2)(1 +
(𝑢𝑥 , V)G = − (V𝑥 , 𝑢)G ,
1/√3). To apply the collocation method, we introduce a set of
collocation points G = {𝜉𝑗,𝑘 }𝑁,2
𝑗,𝑘=1 taken as (𝑢𝑥𝑥 , V)G = (𝑢, V𝑥𝑥 )G , (15)
𝜉𝑗,𝑘 = 𝑥𝑗−1 + ℎ𝑗 𝜆 𝑘 , 𝑗 = 1, 2, . . . , 𝑁, 𝑘 = 1, 2. 󵄩 󵄩2
(8) − ⟨𝑢𝑥𝑥 , 𝑢⟩G ≥ 󵄩󵄩󵄩𝑢𝑥 󵄩󵄩󵄩𝐿2 (Ω) .
Discrete Dynamics in Nature and Society 3

Lemma 3 (Theorem 4.1 in [11]). Let 𝑢 ∈ 𝐻6 (Ω) and suppose Proof. We use 𝐶 to denote a generic positive constant that is
that 𝑊 : [0, 𝑇] → M(Δ) satisfies independent of ℎ and 𝜏 in the following proof. Substituting
𝑢𝑛 (𝑥) = 𝑢(𝑥, 𝑛𝜏) into (21) and using Taylor expansion, we
(𝑢𝑥𝑥 − 𝑊𝑥𝑥 ) (𝜉𝑗,𝑘 ) − (𝑢 − 𝑊) (𝜉𝑗,𝑘 ) = 0, have
(16)
1 𝑛+1
𝑗 = 1, 2, . . . , 𝑁, 𝑘 = 1, 2. (𝑢 − 2𝑢𝑛 + 𝑢𝑛−1 ) − (1 − 2𝜃) (𝑢𝑛 )𝑥𝑥
𝜏2
Then one has
− 𝜃 ((𝑢𝑛+1 ) + (𝑢𝑛−1 ) ) + 𝐹 (𝑢𝑛 , (𝑢𝑛 ) )
𝑥𝑥
(23)
𝑥𝑥 ̂𝑡
‖𝑢 − Φ‖𝐿2 (Ω) ≤ 𝐶ℎ4 ‖𝑢‖𝐻6 (Ω) . (17)
= 𝑓 (𝑥, 𝑡𝑛 ) + 𝜎𝑛 ,
Lemma 4 (Lemma 4 in [13]). Suppose that discrete function
𝑤(𝑛) satisfies the recurrence formula where 𝜎𝑛 = O(𝜏2 ). Let 𝑒̂𝑛 = 𝑢𝑛 − 𝑊𝑛 and 𝑒𝑛 = 𝑢ℎ𝑛 − 𝑊𝑛 , then
𝑢𝑛 − 𝑢ℎ𝑛 = 𝑒̂𝑛 − 𝑒𝑛 .
𝑤𝑛 − 𝑤𝑛−1 ≤ 𝐴𝜏𝑤𝑛 + 𝐵𝜏𝑤𝑛−1 + 𝐶𝑛 𝜏, (18) One may get from (21) and (23) that
where 𝐴, 𝐵, and 𝐶𝑛 (𝑛 = 1, . . . , 𝑁) are nonnegative constants. 1 𝑛+1
Then [ (𝑒 − 2𝑒𝑛 + 𝑒𝑛−1 ) − (1 − 2𝜃) 𝑒𝑥𝑥
𝑛
𝜏2
𝑁
󵄨 󵄨 𝑛+1 𝑛−1 1 𝑛+1
max 󵄨󵄨𝑤𝑛 󵄨󵄨󵄨 ≤ (𝑤0 + 𝜏 ∑ 𝐶𝑘 ) 𝑒2(𝐴+𝐵)𝑇 , (19) − 𝜃 (𝑒𝑥𝑥 + 𝑒𝑥𝑥 )] (𝜉𝑗,𝑘 ) = [ (̂ 𝑒𝑛 + 𝑒̂𝑛−1 )
𝑒 − 2̂
1≤𝑛≤𝑁 󵄨 𝜏2
𝑘=1 (24)
𝑛 𝑛+1 𝑛−1
where 𝜏 is small, such that (𝐴 + 𝐵)𝜏 ≤ (𝑁 − 1)/2𝑁 (𝑁 > 1). − (1 − 2𝜃) (̂
𝑒𝑥𝑥 ) − 𝜃 (̂
𝑒𝑥𝑥 + 𝑒̂𝑥𝑥 )] (𝜉𝑗,𝑘 )

Lemma 5 (Inequality (2.8) in [8]). Let 𝐶1 , 𝐶2 , and 𝐶 be + 𝐹 (𝑢𝑛 , (𝑢𝑛 )̂𝑡) − 𝐹 (𝑢ℎ𝑛 , (𝑢ℎ𝑛 )̂𝑡) − 𝜎𝑛 (𝜉𝑗,𝑘 ) .
constants. Suppose that the following conditions are satisfied:
(i) 𝐹(𝑥, 𝑦) ∈ 𝐶1 (R2 ); Computing the inner product ⟨⋅⟩ of (24) with 𝑒𝑛+1 − 𝑒𝑛−1 as in
Section 2, we have
(ii) |𝐹𝑥 | ≤ 𝐶1 , |𝐹𝑦 | ≤ 𝐶2 .
󵄩󵄩 𝑛 󵄩󵄩2 󵄩󵄩󵄩 𝑛−1 󵄩󵄩󵄩2 𝑛 𝑛+1 𝑛−1
󵄩󵄩𝑒𝑡 󵄩󵄩G − 󵄩󵄩𝑒𝑡 󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥 , 𝑒 − 𝑒 )
Then one has
󵄨󵄨 󵄨 󵄨 󵄨 𝑛+1 𝑛+1
, 𝑒 − 𝑒𝑛−1 ) − 𝜃 (𝑒𝑥𝑥
𝑛−1 𝑛+1
, 𝑒 − 𝑒𝑛−1 )
󵄨󵄨𝐹 (𝑥, 𝑦)󵄨󵄨󵄨 ≤ 𝐶 (1 + |𝑥| + 󵄨󵄨󵄨𝑦󵄨󵄨󵄨) . (20) − 𝜃 (𝑒𝑥𝑥 (25)

We use finite difference scheme and construct the = 𝐼1 + 𝐼2 ,

discrete-time OSC scheme as follows:
where
1 1 𝑛+1
[ 2 (𝑢ℎ𝑛+1 − 2𝑢ℎ𝑛 + 𝑢ℎ𝑛−1 ) − (1 − 2𝜃) (𝑢ℎ𝑛 )𝑥𝑥 𝐼1 = ( (̂ 𝑒𝑛 + 𝑒̂𝑛−1 ) − (1 − 2𝜃) 𝑒̂𝑥𝑥
𝑒 − 2̂ 𝑛
− 𝜃 (̂𝑛+1
𝑒𝑥𝑥
𝜏 𝜏2
− 𝜃 ((𝑢ℎ𝑛+1 )𝑥𝑥 + (𝑢ℎ𝑛−1 )𝑥𝑥 ) 󵄨 𝑛
(21) 𝑛−1
+ 𝑒̂𝑥𝑥 ) − 𝜎𝑛 , 𝑒𝑛+1 − 𝑒𝑛−1 ) = 𝜏 󵄨󵄨󵄨󵄨(̂ 𝑛
𝑒𝑡𝑡 − (1 − 2𝜃) 𝑒̂𝑥𝑥
G
𝑢ℎ𝑛+1 − 𝑢ℎ𝑛−1 󵄨 󵄩 󵄩2
+ 𝐹 (𝑢ℎ𝑛 , )] (𝜉𝑗,𝑘 ) = 𝑓 (𝜉𝑗,𝑘 , 𝑡𝑛 ) , − 𝜃 (̂𝑛+1
𝑒𝑥𝑥 𝑛−1
+ 𝑒̂𝑥𝑥 ) − 𝜎𝑛 , 𝑒𝑡𝑛 + 𝑒𝑡𝑛−1 )G 󵄨󵄨󵄨󵄨 ≤ 𝐶𝜏 (󵄩󵄩󵄩𝑒̂𝑡𝑡𝑛 󵄩󵄩󵄩G
2𝜏
󵄩 𝑛 󵄩󵄩2 󵄩󵄩󵄩 ̂𝑛+1 󵄩󵄩󵄩2 󵄩󵄩󵄩 ̂𝑛−1 󵄩󵄩󵄩2 󵄩󵄩 𝑛 󵄩󵄩2 󵄩󵄩 𝑛 󵄩󵄩2
for 𝑛 = 1, 2, . . . , 𝐽, 𝑗 = 1, 2, . . . , 𝑁, and 𝑘 = 1, 2. + 󵄩󵄩󵄩𝑒̂𝑥𝑥 󵄩󵄩G + 󵄩󵄩𝑒𝑥𝑥 󵄩󵄩G + 󵄩󵄩𝑒𝑥𝑥 󵄩󵄩G + 󵄩󵄩𝜎 󵄩󵄩G + 󵄩󵄩𝑒𝑡 󵄩󵄩G
(26)
󵄩 󵄩2
3. Accuracy and Stability of the Scheme + 󵄩󵄩󵄩󵄩𝑒𝑡𝑛−1 󵄩󵄩󵄩󵄩G ) ,

In this section, we study the accuracy and stability of the 𝐼2 = (𝐹 (𝑢𝑛 , (𝑢𝑛 )̂𝑡) − 𝐹 (𝑢ℎ𝑛 , (𝑢ℎ𝑛 )̂𝑡) , 𝑒𝑛+1 − 𝑒𝑛−1 )
numerical method.
𝑁 𝑟−1
Theorem 6. Suppose 𝑢(𝑥, 𝑡) ∈ 𝐶2,4 ∩ 𝐿2 (0, 𝑇; 𝐻6 ) is the = 𝜏 ∑ ℎ𝑗 ∑ 𝜔𝑘 (𝐹 (𝑢𝑛 , (𝑢𝑛 )̂𝑡) − 𝐹 (𝑢ℎ𝑛 , (𝑢ℎ𝑛 )̂𝑡))
solution of (21), 𝜕𝑢/𝜕𝑡, 𝜕2 𝑢/𝜕𝑡2 ∈ 𝐿2 (0, 𝑇; 𝐻6 ), and 𝑢ℎ𝑛 ∈ 𝑗=1 𝑘=1
M(Δ) (𝑛 = 0, 1, . . . , 𝐽 − 1) is the solution of (16). If 𝑊 :
[0, 𝑇] → M(Δ) is defined by (16), ‖(𝑢ℎ0 − 𝑊0 )𝑡 ‖𝐿2 (Ω) , ‖𝑢ℎ0 − ⋅ (𝑒𝑡𝑛 + 𝑒𝑡𝑛−1 ) .
𝑊0 ‖𝐻1 (Ω) and ‖𝑢ℎ1 − 𝑊1 ‖𝐻2 (Ω) are O(𝜏2 + ℎ4 ), then for 𝜏 and ℎ Using Lemma 5, we can get
sufficiently small one has
󵄨󵄨 𝑛+1 𝑛−1 󵄨󵄨
󵄨󵄨 𝑢𝑛+1 − 𝑢𝑛−1 𝑛 𝑢ℎ − 𝑢ℎ 󵄨
󵄩 󵄩
max 󵄩󵄩𝑢𝑛 − 𝑢ℎ𝑛 󵄩󵄩󵄩𝐿2 (Ω) = O (𝜏2 + ℎ4 ) , 󵄨󵄨𝐹 (𝑢𝑛 ,
󵄨󵄨 ) − 𝐹 (𝑢ℎ , )󵄨󵄨󵄨󵄨
1≤𝑛≤𝐽 󵄩 2𝜏 2𝜏 󵄨󵄨
(22) 󵄨 (27)
𝑛
where 𝑢 (𝑥) = 𝑢(𝑥, 𝑛𝜏) is the exact solution of (21) when 𝑡 = 󵄨 󵄨 1 󵄨 󵄨 󵄨 󵄨 󵄨 󵄨 󵄨 󵄨
≤ 𝐶 [󵄨󵄨󵄨𝑒̂𝑛 − 𝑒𝑛 󵄨󵄨󵄨 + (󵄨󵄨󵄨𝑒̂𝑡𝑛 󵄨󵄨󵄨 + 󵄨󵄨󵄨󵄨𝑒̂𝑡𝑛−1 󵄨󵄨󵄨󵄨 + 󵄨󵄨󵄨𝑒𝑡𝑛 󵄨󵄨󵄨 + 󵄨󵄨󵄨󵄨𝑒𝑡𝑛−1 󵄨󵄨󵄨󵄨)] .
𝑛𝜏. 2
4 Discrete Dynamics in Nature and Society

According to the definition of 𝑊𝑛 , one can easily obtain 𝑒̂𝑥𝑥

𝑛
= If 1/4 ≤ 𝜃 ≤ 1/2, then
𝑛
𝑒̂ . Thus,
󵄩󵄩 𝑛 󵄩󵄩2 𝑛+1 𝑛 𝑛+1 𝑛+1
󵄩󵄩𝑒𝑡 󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥 , 𝑒 )G − 𝜃 (𝑒𝑥𝑥 , 𝑒 )G
󵄩󵄩 𝑛 󵄩󵄩2 󵄩󵄩󵄩 𝑛−1 󵄩󵄩󵄩2 𝑛 𝑛+1 𝑛−1
󵄩󵄩𝑒𝑡 󵄩󵄩G − 󵄩󵄩𝑒𝑡 󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥 , 𝑒 − 𝑒 )
󵄩 󵄩2
− 𝜃 (𝑒𝑥𝑥 , 𝑒 )G ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G
𝑛−1 𝑛+1
(32)
𝑛+1 𝑛+1 𝑛−1 𝑛−1 𝑛+1 𝑛−1
− 𝜃 (𝑒𝑥𝑥 ,𝑒 −𝑒 )− 𝜃 (𝑒𝑥𝑥 ,𝑒 −𝑒 )
1 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2
+ (4𝜃 − 1) (󵄩󵄩󵄩󵄩𝑒𝑥𝑛+1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒𝑥𝑛 󵄩󵄩󵄩G ) ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G ≥ 0.
󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2
≤ 𝐶𝜏 (󵄩󵄩󵄩𝑒̂𝑡𝑡𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒̂𝑡𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒̂𝑡𝑛−1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒̂𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒̂𝑛+1 󵄩󵄩󵄩󵄩G (28) 2
If 0 < 𝜃 < 1/4, by using Sobolev’s inequality and Theorem 4.1
󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2
+ 󵄩󵄩󵄩󵄩𝑒̂𝑛−1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩𝜎𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑡𝑛−1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑛+1 󵄩󵄩󵄩󵄩G in [15], we have
󵄩 󵄩2 󵄩󵄩 𝑛 󵄩󵄩2 𝑛+1 𝑛 𝑛+1 𝑛+1
+ 󵄩󵄩󵄩󵄩𝑒𝑛−1 󵄩󵄩󵄩󵄩G ) . 󵄩󵄩𝑒𝑡 󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥 , 𝑒 )G − 𝜃 (𝑒𝑥𝑥 , 𝑒 )G
󵄩 󵄩2
Applying Lemma 3, we have − 𝜃 (𝑒𝑥𝑥 , 𝑒 )G ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥
𝑛−1 𝑛+1 𝑛+1 𝑛
, 𝑒 )G (33)
󵄩󵄩 1 𝜏 𝜕̂ 𝛼 󵄩󵄩 𝑛 󵄩󵄩2
󵄩󵄩 ̂𝑛 󵄩󵄩 󵄩 𝑒 󵄩󵄩󵄩 ≥ 󵄩𝑒 󵄩 ≥ 0,
󵄩󵄩𝑒𝑡 󵄩󵄩G = 󵄩󵄩󵄩 ∫ (𝑛𝜏 + 𝑠) 𝑑𝑠󵄩󵄩󵄩 2 󵄩 𝑡 󵄩G
󵄩󵄩 𝜏 0 𝜕𝑡 󵄩󵄩G
where 𝛼 is a positive constant.
1 𝜏 󵄩󵄩󵄩 𝜕̂ 𝑒 󵄩󵄩
󵄩
≤ ∫ 󵄩󵄩󵄩 (𝑛𝜏 + 𝑠)󵄩󵄩󵄩 𝑑𝑠 Thus, one can obtain from (30)–(33) that
𝜏 0 󵄩󵄩 𝜕𝑡 󵄩󵄩G
2
󵄩󵄩 𝜕𝑢 󵄩󵄩
󵄩 󵄩 𝜔𝑛 − 𝜔𝑛−1 ≤ 𝜏 (𝜔𝑛 + 𝜔𝑛−1 ) + 𝐶𝜏 (𝜏2 + ℎ4 ) , (34)
≤ 𝐶1 ℎ4 (󵄩󵄩󵄩 󵄩󵄩󵄩 + ‖𝑢‖𝐿∞ (𝐻5 ) ) ≤ 𝐶2 ℎ4 ,
󵄩󵄩 𝜕𝑡 󵄩󵄩𝐿∞ (𝐻6 ) where
󵄩󵄩 ̂𝑛 󵄩󵄩 󵄩󵄩󵄩 1 𝜏 𝜕2 𝑒̂ 󵄩󵄩󵄩 󵄩 󵄩2 󵄩 󵄩2
󵄩 󵄩 𝜔𝑛 = 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑛+1 󵄩󵄩󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥
𝑛+1 𝑛
󵄩󵄩𝑒𝑡𝑡 󵄩󵄩G = 󵄩󵄩󵄩󵄩 𝜏2 ∫−𝜏 (𝜏 − |𝑠|) 𝜕𝑡2 (𝑛𝜏 + 𝑠) 𝑑𝑠󵄩󵄩󵄩󵄩 , 𝑒 )G
(29)
󵄩 󵄩G (35)
𝑛+1 𝑛+1 𝑛
󵄩
1 𝜏 󵄩󵄩 𝜕2 𝑒̂
󵄩󵄩
󵄩 − 𝜃 [(𝑒𝑥𝑥 , 𝑒 )G + (𝑒𝑥𝑥 , 𝑒𝑛 )G ] .
≤ ∫ 󵄩󵄩󵄩󵄩 2 (𝑛𝜏 + 𝑠)󵄩󵄩󵄩󵄩 𝑑𝑠
𝜏 −𝜏 󵄩󵄩 𝜕𝑡 󵄩󵄩G Apply Lemma 4; after simple calculation we get the following
󵄩󵄩 2 󵄩󵄩 󵄩󵄩 𝜕𝑢 󵄩󵄩 inequality:
󵄩𝜕 𝑢󵄩 󵄩 󵄩
≤ 𝐶3 ℎ4 (󵄩󵄩󵄩󵄩 2 󵄩󵄩󵄩󵄩 + 󵄩󵄩󵄩 󵄩󵄩󵄩 + ‖𝑢‖𝐿∞ (𝐻5 ) )
󵄩󵄩 𝜕𝑡 󵄩󵄩𝐿∞ (𝐻6 ) 󵄩󵄩 𝜕𝑡 󵄩󵄩𝐿∞ (𝐻5 ) max 𝜔𝑛
1≤𝑛≤𝐽−1
≤ 𝐶4 ℎ4 , 𝐽−1
2
≤ (𝜔0 + 𝜏 ∑ 𝐶5 (𝜏2 + ℎ4 ) ) exp (𝐶6 (𝐽 − 1) 𝜏) (36)
where 𝐶𝑖 , 𝑖 = 1, . . . , 4, denote constants. It follows from 𝑘=1
Lemma 1 and (28)-(29) that
2
󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 ≤ 𝐶7 [𝜔0 + (𝜏2 + ℎ4 ) ] ,
󵄩󵄩 𝑛 󵄩󵄩2
󵄩󵄩𝑒𝑡 󵄩󵄩G − 󵄩󵄩󵄩󵄩𝑒𝑡𝑛−1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑛+1 󵄩󵄩󵄩󵄩G − 󵄩󵄩󵄩𝑒𝑛 󵄩󵄩󵄩G − (1 − 2𝜃)
where 𝐶5 , 𝐶6 , and 𝐶7 denote constants.
𝑛
⋅ (𝑒𝑥𝑥 , 𝑒𝑛+1 − 𝑒𝑛−1 ) − 𝜃 (𝑒𝑥𝑥
𝑛+1 𝑛+1
, 𝑒 − 𝑒𝑛−1 ) Since 𝜃 > 0, we conclude
󵄩 󵄩2 󵄩 󵄩2 (30) 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2
, 𝑒 − 𝑒𝑛−1 ) ≤ 𝐶𝜏 [󵄩󵄩󵄩󵄩𝑒𝑛+1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑛−1 󵄩󵄩󵄩󵄩G
𝑛−1 𝑛+1
− 𝜃 (𝑒𝑥𝑥 max {󵄩󵄩󵄩󵄩𝑒𝑛+1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑥𝑛+1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩𝑒𝑥𝑛 󵄩󵄩󵄩G }
1≤𝑛≤𝐽−1
(37)
󵄩 󵄩2 󵄩 󵄩2 2
+ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝑒𝑡𝑛−1 󵄩󵄩󵄩󵄩G + O (𝜏2 + ℎ4 ) ] . ≤ 𝐶 (ℎ8 + 𝜏4 ) .

If 𝜃 > 1/2, by using similar arguments in the proof of This implies

Theorem 4.1 in [14], we have 󵄩 󵄩
max 󵄩󵄩𝑒𝑛 󵄩󵄩󵄩G ≤ 𝐶 (ℎ4 + 𝜏2 ) .
1≤𝑛≤𝐽 󵄩
(38)
󵄩󵄩 𝑛 󵄩󵄩2 𝑛+1 𝑛 𝑛+1 𝑛+1
󵄩󵄩𝑒𝑡 󵄩󵄩G − (1 − 2𝜃) (𝑒𝑥𝑥 , 𝑒 )G − 𝜃 (𝑒𝑥𝑥 , 𝑒 )G
These all together yield the following inequality:
󵄩 󵄩2
, 𝑒 )G ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G
𝑛−1 𝑛+1
− 𝜃 (𝑒𝑥𝑥
󵄩 󵄩
max 󵄩󵄩𝑢𝑛 − 𝑢ℎ𝑛 󵄩󵄩󵄩𝐿2 (Ω) ≤ 𝐶 (ℎ4 + 𝜏2 ) = 𝐶 (ℎ4 + 𝜏2 ) . (39)
1 (31) 1≤𝑛≤𝐽 󵄩
󵄩 󵄩2
𝑛+1 𝑛+1
− [(𝑒𝑥𝑥 , 𝑒 )G ] ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G
𝑛−1 𝑛+1
, 𝑒 )G + (𝑒𝑥𝑥
2
1 󵄩󵄩 𝑛+1 󵄩󵄩2 󵄩󵄩 𝑛 󵄩󵄩2 󵄩 󵄩2
+ (󵄩󵄩󵄩𝑒𝑥 󵄩󵄩󵄩G + 󵄩󵄩𝑒𝑥 󵄩󵄩G ) ≥ 󵄩󵄩󵄩𝑒𝑡𝑛 󵄩󵄩󵄩G ≥ 0. In the following theorem, we give the stability of the
2 numerical method.
Discrete Dynamics in Nature and Society 5

Theorem 7. If the conditions of Theorem 6 are satisfied, then Applying Taylor’s theorem, one can get from (2) and (43)
scheme (21) is unconditionally stable.
𝑛
𝑢 (𝑥, 𝜏) = 𝑧 (𝑥) + O (𝜏3 ) ,
Proof. Let 𝜂 (𝑥) be the error of 𝑢ℎ𝑛 (𝑥) and 𝑢̃ℎ𝑛 = 𝑢ℎ𝑛 (𝑥) − 𝜂𝑛 (𝑥).
Then we have 𝑧 (𝑥) = 𝑢0 (𝑡) + 𝜏𝑢1 (𝑡)
1 𝑛+1 𝜏2 𝜕2 𝑢0 𝜕𝑢1
[ (𝜂 − 2𝜂𝑛 + 𝜂𝑛−1 ) − (1 − 2𝜃) 𝜂𝑥𝑥
𝑛
+ [ − − 2 sin (𝑢0 )] (𝑥)
(46)
𝜏2 2 𝜕𝑥2 𝜕𝑡
𝑛+1 𝑛−1
− 𝜃 (𝜂𝑥𝑥 + 𝜂𝑥𝑥 𝑢ℎ𝑛 , (̃
)] (𝜉𝑗,𝑘 ) = [𝐹 (̃ 𝑢ℎ𝑛 )̂𝑡) (40) 𝜏2
− 𝑓 (𝑥, 𝑡) .
2
− 𝐹 (𝑢ℎ𝑛 , (𝑢ℎ𝑛 )̂𝑡)] (𝜉𝑗,𝑘 ) .
Consequently, 𝑢ℎ0 and 𝑢ℎ1 can be prescribed by approximating
𝑢0 (𝑡) and 𝑧(𝑥) using piecewise Hermite cubic interpolations,
Computing the inner product of (40) with (𝜂𝑛+1 − 𝜂𝑛−1 ), we
respectively. In all of the following experiments, we choose
obtain by a similar proof as that of Theorem 6:
𝜃 = 1/4.
󵄩 󵄩
max 󵄩󵄩𝜂𝑛 󵄩󵄩󵄩G ≤ 𝐶𝜔
̃0,
1≤𝑛≤𝐽 󵄩
(41) Example 1. We consider Dirichlet boundary conditions prob-
lem given in [9]. We consider the problem
where
𝜕2 𝑢 𝜕𝑢 𝜕𝑢2
󵄩 󵄩2 󵄩 󵄩2 󵄩 󵄩2 + − + 2 sin (𝑢)
̃ 0 = 󵄩󵄩󵄩󵄩𝜂𝑡0 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝜂1 󵄩󵄩󵄩󵄩G + 󵄩󵄩󵄩󵄩𝜂0 󵄩󵄩󵄩󵄩G − (1 − 2𝜃) (𝜂𝑥𝑥
𝜔 1
, 𝜂0 )G 𝜕𝑡2 𝜕𝑡 𝜕𝑥2
(42) = −𝜋2 (1 + 𝑡 + 𝑡2 ) cos (𝜋𝑥)
1
− 𝜃 (𝜂𝑥𝑥 , 𝜂1 )G − 𝜃 (𝜂𝑥𝑥
0
, 𝜂0 ) G .
+ (3 + 2𝑡) [1 − cos (𝜋𝑥)]
According to [16] and references therein, this theorem
expresses the generalized stability of the numerical scheme. + 2 sin ((1 + 𝑡 + 𝑡2 ) (1 − cos (𝜋𝑥))) ,

𝑥 ∈ (0, 2) , 𝑡 > 0, (47)

4. Numerical Experiments 𝑢 (𝑥, 0) = 1 − cos (𝜋𝑥) ,

𝜕𝑢 󵄨󵄨
In this section, we present some numerical results of our 󵄨
(𝑥, 𝑡)󵄨󵄨󵄨 = 1 − cos (𝜋𝑥) ,
scheme for sine-Gordon equations. We adopt the following 𝜕𝑡 󵄨󵄨𝑡=0
form of (1) for Examples 1 and 2:
𝑥 ∈ (0, 2) ,
2 2
𝜕 𝑢 𝜕𝑢 𝜕 𝑢 𝑢 (0, 𝑡) = 𝑢 (2, 𝑡) = 0, 𝑡 ≥ 0.
+ − + 2 sin (𝑢) = 𝑓 (𝑥, 𝑡) . (43)
𝜕𝑡2 𝜕𝑡 𝜕𝑥2
Its theoretical solution is 𝑢(𝑥, 𝑡) = (1 + 𝑡 + 𝑡2 )[1 − cos(𝜋𝑥)].
According to (21), the corresponding OSC scheme might be We define
written as
𝑁 1/2
1 𝑛+1 𝑛 𝑛−1 𝑢ℎ𝑛+1 − 𝑢ℎ𝑛−1 ‖𝑒‖G = ‖𝑒‖𝑙2 = (∑𝑒𝑖2 ℎ) , (48)
(𝑢 − 2𝑢 + 𝑢 ) +
𝜏2 ℎ ℎ ℎ
2𝜏 𝑖=1

− (1 − 2𝜃) (𝑢ℎ𝑛 )𝑥𝑥 − 𝜃 ((𝑢ℎ𝑛+1 )𝑥𝑥 + (𝑢ℎ𝑛−1 )𝑥𝑥 )
+ 2 sin (𝑢ℎ𝑛 ) = 𝑓 (𝑥, 𝑡) ,
for 𝑗 = 1, 2, . . . , 𝑁, 𝑛 = 0, 1, 2, . . . , 𝐽 − 1, and 𝑘 = 1, 2.
𝑛 𝑇
Setting 𝜑⃗𝑛 = [𝜑̂1𝑛 , 𝜑̂2𝑛 , . . . , 𝜑̂2𝑁 ] and substituting (13) into
(44), one can obtain
𝐴 (𝜑⃗𝑛+1 ) = 𝐵 (𝜑⃗𝑛 ) + 𝐶 (𝜑⃗𝑛−1 ) + 𝐷,
where 𝐴, 𝐵, 𝐶, and 𝐷 are matrices with special structures
commonly known as almost block diagonal, so the system
of algebraic equations (45) could be solved by using the
COLROW algorithm [17].
(44)
where 𝑒𝑖 = 𝑢(𝑥𝑖 ) − 𝑢ℎ (𝑥𝑖 ) and the corresponding relative
error is ‖𝑒‖G /‖𝑢ℎ (𝑥)‖G . The numerical results for the OSC
scheme are given in Table 1. In order to discuss the accuracy
of the method at long time level, we give relative errors
in the brackets. In [9], Cui approximates the second-order
derivative in the space variable by compact finite difference.
Table 2 gives error comparison of the Cui scheme [9] and the
OSC scheme for ℎ = 0.2 and ℎ = 0.05 with 𝜏 = 0.01.
(45)
The rate of convergence of the proposed method can be
calculated from the formula
󵄩 󵄩 󵄩 󵄩
log (󵄩󵄩󵄩󵄩𝑢 − 𝑢ℎ1 󵄩󵄩󵄩󵄩𝐿2 / 󵄩󵄩󵄩󵄩𝑢 − 𝑢ℎ2 󵄩󵄩󵄩󵄩𝐿2 )
𝑝= , (49)
log (ℎ1 /ℎ2 )
6 Discrete Dynamics in Nature and Society

Table 1: Errors of the OSC scheme for Example 1 with 𝜏 = 0.01.

𝜏 ℎ = 0.4 ℎ = 0.2 ℎ = 0.1 ℎ = 0.05

0.005028 2.204825𝑒 − 04 6.071307𝑒 − 05 7.465548𝑒 − 05
1.0
(4.628533𝑒 − 04) (2.028419𝑒 − 05) (5.585379𝑒 − 06) (6.868002𝑒 − 06)
0.018186 9.633026𝑒 − 04 5.469951𝑒 − 05 1.167707𝑒 − 04
2.0
(7.193409𝑒 − 04) (3.808883𝑒 − 05) (2.162769𝑒 − 06) (4.617007𝑒 − 06)
0.038509 0.002078 4.165599𝑒 − 05 8.650306𝑒 − 05
3.0
(8.213101𝑒 − 04) (4.431546𝑒 − 05) (8.884192𝑒 − 07) (1.844895𝑒 − 06)
0.056416 0.003601 1.471193𝑒 − 04 6.140355𝑒 − 05
4.0
(7.459005𝑒 − 04) (4.760212𝑒 − 05) (1.944508𝑒 − 06) (8.115835𝑒 − 07)
0.091717 0.005319 2.522874𝑒 − 04 6.190987𝑒 − 05
5.0
(8.217853𝑒 − 04) (4.766007𝑒 − 05) (2.260542𝑒 − 06) (5.547237𝑒 − 07)
.. .. .. .. ..
. . . . .
0.356359 0.020142 0.001164 8.881136𝑒 − 06
10.0
(8.931951𝑒 − 04) (5.048799𝑒 − 05) (2.910451𝑒 − 06) (2.226086𝑒 − 08)
0.421092 0.023767 0.001461 6.242861𝑒 − 06
11.0
(8.811027𝑒 − 04) (4.972783𝑒 − 05) (2.995216𝑒 − 06) (1.306168𝑒 − 08)
0.485449 0.029326 0.001729 2.427837𝑒 − 05
12.0
(8.606313𝑒 − 04) (5.198519𝑒 − 05) (3.064901𝑒 − 06) (4.303743𝑒 − 08)

Table 2: Relative errors comparison of the Cui scheme and the OSC scheme for Example 1 with 𝜏 = 0.01.

ℎ = 0.2 ℎ = 0.2 ℎ = 0.05 ℎ = 0.05

𝑡
The Cui scheme The OSC scheme The Cui scheme The OSC scheme
0.0018 2.204825𝑒 − 04 1.5975𝑒 − 04 7.465548𝑒 − 05
1.0
(3.3838𝑒 − 04) (2.028419𝑒 − 05) (3.0745𝑒 − 05) (6.868002𝑒 − 06)
0.0054 9.633026𝑒 − 04 5.6131𝑒 − 05 1.167707𝑒 − 04
2.0
(4.4662𝑒 − 04) (3.808883𝑒 − 05) (4.6296𝑒 − 06) (4.617007𝑒 − 06)
0.0111 0.002078 2.4045𝑒 − 05 8.650306𝑒 − 05
3.0
(4.9330𝑒 − 04) (4.431546𝑒 − 05) (1.0679𝑒 − 06) (1.844895𝑒 − 06)
0.0194 0.003601 5.6697𝑒 − 05 6.140355𝑒 − 05
4.0
(5.3439𝑒 − 04) (4.760212𝑒 − 05) (1.5588𝑒 − 06) (8.115835𝑒 − 07)
0.0299 0.005319 1.3121𝑒 − 04 6.190987𝑒 − 05
5.0
(5.5700𝑒 − 04) (4.766007𝑒 − 05) (2.4436𝑒 − 06) (5.547237𝑒 − 07)
.. .. .. .. ..
. . . . .
0.1167 0.020142 4.5183𝑒 − 04 8.881136𝑒 − 06
10.0
(6.0677𝑒 − 04) (5.048799𝑒 − 05) (2.3501𝑒 − 06) (2.226086𝑒 − 08)
0.1413 0.023767 5.4285𝑒 − 04 6.242861𝑒 − 06
11.0
(6.1335𝑒 − 04) (4.972783𝑒 − 05) (2.3565𝑒 − 06) (1.306168𝑒 − 08)
0.1675 0.029326 6.4485𝑒 − 04 2.427837𝑒 − 05
12.0
(6.1597𝑒 − 04) (5.198519𝑒 − 05) (2.3714𝑒 − 06) (4.303743𝑒 − 08)

where ℎ1 , ℎ2 are space steps and the value of 𝑝 is called the
rate of convergence. In Theorem 6, we prove that our
proposed scheme is O(𝜏2 + ℎ4 ). In Figure 1, a comparison
of the OSC scheme with the Cui scheme [9] has been made;
the slope is 4. When the space grid size ℎ is reduced by
1/2 and the time grid size 𝜏 is reduced by 1/4, the error
between the analytic solution and the numerical solution
is reduced by 1/16. Thus the scheme is of fourth-order
accuracy in space and second-order accuracy in time. From
Figure 1, Tables 1 and 2, we can see that the OSC method
is more efficient and accurate than the Cui scheme [9]
though they have the same fourth order in space and
second order in time, and the OSC method has conceptual
simplicity. The space-time graphs of analytical and esti-
mated functions are given in Figure 2 with ℎ = 𝜏 =
0.01.
Discrete Dynamics in Nature and Society 7

Table 3: Errors comparison of the Cui scheme and the OSC scheme for Neumann problem.

ℎ = 0.02 𝜏 = 0.02 ℎ = 0.005 𝜏 = 0.005

𝑡
The Cui scheme The OSC scheme The Cui scheme The OSC scheme
0.0121 2.118839𝑒 − 04 0.0066 1.260930𝑒 − 05
1.0
(0.0329) (5.875168𝑒 − 04) (0.0179) (3.444721𝑒 − 05)
0.0019 2.155475𝑒 − 04 0.0014 1.347026𝑒 − 05
2.0
(0.0141) (0.001625) (0.0103) (1.000319𝑒 − 04)
0.0016 6.177249𝑒 − 05 0.0013 3.785799𝑒 − 06
3.0
(0.0325) (0.001266) (0.0271) (7.642222𝑒 − 05)
0.0021 4.200750𝑒 − 05 3.7009𝑒 − 04 2.592393𝑒 − 06
4.0
(0.1163) (0.002338) (0.0202) (1.422444𝑒 − 04)
8.0692𝑒 − 04 2.568254𝑒 − 05 1.2996𝑒 − 04 1.588930𝑒 − 06
5.0
(0.1198) (0.003886) (0.0193) (2.369950𝑒 − 04)
.. .. .. .. ..
. . . . .
2.4757𝑒 − 05 1.744012𝑒 − 06 4.2271𝑒 − 05 1.057929𝑒 − 07
10.0
(0.5453) (0.038895) (0.9311) (0.002340)
4.4015𝑒 − 05 1.301622𝑒 − 06 1.9435𝑒 − 05 8.210182𝑒 − 08
11.0
(2.6353) (0.079228) (1.1637) (0.004941)
3.2260𝑒 − 05 1.014045𝑒 − 06 5.5229𝑒 − 06 6.173919𝑒 − 08
12.0
(5.2505) (0.171864) (0.8989) (0.010115)

16

14
2
12
1.5
10
u(x, t)
−log(‖e‖∞ )

8 1

6 0.5

4
0
2
2 1.5 2
1 1.5
0 Tim 1
e 0.5 0.5 x
0 0
−2
1 1.5 2 2.5 3 3.5 4 4.5 Estimated
−log(h) Analytical

Cui scheme Figure 2: Space-time graph of the solution for Example 1 up to 𝑡 =

OSC scheme 2.0 with 𝜏 = 0.01 and ℎ = 0.01, analytical solution with blue color
The slope and estimated solution with red color.
Figure 1: Convergence rate of two different schemes for Example 1
in 𝑡 = 2.0. 󵄨󵄨
𝜕𝑢 󵄨
(𝑥, 𝑡)󵄨󵄨󵄨 = − sin (𝜋𝑥) ,
𝜕𝑡 󵄨󵄨𝑡=0
Example 2. We consider the problem with Neumann bound- 𝑥 ∈ [0, 2] ,
ary conditions
𝜕𝑢 𝜕𝑢
𝜕2 𝑢 𝜕𝑢 𝜕2 𝑢 (0, 𝑡) = (2, 𝑡) = 𝜋𝑒−𝑡 , 𝑡 ≥ 0.
+ − + 2 sin (𝑢) 𝜕𝑥 𝜕𝑥
𝜕𝑡2 𝜕𝑡 𝜕𝑥2 (50)
= 𝜋2 𝑒−𝑡 sin (𝜋𝑥) + 2 sin (𝑒−𝑡 sin (𝜋𝑥)) ,
Its theoretical solution is 𝑢(𝑥, 𝑡) = 𝑒−𝑡 sin(𝜋𝑥). Error compar-
𝑥 ∈ (0, 2) , 𝑡 > 0, ison for ℎ = 0.01 and 𝜏 = 0.01 between the OSC scheme
and the Cui scheme is given in Table 3. From Table 3, we
𝑢 (𝑥, 0) = sin (𝜋𝑥) , can see that the OSC scheme is more accurate than the Cui
8 Discrete Dynamics in Nature and Society
0.5
0
−0.5
2
1.5
1.5
1
0.5 1 Modelling, vol. 51, no. 5-6, pp. 537–549, 2010.
0.5
0 [8] Q. B. Xu and Q. S. Chang, “Two implicit difference schemes
Analytical
Estimated
Figure 3: Theoretical solution (red color) and numerical solution
(blue color) for Example 2.
scheme [9] according to their absolute error and relative
error. The theoretical solution and the numerical solution 𝑈𝑗𝑛
with ℎ = 𝜏 = 0.01 are plotted in Figure 3.
5. Conclusion
In this paper, we discuss the generalized nonlinear sine-
Gordon equation. We propose the OSC method to solve this
nonlinear equation. The implementation of the method is
as simple as finite difference methods. The numerical results
given in the previous section demonstrate the accuracy of this
scheme.
Conflict of Interests
The authors declare that there is no conflict of interests
regarding the publication of this paper.
Acknowledgments
This work is partially supported by the National Natural
Science Foundation of China under Grant 11271110, the Key
Programs for Science and Technology of the Education
Department of Henan Province under Grant 12A110007, and
the Scientific Research Funds of Henan University of Science
and Technology.
References
[1] P. J. Olver, Applications of Lie Groups to Differential Equations,
vol. 107 of Graduate Texts in Mathematics, Springer, Berlin,
Germany, 1986.
[2] M. J. Ablowitz and H. Segur, Solitons and the Inverse Scattering
Transforms, SIAM, Philadelphia, Pa, USA, 1981.
[3] R. K. Dodd, J. C. Eilbeck, J. D. Gibbon, and H. C. Morris, Solitons
in Nonlinear Wave Equations, Academic Press, New York, NY,
USA, 1982.
[4] P. G. Drazin and R. S. Johnson, Solitons: An Introduction,
Cambridge University Press, Cambridge, UK, 1989.
[5] A. Q. M. Khaliq, B. Abukhodair, Q. Sheng, and M. S. Ismail,
“A predictor-corrector scheme for the sine-Gordon equation,”
Numerical Methods for Partial Differential Equations, vol. 16, no.
2, pp. 133–146, 2000.
[6] A. G. Bratsos, “A fourth order numerical scheme for the one-
dimensional sine-Gordon equation,” International Journal of
Computer Mathematics, vol. 85, no. 7, pp. 1083–1095, 2008.
[7] A. Mohebbi and M. Dehghan, “High-order solution of one-
dimensional sine-Gordon equation using compact finite dif-
2
ference and DIRKN methods,” Mathematical and Computer
for the generalized nonlinear sine-Gordon equation,” Acta
Mathematicae Applicatae Sinica, vol. 30, no. 2, pp. 263–271, 2007
(Chinese).
[9] M. R. Cui, “Fourth-order compact scheme for the one-
dimensional Sine-Gordon equation,” Numerical Methods for
Partial Differential Equations, vol. 25, no. 3, pp. 685–711, 2009.
[10] B. Bialecki and G. Fairweather, “Orthogonal spline collocation
methods for partial differential equations,” Journal of Compu-
tational and Applied Mathematics, vol. 128, no. 1-2, pp. 55–82,
2001.
[11] J. Douglas Jr. and T. Dupont, Collocation Methods for Parabolic
Equations in a Single Space Variable, vol. 385 of Lecture Notes in
Mathematics, Springer, New York, NY, USA, 1974.
[12] M. P. Robinson and G. Fairweather, “Orthogonal spline collo-
cation methods for Schrödinger-type equations in one space
variable,” Numerische Mathematik, vol. 68, no. 3, pp. 355–376,
1994.
[13] L. M. Zhang, “Convergence of a conservative difference scheme
for a class of Klein-Gordon-Schrödinger equations in one space
dimension,” Applied Mathematics and Computation, vol. 163, no.
1, pp. 343–355, 2005.
[14] Q.-J. Meng, L.-P. Yin, X.-Q. Jin, and F.-L. Qiao, “Numeri-
cal solutions of coupled nonlinear Schrödinger equations by
orthogonal spline collocation method,” Communications in
Computational Physics, vol. 12, no. 5, pp. 1392–1416, 2012.
[15] S.-W. Vong, Q.-J. Meng, and S.-L. Lei, “On a discrete-time
collocation method for the nonlinear Schrödinger equation
with wave operator,” Numerical Methods for Partial Differential
Equations, vol. 29, no. 2, pp. 693–705, 2013.
[16] Z. Fei and L. Vázquez, “Two energy conserving numerical
schemes for the sine-Gordon equation,” Applied Mathematics
and Computation, vol. 45, no. 1, pp. 17–30, 1991.
[17] J. C. Dı́az, G. Fairweather, and P. Keast, “Algorithm 603: COL-
ROW and ARCECO: FORTRAN packages for solving certain
almost block diagonal linear systems by modified alternate row
and column elimination,” ACM Transactions on Mathematical
Software, vol. 9, no. 3, pp. 376–380, 1983.
Advances in Advances in Journal of Journal of
Operations Research
Hindawi Publishing Corporation
Decision Sciences
Hindawi Publishing Corporation
Applied Mathematics
Hindawi Publishing Corporation
Algebra
Hindawi Publishing Corporation
Probability and Statistics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

The Scientific International Journal of

World Journal
Hindawi Publishing Corporation
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Submit your manuscripts at

http://www.hindawi.com

International Journal of Advances in

Combinatorics
Hindawi Publishing Corporation
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Journal of Journal of Mathematical Problems Abstract and Discrete Dynamics in

Complex Analysis
Hindawi Publishing Corporation
Mathematics
Hindawi Publishing Corporation
in Engineering
Hindawi Publishing Corporation
Applied Analysis
Hindawi Publishing Corporation
Nature and Society
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences

Journal of International Journal of Journal of

Hindawi Publishing Corporation Hindawi Publishing Corporation Volume 2014

http://www.hindawi.com
Function Spaces
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com http://www.hindawi.com
Stochastic Analysis
Hindawi Publishing Corporation
Optimization
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014