سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

A one-step algorithm for strongly non-linear full fractional duffing equations

Publish Year: 1403
Type: Journal paper
Language: English
View: 164

This Paper With 19 Page And PDF Format Ready To Download

Export:

Link to this Paper:

Document National Code:

JR_CMDE-12-1_010

Index date: 25 November 2023

A one-step algorithm for strongly non-linear full fractional duffing equations abstract

In the current study, a one-step numerical algorithm is presented to solve strongly non-linear full fractional duffing equations. A new fractional-order operational matrix of integration via  quasi-hat functions (QHFs) is introduced. Utilizing the operational matrices of QHFs, the main problem will be transformed into  a number of univariate polynomial equations. Absolute errors of the results in approximations and convergence analysis are addressed. Ultimately, five examples are provided to illustrate the capabilities of this algorithm. The numerical results are illustrated in some Tables and Figures, for different values of the parameters \alpha~ and~ \beta.

A one-step algorithm for strongly non-linear full fractional duffing equations Keywords:

A one-step algorithm for strongly non-linear full fractional duffing equations authors

Jafar Biazar

Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box ۴۱۳۳۵-۱۹۱۴, P.C.۴۱۹۳۸۲۲۶۹۷, Rasht, Iran.

Hamed Ebrahimi

Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box ۴۱۳۳۵-۱۹۱۴, P.C.۴۱۹۳۸۲۲۶۹۷, Rasht, Iran.