An effective decision method for semidefinite polynomials

DOI10.1016/S0747-7171(03)00073-7MaRDI QIDQ1432891zbMATH OpenFDO

Authors Guangxing Zeng, Xiaoning Zeng

Publication date 22 June 2004

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0747-7171(03)00073-7

zbMATH Keywords

computable ordered fieldMaplesemidefiniteness of multivariate polynomials

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Real algebra (13J30) Computational aspects and applications of commutative rings (13P99) Numerical computation of solutions to systems of equations (65H10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved algorithm for deciding semi-definite polynomials
• scientific article; zbMATH DE number 1490029
• scientific article; zbMATH DE number 6310635
• Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method

Cites work

• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• A new decision method for elementary algebra
• General procedure for multivariable polynomial positivity test with control applications
• scientific article; zbMATH DE number 3873454 (Why is no real title available?)
• scientific article; zbMATH DE number 3689524 (Why is no real title available?)
• scientific article; zbMATH DE number 1201576 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 621807 (Why is no real title available?)
• scientific article; zbMATH DE number 1490029 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Inner algorithm to test for positive definiteness of arbitrary binary forms
• On the extension of real places

Cited in

(10)

• Determination of the limits for multivariate rational functions
• Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
• An improved algorithm for deciding semi-definite polynomials
• Algorithms for computing the global infimum and minimum of a polynomial function
• scientific article; zbMATH DE number 1490029 (Why is no real title available?)
• Global minimization of multivariate polynomials using nonstandard methods
• scientific article; zbMATH DE number 6310635 (Why is no real title available?)
• Algorithms to prove the maximum number of MUBs in arbitrary dimension
• Semi-algebraically connected components of minimum points of a polynomial function
• Equality-constrained minimization of polynomial functions

Describes a project that uses

Uses Software

• Maple

This page was built for publication: An effective decision method for semidefinite polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1432891)