Theme-Logo
  • Login
  • Home
  • Course
  • Publication
  • Theses
  • Reports
  • Published books
  • Workshops / Conferences
  • Supervised PhD
  • Supervised MSc
  • Supervised projects
  • Education
  • Language skills
  • Positions
  • Memberships and awards
  • Committees
  • Experience
  • Scientific activites
  • In links
  • Outgoinglinks
  • News
  • Gallery
publication name 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 http://modernscientificpress.com/Journals/ViewArticle.aspx?XBq7Uu+HD/8eRjFUGMqlRY8BMWFn0v/h/OlRNSEZ1v91HwMJ3UOkND4uAz/p5yR7
Full paper download
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.

Benha University © 2023 Designed and developed by portal team - Benha University