You are in:Home/Publications/Restrictive Approximation Algorithm for Kuramoto–Sivashinsky Equation

Dr. Fathi Abdessalam Abdessalam Hasan :: Publications:

Title:
Restrictive Approximation Algorithm for Kuramoto–Sivashinsky Equation
Authors: Tamer M. Rageh, Hassan N.A. Ismail, Ghada S.E. Salem and F.A.El-Salam
Year: 2015
Keywords: Kuramoto–Sivashinsky Equation; Restrictive Taylor Approximation; Finite difference; Exponential matrix; Burger’s equation.
Journal: International Journal of Modern Mathematical Sciences
Volume: Volume 14
Issue: Issue 2
Pages: 29 - 38
Publisher: Modern Scientific Press Company, Florida, USA
Local/International: International
Paper Link:
Full paper Fathi Abdessalam Abdessalam Hasan_Restrictive Approximation Algorithm for Kuramoto.pdf
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.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus