论文信息 - Test for Lyapunov stability by rational operations

Test for Lyapunov stability by rational operations

The problem of determining the positive definiteness of an arbitrary multivariable polynomial is transformed into an equivalent problem which is solvable by rational operations. Nontrivial examples which illustrate different aspects of the algorithm are given in connection with stability determination via Lyapunov's method.

N. Bose

[1] R. Gadenz,et al. On positive definiteness of quartic forms of two variables , 1964 .

[2] E. Jury,et al. Inner algorithm to test for positive definiteness of arbitrary binary forms , 1975 .

[3] N. Bose,et al. A quadratic form representation of polynomials of several variables and its applications , 1968 .

[4] G. Stewart,et al. The Numerical Factorization of a Polynomial , 1971 .

[5] B. Anderson,et al. Output feedback stabilization and related problems-solution via decision methods , 1975 .

[6] Anthony C. Hearn,et al. REDUCE 2: A system and language for algebraic manipulation , 1971, SYMSAC '71.

[7] C. F. Gummer. The relative distribution of the real roots of a system of polynomials , 1922 .

[8] W. Ku. Explicit criterion for the positive definiteness of a general quartic form , 1965 .

[9] Inequalities of Higher Degree in One Unknown , 1947 .