Bounds for absolute positiveness of multivariate polynomials
From MaRDI portal
Publication:1264464
DOI10.1006/jsco.1997.0189zbMath0913.65013OpenAlexW2089369436MaRDI QIDQ1264464
Publication date: 7 June 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1fa7e1e1b6e148c9ad64d86823421d7524ae1fe1
Symbolic computation and algebraic computation (68W30) Computation of special functions and constants, construction of tables (65D20) Real polynomials: location of zeros (26C10)
Related Items
Real algebraic numbers and polynomial systems of small degree, Complexity of real root isolation using continued fractions, Note on Jacobi's method for approximating dominant roots, Implementations of a new theorem for computing bounds for positive roots of polynomials, Improved bounds for the CF algorithm, Improved bounds on absolute positiveness of multivariate polynomials, Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness, Quality of positive root bounds, Vincent's theorem of 1836: overview and future research, Continued fraction real root isolation using the Hong root bound, Improvements of Lagrange's bound for polynomial roots, On the complexity of real root isolation using continued fractions, Bounds on absolute positiveness of multivariate polynomials, Faster algorithms for computing Hong's bound on absolute positiveness, Logcf: an efficient tool for real root isolation, Unnamed Item, A Lower Bound for Computing Lagrange’s Real Root Bound, Computational Aspects of a Bound of Lagrange, Krandick's proof of Lagrange's real root bound claim
Uses Software
