Restrictive Approximation Algorithm for Kuramoto–Sivashinsky Equation
International Journal of Modern Mathematical Sciences USA • 2015
معلومات البحث
المؤلفون
Tamer M. Rageh, Hassan N.A. Ismail
, Ghada S.E. Salem and F.A.El-Salam
الكلمات المفتاحية
Kuramoto–Sivashinsky Equation; Restrictive Taylor Approximation; Finite
difference; Exponential matrix; Burger’s equation.
المجلة العلمية
International Journal of Modern Mathematical Sciences USA
الناشر
Modern Scientific Press Company
المجلد
13
العدد
1
الصفحات
29-38
publication.type
International
رابط البحث
Open Link
المواد المرفقة
Not Available
الملخص
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
أعضاء هيئة التدريس - جامعة بنها