2016
DOI: 10.1007/s11075-016-0247-z
|View full text |Cite
|
Sign up to set email alerts
|

Numerical schemes for integro-differential equations with Erdélyi-Kober fractional operator

Abstract: This work investigates several discretizations of the Erdélyi-Kober fractional operator and their use in integro-differential equations. We propose two methods of discretizing E-K operator and prove their errors asymptotic behaviour for several different variants of each discretization. We also determine the exact form of error constants. Next, we construct a finite-difference scheme based on a trapezoidal rule to solve a general first order integro-differential equation. As is known from the theory of Abel in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 54 publications
0
6
0
Order By: Relevance
“…Proof. The asymptotic relation for Erdélyi-Kober fractional integral operator I 0,β α/β was delivered in [37], therefore, we will not provide a detailed proof of it here.…”
Section: Discretization Of the Erdélyi-kober Differential Operatormentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. The asymptotic relation for Erdélyi-Kober fractional integral operator I 0,β α/β was delivered in [37], therefore, we will not provide a detailed proof of it here.…”
Section: Discretization Of the Erdélyi-kober Differential Operatormentioning
confidence: 99%
“…It is worth to mention that in [37] authors proposed different discretization methods of the Erdélyi-Kober fractional integral operator. In addition to the rectangle rule they used also midpoint and trapezoid rule to obtain more accurate approximations.…”
Section: Discretization Of the Erdélyi-kober Differential Operatormentioning
confidence: 99%
See 1 more Smart Citation
“…Using formula (92) from [23] we can numerically check the order of convergence of the numerical scheme. The comparison prepared for both variables represent Table 1 and Table 2.…”
Section: Numerical Examples Example 1 Let Us Take Parametersmentioning
confidence: 99%
“…Recall that for a smooth function, its Newton-Cotes quadrature has an error bounded by the value of a sufficiently high derivative. If the considered function is not smooth enough, the order of the method can be reduced [35,14]. On the other hand, when 0 < m < 1 the Corollary 1 can give very weak estimates on the convergence rate.…”
Section: Construction Of a Quadrature And Numerical Examplesmentioning
confidence: 99%