An implementation of Vincent's theorem

DOI10.1007/BF01395988zbMath0439.65028MaRDI QIDQ1142536

Alkiviadis G. Akritas

Publication date: 1980

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132689

zbMATH Keywords

empirical resultsinteger arithmetic algorithmsreal roots of a polynomialVincent's theorem

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Algorithms in computer science (68W99)

Related Items

Continuous amortization and extensions: with applications to bisection-based root isolation, On the topology and isotopic meshing of plane algebraic curves, Improved bounds for the CF algorithm, Efficient isolation of polynomial's real roots., Vincent's theorem of 1836: overview and future research, On the complexity of real root isolation using continued fractions, Computationally efficient algorithms for a one-time pad scheme, Polynomial real root approximation using continued fractions

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A short note on a new method for polynomial real root isolation
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination