A polynomial is stable if all its roots have negative real part, and unstable otherwise. For a stable polynomial, the distance to the near-est unstable polynomial is an important parameter in control theory for example. In this paper, we focus on this distance called the sta-bility radius of polynomial p. We propose to modify the level contour function of the pseudozero set to derive a bisection algorithm that computes an arbitrary accurate approximation of this stability radius. Numerical simulations and comparisons with pseudozero graphics are here after presented
Analytic expressions are derived for the complex and real stability radii of non-monic polynomial ma...
In this paper we propose a non-linear optimization based approach for the computation of the stabili...
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...
This paper presents a readily computable formula for the real stability radius with respect to an ar...
We consider real polynomials whose coefficients depend polynomially on the elements of an uncertain ...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
A new formulation of thezero exclusion principle is presented and it is applied to thestudy of robus...
Recently, Qiu et al. obtained a computationally attractive formula for the computation of the real s...
. We describe a fast algorithm to compute the real structured stability radius with respect to the o...
A new formulation of the zero exclusion principle is presented and it is applied to the study of rob...
We consider uncertain polynomials whose coefficients depend polynomially on the elements of the para...
A bisection method is developed for computing the distance to instability of quadratic matrix polyno...
Robustness of stability of linear time-invariant systems using the relationship between the structur...
Robustness of stability of linear time-invariant systems using the relationship between the structur...
In this paper we propose a non-linear optimization based approach for the computation of the stabili...
Analytic expressions are derived for the complex and real stability radii of non-monic polynomial ma...
In this paper we propose a non-linear optimization based approach for the computation of the stabili...
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...
This paper presents a readily computable formula for the real stability radius with respect to an ar...
We consider real polynomials whose coefficients depend polynomially on the elements of an uncertain ...
textabstractWe present algorithms to calculate the stability radius of optimal or approximate soluti...
A new formulation of thezero exclusion principle is presented and it is applied to thestudy of robus...
Recently, Qiu et al. obtained a computationally attractive formula for the computation of the real s...
. We describe a fast algorithm to compute the real structured stability radius with respect to the o...
A new formulation of the zero exclusion principle is presented and it is applied to the study of rob...
We consider uncertain polynomials whose coefficients depend polynomially on the elements of the para...
A bisection method is developed for computing the distance to instability of quadratic matrix polyno...
Robustness of stability of linear time-invariant systems using the relationship between the structur...
Robustness of stability of linear time-invariant systems using the relationship between the structur...
In this paper we propose a non-linear optimization based approach for the computation of the stabili...
Analytic expressions are derived for the complex and real stability radii of non-monic polynomial ma...
In this paper we propose a non-linear optimization based approach for the computation of the stabili...
A combinatorial optimization problem is called stable if its solution is preserved under perturbatio...