2018
DOI: 10.1016/j.asej.2016.09.015
|View full text |Cite
|
Sign up to set email alerts
|

Operational matrix based on Genocchi polynomials for solution of delay differential equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 24 publications
(17 citation statements)
references
References 17 publications
0
17
0
Order By: Relevance
“…The classical Genocchi polynomial G m ( ξ ) is defined by means of the exponential generating functions 2teξηeη+1=m=0Gm(ξ)ηmm!,(|η|<π), where Genocchi polynomials of order m are defined on interval [0,1] as Gmfalse(ξfalse)=truek=0m()centerarraymarraykgmkξk, where gk=2Bk2k+1Bk is the Genocchi number and B k is the well‐known Bernoulli number . The first few Genocchi numbers are g0=0,g1=1,g2=1,g4=1,g6=3, where g 2 k +1 =0, k =1,2,….…”
Section: Gwfs and Their Propertiesmentioning
confidence: 65%
See 1 more Smart Citation
“…The classical Genocchi polynomial G m ( ξ ) is defined by means of the exponential generating functions 2teξηeη+1=m=0Gm(ξ)ηmm!,(|η|<π), where Genocchi polynomials of order m are defined on interval [0,1] as Gmfalse(ξfalse)=truek=0m()centerarraymarraykgmkξk, where gk=2Bk2k+1Bk is the Genocchi number and B k is the well‐known Bernoulli number . The first few Genocchi numbers are g0=0,g1=1,g2=1,g4=1,g6=3, where g 2 k +1 =0, k =1,2,….…”
Section: Gwfs and Their Propertiesmentioning
confidence: 65%
“…The classical Genocchi polynomial G m ( ) is defined by means of the exponential generating functions [46][47][48]…”
Section: Genocchi Functionsmentioning
confidence: 99%
“…Since the results were encouraging, we hope to apply this method to Genocchi polynomials. Some of the applications using Genocchi polynomials to solve differential equation problems are shown in [16], and also [17][18][19]. This proposed method is able to reduce the FDWE and FGKE to only solve the linear system of algebraic equations.…”
Section: Introductionmentioning
confidence: 99%
“…It is very important to note that this polynomial shares some great advantages with Bernoulli and Euler polynomials for approximating an arbitrary function over some classical orthogonal polynomials; we refer the reader to [6] for these advantages. On top of that, we 2 International Journal of Differential Equations had successfully applied the operational matrix via Genocchi polynomials for solving integer-order delay differential equations [12] and fractional optimal control problems [13], and the numerical solutions obtained are comparable or even more accurate compared to some existing well-known methods. Motivated by these advantages, in this paper, we intend to extend the result for integer-order delay differential equations in [12] to fractional delay differential equations or so-called generalized fractional pantograph equations.…”
Section: Introductionmentioning
confidence: 99%
“…On top of that, we 2 International Journal of Differential Equations had successfully applied the operational matrix via Genocchi polynomials for solving integer-order delay differential equations [12] and fractional optimal control problems [13], and the numerical solutions obtained are comparable or even more accurate compared to some existing well-known methods. Motivated by these advantages, in this paper, we intend to extend the result for integer-order delay differential equations in [12] to fractional delay differential equations or so-called generalized fractional pantograph equations. To the best of our knowledge, this is the first time that the operational matrix based on Genocchi polynomials is applied to solve the fractional pantograph equations.…”
Section: Introductionmentioning
confidence: 99%