Algorithms for polynomial real root isolation

MaRDI QIDQ4391224zbMATH OpenFDO

Authors Jeremy R. Johnson

Publication date 1 October 1998

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Parallel algorithms in computer science (68W10) Symbolic computation and algebraic computation (68W30)

Cited in

(20)

• Generic computation of the real closure of an ordered field.
• An efficient method for analyzing the topology of plane real algebraic curves.
• Univariate real root isolation in an extension field and applications
• Separation bounds for polynomial systems
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition
• Complexity in iteration of polynomials
• Krandick's proof of Lagrange's real root bound claim
• On the Davenport-Mahler bound
• New bounds for the Descartes method
• Exact, efficient, and complete arrangement computation for cubic curves
• Near optimal subdivision algorithms for real root isolation
• A symbolic-numerical algorithm for isolating real roots of certain radical expressions
• Continuous amortization and extensions: with applications to bisection-based root isolation
• On the Complexity of Reliable Root Approximation
• On the computing time of the continued fractions method
• On the maximum computing time of the bisection method for real root isolation
• Real solution isolation with multiplicity of zero-dimensional triangular systems
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm
• Nearly optimal refinement of real roots of a univariate polynomial
• Quality of positive root bounds

This page was built for publication: Algorithms for polynomial real root isolation

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