An improved algorithm for deciding semi-definite polynomials
DOI10.1016/J.JALGEBRA.2014.06.021zbMATH Open1312.13035OpenAlexW2093743912MaRDI QIDQ404554FDOQ404554
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 decompositiontransfer principlesemi-algebraic subsetregular chainsemi-definite polynomial
Numerical approximation and computational geometry (primarily algorithms) (65D99) Real algebra (13J30) Computational aspects and applications of commutative rings (13P99)
Cites Work
- Associative differential operations
- Algorithms in real algebraic geometry
- Lectures on formally real fields
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On the theories of triangular sets
- On the extension of real places
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- An effective decision method for semidefinite polynomials
- Inner algorithm to test for positive definiteness of arbitrary binary forms
- General procedure for multivariable polynomial positivity test with control applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: An improved algorithm for deciding semi-definite polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404554)
