Inner algorithm to test for positive definiteness of arbitrary binary forms

DOI10.1109/TAC.1975.1100875zbMath0299.93028OpenAlexW2085576987MaRDI QIDQ4054881

N. K. Bose, Eliahu I. Jury

Publication date: 1975

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.1975.1100875

Mathematics Subject Classification ID

Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Numerical methods for ordinary differential equations (65L99)

Related Items (6)

On the Number of Real Quadratic Factors of Polynomials ⋮ An improved algorithm for deciding semi-definite polynomials ⋮ Real polynomials: A test for non-global non-negativity and non-global positivity ⋮ An effective decision method for semidefinite polynomials ⋮ New techniques and results in multidimensional problems ⋮ Characterization of equilibrium sets for bilinear systems with feedback control

This page was built for publication: Inner algorithm to test for positive definiteness of arbitrary binary forms