Results 261 to 270 of about 45,161 (304)

Global stability and stabilization of polynomial systems

2007 46th IEEE Conference on Decision and Control, 2007
The problem of global stability and stabilization of polynomial systems is considered. Using semi-tensor product of matrices, an easily verifiable sufficient condition for the positivity of multi-variable polynomials is proposed. Assume a candidate of Lyapunov function is a polynomial, the above result provides a sufficient condition for the global ...
Daizhan Cheng, Hongsheng Qi
openaire   +1 more source

Stability of switched polynomial systems

2008 27th Chinese Control Conference, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhiqiang Li 0002, Yupeng Qiao, Hongsheng Qi, Daizhan Cheng   +3 more
openaire   +2 more sources

Finite-Time Stability and Stabilization of Polynomial Systems

2023 American Control Conference (ACC), 2023
In this paper we consider the class of polynomial systems and we investigate on their finite-time stability properties. In this analysis, for the first time, finite-time stability is defined with respect to domains with polynomial bounds. A sufficient condition for finite-time stability is obtained, which can be solved recasting the feasibility problem
Tartaglione, Gaetano, Ariola, Marco, Amato, Francesco   +2 more
openaire   +2 more sources

Stability and zeros of a complex polynomial

1993 IEEE International Symposium on Circuits and Systems, 2002
For real polynomials, a stability test algorithm shown by Y. Bistritz (1984) requires about a half of the operations of the Marden-July table method (1964). His method also gives the number of inside the unit circle (IUC) zeros, outside the unit circle (OUC) zeros and on the unit circle (UC) zeros. However, it doesn't work for complex polynomials.
Kaoru Kurosawa, Kouichi Kawabe, Shigeo Tsujii   +2 more
openaire   +1 more source

Stability properties of disk polynomials

Numerical Algorithms, 2020
Zernike polynomials are used in optics to represent wavefronts and describe optical aberrations. Disk polynomials are generalizations of Zernike polynomials for radial weights. In this paper the stability properties of disk polynomials have been analyzed.
Jesús M. Carnicer, Esmeralda Mainar, Juan Manuel Peña 0001   +2 more
openaire   +2 more sources

Robust Schur Stability of Polynomials with Polynomial Parameter Dependency

Multidimensional Systems and Signal Processing, 1999
Robust Schur stability verification for polynomials with coefficients depending polynomially on parameters varying in given intervals is considered. A new algorithm is presented based on the expansion of a multivariate polynomial into Bernstein polynomials and the decomposition of the family of polynomials into its symmetric and its antisymmetric part.
Jürgen Garloff, Birgit Graf
openaire   +1 more source

New Criteria for Polynomial Stability

IMA Journal of Mathematical Control and Information, 1987
New criteria for real-polynomial stability, developed during 1957-1978, are introduced. The real polynomial \(f(x)=a_ 0x^ n+a_ 1x^{n- 1}+...+a_ n\) is called stable if every one of its roots has negative real part. We define determining coefficients \[ \alpha_ i=a_{i- 1}a_{i+2}/a_ ia_{i+1}\quad (i=1,...,n-2), \] for the positive- coefficient polynomial
Nie, Yiyong, Xie, Xukai
openaire   +2 more sources

Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions [PDF]

Fuzzy Sets and Systems, 2011
In this paper, the stability of continuous-time polynomial fuzzy models by means of a polynomial generalization of fuzzy Lyapunov functions is studied.
MIGUEL Bernal, Antonio Sala, Thierry Marie Guerra   +2 more
exaly   +2 more sources

Optimal stability polynomials

Computing, 1972
Stability Polynomials characterize the propagation behaviour of the error vectors associated with the numerical solution of differential equations. It is desirable that these polynomials extend as far as possible along the negativex-axis in a strip of width 2.
openaire   +1 more source

Schur stability of interval polynomials

IEEE Transactions on Automatic Control, 1993
Summary: We present a result for checking the Schur stability of interval polynomials. In particular, we are interested in the number of critical vertex and edge polynomials that are sufficient for inferring robust Schur stability.
Yung Kuan Foo, Yeng Chai Soh
openaire   +1 more source