A New Polynomial Bound and Its Efficiency
From MaRDI portal
Publication:3454563
DOI10.1007/978-3-319-24021-3_33zbMath1400.26030OpenAlexW2260408687MaRDI QIDQ3454563
Publication date: 25 November 2015
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24021-3_33
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10)
Related Items (3)
Improved bounds on absolute positiveness of multivariate polynomials ⋮ A Lower Bound for Computing Lagrange’s Real Root Bound ⋮ Computational Aspects of a Bound of Lagrange
This page was built for publication: A New Polynomial Bound and Its Efficiency
