A new polynomial bound and its efficiency

DOI10.1007/978-3-319-24021-3_33MaRDI QIDQ3454563zbMATH OpenOpenAlexFDO

Authors Doru Ştefănescu

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

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 5809462
• Bounds for absolute positiveness of multivariate polynomials
• Quality of positive root bounds
• Computation of bounds for polynomial roots
• Improved bounds on absolute positiveness of multivariate polynomials

Cited in

(9)

• Corrigendum to: ``Faster algorithms for computing Hong's bound on absolute positiveness
• 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
• On Improved Degree Lower Bounds for Polynomial Approximation.
• Characterization of polynomials whose large powers have all positive coefficients
• New degree bounds for polynomial threshold functions
• New polynomial-time algorithms for Camion bases
• Bounds on absolute positiveness of multivariate polynomials

This page was built for publication: A new polynomial bound and its efficiency

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