Bounds on absolute positiveness of multivariate polynomials
From MaRDI portal
Publication:972843
DOI10.1016/J.JSC.2010.01.012zbMATH Open1198.26017OpenAlexW1972252297MaRDI QIDQ972843FDOQ972843
Publication date: 21 May 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.01.012
Symbolic computation and algebraic computation (68W30) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- 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?)
- Bounds for absolute positiveness of multivariate polynomials
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Faster algorithms for computing Hong's bound on absolute positiveness
- Testing positiveness of polynomials
- Bounds for positive roots of polynomials
- Upperbounds for roots of polynomials
- A Linear Programming Approach to the Synthesis of Fixed-Structure Controllers
Cited In (6)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Bounds for absolute positiveness of multivariate polynomials 👍 👎
- Quality of positive root bounds 👍 👎
- Computation of Sum of Squares Polynomials from Data Points 👍 👎
- A New Polynomial Bound and Its Efficiency 👍 👎
- Improved bounds on absolute positiveness of multivariate polynomials 👍 👎
- Estimations of positive roots of polynomials 👍 👎
- A Lower Bound for Computing Lagrange’s Real Root Bound 👍 👎
- Improved Bounds on Absolute Positiveness of Multivariate Polynomials 👍 👎
- A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials 👍 👎
This page was built for publication: Bounds on absolute positiveness of multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972843)
