Bounds on absolute positiveness of multivariate polynomials
From MaRDI portal
Publication:972843
DOI10.1016/j.jsc.2010.01.012zbMath1198.26017OpenAlexW1972252297MaRDI QIDQ972843
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)
Related Items (3)
Improved bounds on absolute positiveness of multivariate polynomials ⋮ Quality of positive root bounds ⋮ A Lower Bound for Computing Lagrange’s Real Root Bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Faster algorithms for computing Hong's bound on absolute positiveness
- Bounds for positive roots of polynomials
- Bounds for absolute positiveness of multivariate polynomials
- Testing positiveness of polynomials
- Upperbounds for roots of polynomials
- A Linear Programming Approach to the Synthesis of Fixed-Structure Controllers
This page was built for publication: Bounds on absolute positiveness of multivariate polynomials