An improved algorithm for deciding semi-definite polynomials
From MaRDI portal
Publication:404554
DOI10.1016/j.jalgebra.2014.06.021zbMath1312.13035MaRDI QIDQ404554
Shuijing Xiao, Guangxing Zeng, Xiaoning Zeng
Publication date: 4 September 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.06.021
triangular decomposition; transfer principle; semi-algebraic subset; regular chain; semi-definite polynomial
13P99: Computational aspects and applications of commutative rings
65D99: Numerical approximation and computational geometry (primarily algorithms)
13J30: Real algebra
Cites Work
- Lectures on formally real fields
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- On the extension of real places
- An effective decision method for semidefinite polynomials
- On the theories of triangular sets
- Associative differential operations
- Inner algorithm to test for positive definiteness of arbitrary binary forms
- General procedure for multivariable polynomial positivity test with control applications
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item