Results 251 to 260 of about 2,551,252 (290)
Some of the next articles are maybe not open access.

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   +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

Stability of polynomials with conic uncertainty

Mathematics of Control, Signals, and Systems, 1995
The 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   +2 more sources

Stability criteria of matrix polynomials

International Journal of Control, 2018
ABSTRACTIn 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, 2006
In 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   +2 more sources

On the Optimum Criterion of Polynomial Stability

IMA Journal of Mathematical Control and Information, 1988
The 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 Institute
zbMATH 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, 1987
A 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

Stability of matrix polynomials†

International Journal of Control, 1977
Abstract 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

A Structural Approach to Robust Stability of Polynomials

1990 American Control Conference, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy