Implementations of a new theorem for computing bounds for positive roots of polynomials

DOI10.1007/s00607-006-0186-yzbMath1108.65045OpenAlexW2082964526MaRDI QIDQ858189

P. Vigklas, Alkiviadis G. Akritas, Adam Wojciech Strzeboński

Publication date: 8 January 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-006-0186-y

zbMATH Keywords

upper boundsnumerical examplescontinued fractionspolynomial real root isolation

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Convergence and divergence of continued fractions (40A15)

Related Items

Banach function norms via Cauchy polynomials and applications, Complexity of real root isolation using continued fractions, 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, On the computing time of the continued fractions method, Vincent's theorem of 1836: overview and future research, On the complexity of real root isolation using continued fractions, Bounds on absolute positiveness of multivariate polynomials, Real Root Isolation of Regular Chains, A Lower Bound for Computing Lagrange’s Real Root Bound

Cites Work

• Implementations of a new theorem for computing bounds for positive roots of polynomials
• Bounds for positive roots of polynomials
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• Bounds for absolute positiveness of multivariate polynomials
• Unnamed Item