Root isolation is the process of constructing pairwise disjoint intervals whose endpoints are rational numbers, such that
each interval contains exactly one real
root of a polynomial and every real
root is contained in one of the intervals. Each
interval is called an isolating interval.
A squarefree factorization first separates roots of different multiplicities.
The intervals can then be found by repeated subdivision
using Sturm's theorem, Descartes'
sign rule, or continued fraction methods.
A bound on root separation
provides a sufficient final interval width. For example,
the two real roots of
are isolated by
An alternative exact representation is a Thom encoding, which identifies a real root by the signs
of the successive derivatives of its polynomial.
See also
Descartes' Sign Rule,
Polynomial Roots,
Real Root,
Root
Separation,
Squarefree Factorization,
Sturm Theorem,
Thom
Encoding
Explore with Wolfram|Alpha
References
Akritas, A. G. and Strzeboński, A. W. "A Comparative Study of Two Real Root Isolation Methods." Nonlinear Anal. Model.
Control 10, 297-304, 2005. https://doi.org/10.15388/NA.2005.10.4.15110.Basu,
S.; Pollack, R.; and Roy, M.-F. Algorithms
in Real Algebraic Geometry, 2nd ed. Berlin, Germany: Springer-Verlag, 2006.Zippel,
R. Effective
Polynomial Computation. Boston, MA: Kluwer, pp. 186-187, 1993.
Cite this as:
Weisstein, Eric W. "Root Isolation." From
MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/RootIsolation.html
Subject classifications