این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Numerical Analysis and Optimization، جلد ۱۴، شماره Issue ۳، صفحات ۶۸۱-۷۰۷

عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله

عنوان انگلیسی An improved imperialist competitive algorithm for solving an inverse form of the Huxley equation
چکیده انگلیسی مقاله In this paper, we present an improved imperialist competitive algorithm for solving an inverse form of the Huxley equation, which is a nonlinear partial differential equation. To show the effectiveness of our proposed algorithm, we conducted a comparative analysis with the original imperialist competitive algorithm and a genetic algorithm. The improvement suggested in this study made the original imperialist competitive algorithm a more powerful method for function approximation. The numerical results show that the improved imperialist competitive algorithm is an efficient algorithm for determining the unknown boundary conditions of the Huxley equation and solving the inverse form of nonlinear partial differential equations.
کلیدواژه‌های انگلیسی مقاله Huxley equation, Imperialist Competitive Algorithm, Partial differential equations, Meta-heuristic algorithms, Genetic algorithm

نویسندگان مقاله Hassan Dana Mazraeh |
Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C. Tehran, Iran.

Kourosh Parand |
Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C. Tehran, Iran.

Hadi Farahani |
Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C. Tehran, Iran.

Saeed Reza Kheradpisheh |
Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C. Tehran, Iran.


نشانی اینترنتی https://ijnao.um.ac.ir/article_45160_3412d03ed8e5684be0c07b2fa139fa51.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات