2016 21st International Conference on Methods and Models in Automation and Robotics (MMAR) 2016
DOI: 10.1109/mmar.2016.7575247
|View full text |Cite
|
Sign up to set email alerts
|

Implementation issues in discretization of fractional-order derivative using the Al-Alaoui operator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…The next steps of the proof follow the lines of Theorem 1 of [13]. Note that the characteristic equation of system (4) or (5)…”
Section: Resultsmentioning
confidence: 98%
See 2 more Smart Citations
“…The next steps of the proof follow the lines of Theorem 1 of [13]. Note that the characteristic equation of system (4) or (5)…”
Section: Resultsmentioning
confidence: 98%
“…Firstly, the three discretization schemes lead to infinite complexity of rational, discrete-time counterparts of fractional-order derivative. Therefore, in practical applications various finite-length approximations of the discretization operators have been used, involving the most popular finite fractional difference (FFD) approximation in the Euler approach [1,2] and finite-length implementations of the continuous fraction expansion (CFE) method in the Tustin and Al-Alaoui approaches [2][3][4][5][6]. Also, a number of papers have presented some other approximation/discretization methods for the fractional-order derivative [7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation