The fastest exact algorithms for the isolation of the real roots of a polynomial equation

DOI10.1007/BF02237816zbMath0428.65028MaRDI QIDQ1137352

S. H. Smith

Publication date: 1980

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsempirical resultspolynomial equationreal rootsinteger arithmeticinteger coefficientsfastest exact algorithmsVincent-Uspensky-Akritas theorem

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real rational functions (26C15)

Related Items

Implementations of a new theorem for computing bounds for positive roots of polynomials, A deterministic algorithm for isolating real roots of a real polynomial, On the computing time of the continued fractions method, Vincent's forgotten theorem, its extension and application, Exact algorithms for polynomial real root approximation using continued fractions, A general approach to isolating roots of a bitstream polynomial, Vincent's theorem of 1836: overview and future research, Global minimization of univariate functions by sequential polynomial approximation, Computationally efficient algorithms for a one-time pad scheme, On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, A converse rule of signs for polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of algorithms for the translation of polynomials
• On the forgotten theorem of Mr. Vincent
• An inequality for the discriminant of a polynomial
• Exact algorithms for the implementation of cauchy's rule
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination