The fastest exact algorithms for the isolation of the real roots of a polynomial equation
From MaRDI portal
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?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
- On the complexity of algorithms for the translation of polynomials
- On the forgotten theorem of Mr. Vincent
Cited in
(11)- A converse rule of signs for polynomials
- Vincent's forgotten theorem, its extension and application
- Exact algorithms for polynomial real root approximation using continued fractions
- Vincent's theorem of 1836: overview and future research
- Computationally efficient algorithms for a one-time pad scheme
- Global minimization of univariate functions by sequential polynomial approximation
- On the computing time of the continued fractions method
- A deterministic algorithm for isolating real roots of a real polynomial
- A general approach to isolating roots of a bitstream polynomial
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Implementations of a new theorem for computing bounds for positive roots of polynomials
This page was built for publication: The fastest exact algorithms for the isolation of the real roots of a polynomial equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137352)