Results 271 to 280 of about 45,161 (304)
Some of the next articles are maybe not open access.
Stability criteria of matrix polynomials
International Journal of Control, 2018ABSTRACTIn this paper, the stability of matrix polynomials is investigated. First, upper and lower bounds are derived for the eigenvalues of a matrix polynomial.
Guangda Hu, Xiulin Hu
openaire +1 more source
Numerical stabilization of polynomial and matrix
IMA Journal of Mathematical Control and Information, 2006In this paper, the conception of numerical stabilization, which is related to mantissa digits of computer and dimensions of system, is described; and several strategies for the numerical stabilization of polynomial and matrix are presented.
J. D. Han, Z. Jiang, Yiyong Nie
openaire +1 more source
Razumikhin-type theorems on polynomial stability of hybrid stochastic systems with pantograph delay [PDF]
Discrete and Continuous Dynamical Systems - Series B, 2020 The main aim of this paper is to investigate the polynomial stability of hybrid stochastic systems with pantograph delay (HSSwPD). By using the Razumikhin technique and Lyapunov functions, we establish several Razumikhin-type theorems on the pth moment ...
Liangjian Hu, Xuerong Mao
exaly +1 more source
Stability of polynomials with conic uncertainty
Mathematics of Control, Signals, and Systems, 1995The stability of polynomials with conic uncertainty is analysed, i.e., a convex cone of directions is known a priori within which the coefficient vector of the nominal polynomial is being perturbed. This corresponds to dropping the requirement in previous work that the convex set be absorbing, i.e., the convex set does not have to contain the origin ...
Diederich Hinrichsen +1 more
openaire +1 more source
On the Optimum Criterion of Polynomial Stability
IMA Journal of Mathematical Control and Information, 1988The purpose of this note is to answer the question raised by \textit{Y. Nie} and \textit{X. Xie} [ibid. 4, No.1, 1-12 (1987; Zbl 0665.93013)]. Let \(f(x)=a_ 0x^ n+a_ 1x^{n-1}+...+a_ n\) be a positive-coefficient polynomial. The numbers \(\alpha_ 1=a_{i-1}a_{i+2}/a_ ia_{i+1}\) \((i=1,...,n-2)\) are called determining coefficients.
Xie, Lang, Xie, Lin
openaire +2 more sources
On Schur stability for families of polynomials
Journal of the Franklin InstitutezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guillermo Oaxaca-Adams +2 more
openaire +1 more source
Stability of polynomial matrices
IEEE Transactions on Automatic Control, 1987A necessary and sufficient condition for the stability of a polynomial matrix in terms of the eigenvalues of a composite matrix is presented. The theorem is significant from the viewpoint of applicability, since standard computer code is available for this test.
Wang, Qing-Guo +2 more
openaire +1 more source
A Structural Approach to Robust Stability of Polynomials
1990 American Control Conference, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the stability of a segment of polynomials
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1994The present article derives, for two stable polynomials of the same degree, a set of necessary and sufficient conditions, in the frequency domain, under which the line segment joining the two given polynomials is stable. The results work for polynomials with complex coefficients as well, while the stability of a convex combination of two polynomials ...
Bollepalli, B. S., Pujara, L. R.
openaire +2 more sources
Stability of matrix polynomials†
International Journal of Control, 1977Abstract The paper considers the following question : Given a square, non-singular polynomial matrix C(s)how do we check, without evaluating the determinant, whether all the zeros of det C(s) are in the open left-half plane ? The approach used to answer this question is to derive from c(s) a rational transfer function matrix which is lossless positive ...
BRIAN D. O. ANDERSON, ROBERT R. BITMEAD
openaire +1 more source