Numerical Solutions for Nonlinear Ordinary and Fractional Duffing Equations Using Combined Fibonacci–Lucas Polynomials

Two nonlinear Duffing equations are numerically treated in this article. The nonlinear fractional-order Duffing equations and the second-order nonlinear Duffing equations are handled. Based on the collocation technique, we provide two numerical algorithms. To achieve this goal, a new family of basis functions is built by combining the sets of Fibonacci and Lucas polynomials. Several new formulae for these polynomials are developed. The operational matrices of integer and fractional derivatives of these polynomials, as well as some new theoretical results of these polynomials, are presented and used in conjunction with the collocation method to convert nonlinear Duffing equations into algebraic systems of equations by forcing the equation to hold at certain collocation points. To numerically handle the resultant nonlinear systems, one can use symbolic algebra solvers or Newton’s approach. Some particular inequalities are proved to investigate the convergence analysis. Some numerical examples show that our suggested strategy is effective and accurate. The numerical results demonstrate that the suggested collocation approach yields accurate solutions by utilizing Fibonacci–Lucas polynomials as basis functions.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2025-04-19
DOI
https://doi.org/10.3390/axioms14040314
Citations
3
Primary Topic
Advanced Mathematical Theories and Applications
Type
article
Field-Weighted Citation Impact
3.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Numerical Solutions for Nonlinear Ordinary and Fractional Duffing Equations Using Combined Fibonacci–Lucas Polynomials

Ahmed Gamal Atta, Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, Omar Mazen Alqubori
3 citations
Axioms
Advanced Mathematical Theories and Applications
3.97
article

Numerical Solutions for Nonlinear Ordinary and Fractional Duffing Equations Using Combined Fibonacci–Lucas Polynomials

Ahmed Gamal Atta, Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, Omar Mazen Alqubori
article en
3 citations

Abstract

Two nonlinear Duffing equations are numerically treated in this article. The nonlinear fractional-order Duffing equations and the second-order nonlinear Duffing equations are handled. Based on the collocation technique, we provide two numerical algorithms. To achieve this goal, a new family of basis functions is built by combining the sets of Fibonacci and Lucas polynomials. Several new formulae for these polynomials are developed. The operational matrices of integer and fractional derivatives of these polynomials, as well as some new theoretical results of these polynomials, are presented and used in conjunction with the collocation method to convert nonlinear Duffing equations into algebraic systems of equations by forcing the equation to hold at certain collocation points. To numerically handle the resultant nonlinear systems, one can use symbolic algebra solvers or Newton’s approach. Some particular inequalities are proved to investigate the convergence analysis. Some numerical examples show that our suggested strategy is effective and accurate. The numerical results demonstrate that the suggested collocation approach yields accurate solutions by utilizing Fibonacci–Lucas polynomials as basis functions.

AxiomsVol. 14(4)
Ain Shams University (EG), Cairo University (EG), Umm al-Qura University (SA), University of Jeddah (SA)
Umm Al-Qura University
Openalex Percentile: Top 7%
Advanced Mathematical Theories and Applications
3.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.