Exact algorithms for polynomial real root approximation using continued fractions

DOI10.1007/BF02253296MaRDI QIDQ1171358zbMATH OpenOpenAlexFDO

Authors Alkiviadis G. Akritas, King H. Ng

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 resultsexact integer arithmeticpolynomial equation with integer coefficientsreal rootstheoretical computing time boundsVincent's theorem

Mathematics Subject Classification ID

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

Cites work

• An inequality for the discriminant of a polynomial
• Exact algorithms for the implementation of cauchy's rule
• scientific article; zbMATH DE number 3648036 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3251532 (Why is no real title available?)
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• On the Budan-Fourier controversy
• On the complexity of algorithms for the translation of polynomials
• On the forgotten theorem of Mr. Vincent
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• Vincent's forgotten theorem, its extension and application

Cited in

(2)

• 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

This page was built for publication: Exact algorithms for polynomial real root approximation using continued fractions

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