Abstract The dynamics of solitary waves is modeled by Sehah is with Program Study of Physics, Faculty of Science and
Engineering, University of Jenderal Soedirman, Jl. dr. Suparno 61 Karangwangkal,
the Korteweg de Vries (KdV) equation. In this work, we seek Purwokerto 53123, INDONESIA. E-mail: sehah@telkom.net/ sehah@unsoed.ac.id
the solution of the KdV equation no perturbation term. We
start by discreetizing the KdV equation using the finite
1
difference method. The discreet form of the KdV equation is 3 sech 2 0 (2)
put into a matrix form. The solution the of matrix is 2
determined using the Gauss-Jordan method. The plot of the set
of the numerical solution shows a wave envelope, which Where and is the speed, which is propotional to
represents the dynamics of the solitary wave. As the wave amplitude. Equation (2) is an exact solution of the KdV equation
envelope (, ) moves away, its amplitude () is found to be representation a non dispersive travelling wave packet [3], [8], [9].
distorted after a certain period of time ( ). This distortion Using some random numbers as input values of speed (), initial
indicates that such a wave packet is not stable. wave packet( , and wave length, computation in MATLAB 7.0
results in some graphical plots (Fig.1 to Fig.6). It can be seen from
Index Terms Solitary waves, Korteweg de Vries, Finite the figures that the height of the packet increases with speed. To
difference, Gauss-Jordan. determine whether it is in fact a soliton requires further evaluation
of the KdV equation that includes time as a parameter. It has
I. INTRODUCTION
been achieved by numerical calculation.
The dynamical model of solitary waves can be represented by
the Korteweg de Vries (KdV) equation [1], [2], [3]. Its
characteristic is determined by modifying the perturbaration term
of the KdV equation [4].
The numerical method which can be used to determined the
solution of the KdV equation is the finite difference method. This
method can minimize the truncation error in the Taylor series. Its
evaluation is done iteratively to make computer programming
convenient[5]. The compulation is accomplished using MATLAB
7.0 due to its simplicity in data computing. It also enable 3-
dimensional data visualization conveniently done[6],[7].
t x xxx (1)
n 1 m, n 1
n
m 1, n m, n m 1, n m 2, n
t
n 1
m, n 1
x
m 1 m m 1
x
Fig. 4 Wave packet with parameter: 2, 0 400, and 800. Fig. 7 Implicit scheme of the finite difference methods
3 (3)
0,
x 3
x t
To make equation (5) appears simple in the next step and are IV. THE NUMERICAL SOLUTION IN GRAPHICAL
defined respectively as , and . Hence, REPRESENTATIONS
the variables of speed , initial wave packet , wavelength
, and time in MATLAB 7.0, some graphical
M 1,n 3 2 M , n 3 2 M 1, n M 2,n M ,n 1
representations are produced (Fig.8 Fig.13). The surface
graphics in the figures depict that the significant changes of wave
These equations constitutes a system of equations, called packet occurs due to time parameter. The series of
iteration formulas, of the KdV equation formulated from its non
graphics shows that the amplitude of envelope wave distorts
linear differential equation from [5],[6],[7],[10]. These iteration
after a long period of time. These solutions have the same
formulas in equation (7) were expressed in matrix for
charecteristics as those in references [2], [5], and [10].
3 2 3
2
1 0 0
1 3 2 2 3 1
0 1 3 2 2 3 0
1
0 0 1 3 2 2 3
1, n
1, n 1 0,n
2, n 2, n 1
Fig. 8. Wave packet with parameter: 1, 0 200, 400, and t 2.
3,n 3,n 1 (8)
M , n 1
M ,n
t x xxx (9)
In the form
x, t x t (10)
1 2 1 1
' 2 3 A B (15)
1,1 1, 2 1,3 1,n
2 2 6
(21)
2,1
2,3
2,n
Where B is a new undetermined constant. By using some 2, 2
C
boundary conditions, i.e: , ' ," 0 to , A 0 in 3,1 3, 2 3, 3 3, n
equation (12), B 0 in equation (13) and
m,2
m ,3
m ,n
m ,1
1
'2 2 (16)
3
The Gauss-Jordan algorithm to find the solution matrix can
Also, by including be done by determining the diagonal elements of matrix A as the
pivot, and then divide all of the rows parallel to the pivot. This
d d (17)
3 procedure makes the diagonal has elements with the value of 1.
3
Subsequently, all of the columns within the pivot are used as an
eliminator by multiplying all elements parallel to the eliminator
Then by using the ansatz
by all elements parallel with to pivot that has the value 1. The
3 sec h 2 (18) results are used to subtract all elements parallel to the pivot.
Their past result are put on the eliminator row. This procedure
And the algebraic principle will make the element in the pivot row has the value of 0. When
this procedure is continued to the next row within the pivot
2 2 (19)
0 d column, it will make all columns within the pivot have 0 values.
These calculation are proceeded for all elements in the A matrix
It is obtained that such that all columns have 0 values except for the pivot, which
has the value of 0. As a results, the A matrix will become an
1 (20) identity matrix. Correspondingly, Bs elements will change.
3 sec h 2 3 0
2 Based on the rule of matrix multiplication, it will be found that A
= B. Thus, matrix B is the solution of the system of linear
APPENDIX B: GAUSS-JORDAN METHODS
The Gauss-Jordan method is an algorithm to solve a system equations.
of linear equations in its matrix representation such that the
solution in found when the matrix becomes an identity matrix. 1 0 0 0 1,1 1,2 1,3 1,n
0 1 2,2 2,3 2,n
From equation (8), a matrix can be arranged with assumptions 2,1
0,n 0 and M m . The index n runs from n 1 to n N for 0 0 3,1 3,2 3,3 3,n
the left matrix and from n 0 to n n for the right one. Then, 1 0
0 0 0 1 m ,1 m,2 m,3 m,n (22)
equation (8) can be written in the form:
1,1
*
1,2
*
1,3
*
1,* n
*
3 3 1 2,1 2,2 2,3 2,* n
2 2
0 0
* *
1 3,1
*
3,2
*
3,3
*
3,* n
0 0
A
1
* m* ,2 m* ,3 m* ,n
2 3 m,1
0 0 1 3 2