Computational Complexity Results in Parametric Robust Stability Analysis with Power Systems Applications

1995 ◽  
pp. 117-136 ◽  
Author(s):  
Christopher L. Demarco ◽  
Gregory E. Coxson
Keyword(s):  
Stability Analysis ◽  
Computational Complexity ◽  
Power Systems ◽  
Robust Stability ◽  
Complexity Results ◽  
Robust Stability Analysis

Robust stability analysis of uncertain incommensurate fractional order quasi- polynomials in the presence of interval fractional orders and interval coefficients

2020 ◽  
pp. 014233122096896
Author(s):  
Majid Ghorbani ◽  
Mahsan Tavakoli-Kakhki
Keyword(s):  
Stability Analysis ◽  
Computational Complexity ◽  
Fractional Order ◽  
Robust Stability ◽  
General Type ◽  
Value Set ◽  
Interval Uncertainties ◽  
Robust Stability Analysis ◽  
Interval Coefficients ◽  
Fractional Orders

This paper deals with the robust stability analysis of a class of incommensurate fractional order quasi-polynomials with a general type of interval uncertainties. The concept of the general type of interval uncertainties means that all the coefficients and orders of the fractional order quasi-polynomials have interval uncertainties. Generally, the computational complexity of specifying the robust stability of such a quasi-polynomial is shown in this paper. To this end, the robust stability is studied by Principle of Argument theorem. In fact, by presenting two theorems and three lemmas it is shown that the robust stability of a fractional order quasi-polynomial involving the general type of uncertainty can be simply investigated without needing to plot its value set by heavy computations. Examples are attested the validity of the paper results.

Sign in / Sign up

Export Citation Format

Share Document