2012
DOI: 10.1007/s10444-012-9274-z
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of generalized Mittag–Leffler functions on the real line

Abstract: This paper addresses the problem of the numerical computation of generalized Mittag-Leffler functions with two parameters, with applications in fractional calculus. The inversion of their Laplace transform is an effective tool in this direction; however, the choice of the integration contour is crucial. Here parabolic contours are investigated and combined with quadrature rules for the numerical integration. An in-depth error analysis is carried out to select suitable contour's parameters, depending on the par… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
66
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 82 publications
(66 citation statements)
references
References 25 publications
0
66
0
Order By: Relevance
“…In the case of the gamma function, however, f (s) = s −z can have large or small magnitude when z is far in the left or right halfplanes and the contour parameters (15.13) can become less reliable [145]. The same thing was pointed out in the case of the generalized Mittag-Leffler function in [55].…”
Section: Laplace Transforms and Hankel Contours The Laplace Transformentioning
confidence: 70%
See 1 more Smart Citation
“…In the case of the gamma function, however, f (s) = s −z can have large or small magnitude when z is far in the left or right halfplanes and the contour parameters (15.13) can become less reliable [145]. The same thing was pointed out in the case of the generalized Mittag-Leffler function in [55].…”
Section: Laplace Transforms and Hankel Contours The Laplace Transformentioning
confidence: 70%
“…in the special cases α = 1 and α = 1 2 , respectively; see [55] and [118]. By taking a Laplace transform of (16.10), one can derive a contour integral representation and its approximation identical to (16.2) and (16.3), but the transform is now [118] …”
Section: Laplace Transforms and Hankel Contours The Laplace Transformentioning
confidence: 99%
“…However, for a long time, this has been considered only as a theoretical tool because of the lack of effective methods to numerically approximate this function. Only recently have many advances been made for the numerical evaluation of the scalar ML function [26][27][28][29]; the case of matrix arguments has since been analyzed [30,31], and finally a numerical algorithm has been accomplished, which reaches very high accuracies [32]. In this paper, we show the effectiveness of the matrix approach when solving MTFDEs, both in terms of execution time and in terms of accuracy, and also in comparison with some well-established numerical methods.…”
Section: Introductionmentioning
confidence: 93%
“…An efficient algorithm relies on partitioning the complex plane C into different regions, where different approximations, i.e., power series, integral representation and exponential asymptotic for small values of the argument, intermediate values and large values, respectively, are used for efficient numerical computation; see [94] for the some partition and error estimates. The special case of the Mittag-Leffler function E α,β (z) with a real argument z ∈ R, which plays a predominant role in time-fractional diffusion, can also be efficiently computed with the Laplace transform and suitable quadrature rules [27].…”
mentioning
confidence: 99%