Computational Aspects of a Bound of Lagrange

DOI10.1007/978-3-319-45641-6_32MaRDI QIDQ2830025zbMATH OpenOpenAlexFDO

Authors Doru Ştefănescu

Publication date 9 November 2016

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-45641-6_32

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Computational methods for problems pertaining to field theory (12-08)

Cites work

• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• A New Bound for the Zeros of Polynomials
• A new polynomial bound and its efficiency
• Bounds for absolute positiveness of multivariate polynomials
• Improving the performance of the continued fractions method using new bounds of positive roots
• Krandick's proof of Lagrange's real root bound claim
• New Bounds for the Roots of an Algebraic Equation

Cited in

(2)

• A Lower Bound for Computing Lagrange’s Real Root Bound
• scientific article; zbMATH DE number 2040809 (Why is no real title available?)

This page was built for publication: Computational Aspects of a Bound of Lagrange

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