Exact algorithms for polynomial real root approximation using continued fractions

DOI10.1007/BF02253296zbMath0498.65026OpenAlexW198005572MaRDI QIDQ1171358

King H. Ng, Alkiviadis G. Akritas

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253296

zbMATH Keywords

continued fractionsempirical resultsreal rootsexact integer arithmeticVincent's theorempolynomial equation with integer coefficientstheoretical computing time bounds

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems, Vincent's theorem of 1836: overview and future research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of algorithms for the translation of polynomials
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• Vincent's forgotten theorem, its extension and application
• On the forgotten theorem of Mr. Vincent
• An inequality for the discriminant of a polynomial
• On the Budan-Fourier controversy
• Exact algorithms for the implementation of cauchy's rule
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination