Staff Members - Benha University
Restrictive Approximation Algorithm for Kuramoto–Sivashinsky Equation
International Journal of Modern Mathematical Sciences USA • 2015
Publication Information
Authors
Tamer M. Rageh, Hassan N.A. Ismail
, Ghada S.E. Salem and F.A.El-Salam
Keywords
Kuramoto–Sivashinsky Equation; Restrictive Taylor Approximation; Finite
difference; Exponential matrix; Burger’s equation.
Journal
International Journal of Modern Mathematical Sciences USA
Publisher
Modern Scientific Press Company
Volume
13
Issue
1
Pages
29-38
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
A new finite difference Algorithm called the Restrictive Taylor Approximation
(RTA) is implemented to find the numerical solution of Kuramoto–Sivashinsky equation
which is nonlinear partial differential equation. This method is a new explicit method. The
accuracy of the method is assessed in terms of the absolute error which is very close to zero.
We solve also Burger’s equation and Viscous Burger equation
(RTA) is implemented to find the numerical solution of Kuramoto–Sivashinsky equation
which is nonlinear partial differential equation. This method is a new explicit method. The
accuracy of the method is assessed in terms of the absolute error which is very close to zero.
We solve also Burger’s equation and Viscous Burger equation