Isolating real roots of real polynomials

DOI10.1145/1576702.1576737MaRDI QIDQ2883823zbMATH OpenOpenAlexFDO

Authors K. Mehlhorn, Michael Sagraloff

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1576702.1576737

Mathematics Subject Classification ID

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

Recommendations

• A deterministic algorithm for isolating real roots of a real polynomial
• Univariate real root isolation over a single logarithmic extension of real algebraic numbers
• A general approach to isolating roots of a bitstream polynomial
• Computer Algebra in Scientific Computing
• Efficient isolation of polynomial's real roots.

Cited in

(9)

• Theorem of three circles in Coq
• When should a polynomial’s root nearest to a real number be real itself?
• An improved algorithm for real root isolation of univariate polynomials
• scientific article; zbMATH DE number 5524453 (Why is no real title available?)
• scientific article; zbMATH DE number 1253988 (Why is no real title available?)
• Computer Algebra in Scientific Computing
• A deterministic algorithm for isolating real roots of a real polynomial
• A general approach to isolating roots of a bitstream polynomial
• GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems

Describes a project that uses

Uses Software

• ISOLATE
• na20

This page was built for publication: Isolating real roots of real polynomials

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