Vincent's Theorem

In mathematics, Vincent's theorem—named after Alexandre Joseph Hidulphe Vincent—is a theorem that isolates the real roots of polynomials with rational coefficients.

Even though Vincent's theorem is the basis of the fastest method for the isolation of the real roots of polynomials, it was almost totally forgotten, having been overshadowed by Sturm's theorem; consequently, it does not appear in any of the classical books on the theory of equations (of the 20th century), except for Uspensky's book. Two variants of this theorem are presented, along with several (continued fractions and bisection) real root isolation methods derived from them.

Sign variation

:Let ''c''₀, ''c''₁, ''c''₂, ... be a finite or infinite sequence of real numbers. Suppose ''l'' < ''r'' and the following conditions hold:
# If ''r'' = ''l''+1 the numbers ''c_l'' and ''c_r'' have opposite signs.
# If ''r'' ≥ ''l''+2 the numbers ''c''_''l''+1, ..., ''c''_''r''−1 are all zero and the numbers ''c_l'' and ''c_r'' have opposite signs.
: This is called a ''sign variation'' or ''sign change'' between the numbers ''c_l'' and ''c_r''.
: When dealing with the polynomial ''p''(''x'') in one variable, one defines the number of sign variations of ''p''(''x'') as the number of sign variations in the sequence of its coefficients.

Two versions of this theorem are presented: the ''continued fractions'' version due to Vincent, and the ''bisection'' version due to Alesina and Galuzzi.

Vincent's theorem: Continued fractions version (1834 and 1836)

If in a polynomial equation with rational coefficients and without multiple roots, one makes successive transformations of the form

: $x = a_1 + \frac,\quad x' = a_2 + \frac,\quad x'' = a_3 + \frac, \ldots$

where $a_1, a_2, a_3,\ldots$ are any positive numbers greater than or equal to one, then after a number of such transformations, the resulting transformed equation either has zero sign variations or it has a single sign variation. In the first case there is no root, whereas in the second case there is a single positive real root. Furthermore, the corresponding root of the proposed equation is approximated by the finite continued fraction:

: $a_1 + \cfrac$

Moreover, if infinitely many numbers $a_1, a_2, a_3,\ldots$ satisfying this property can be found, then the root is represented by the (infinite) corresponding continued fraction.

The above statement is an exact translation of the theorem found in Vincent's original papers; however, the following remarks are needed for a clearer understanding:
*If $f_n(x)$ denotes the polynomial obtained after ''n'' substitutions (and after removing the denominator), then there exists ''N'' such that for all $n\ge N$ either $f_n(x)$ has no sign variation or it has one sign variation. In the latter case $f_n(x)$ has a single positive real root for all $n\ge N$.
* The continued fraction represents a positive root of the original equation, and the original equation may have more than one positive root. Moreover, assuming $a_1 \ge 1$, we can only obtain a root of the original equation that is > 1. To obtain an arbitrary positive root we need to assume that $a_1 \ge 0$.
* Negative roots are obtained by replacing ''x'' by −''x'', in which case the negative roots become positive.

Vincent's theorem: Bisection version (Alesina and Galuzzi 2000)

Let ''p''(''x'') be a real polynomial of degree deg(''p'') that has only simple roots. It is possible to determine a positive quantity δ so that for every pair of positive real numbers ''a'', ''b'' with $, b-a, < \delta$, every transformed polynomial of the form

has exactly 0 or 1 sign variations. The second case is possible if and only if ''p''(''x'') has a single root within (''a'', ''b'').

The Alesina–Galuzzi "a_b roots test"

From equation () the following criterion is obtained for determining whether a polynomial has any roots in the interval (''a'', ''b''):

Perform on ''p''(''x'') the substitution

:$x \leftarrow \frac$

and count the number of sign variations in the sequence of coefficients of the transformed polynomial; this number gives an ''upper bound'' on the number of real roots ''p''(''x'') has inside the open interval (''a'', ''b''). More precisely, the number ''ρ''_''ab''(''p'') of real roots in the open interval (''a'', ''b'')—multiplicities counted—of the polynomial ''p''(''x'') in R 'x'' of degree deg(''p''), is bounded above by the number of sign variations ''var''_''ab''(''p''), where

:$\operatorname_(p) = \operatorname \left ((1+x)^p\left (\frac \right ) \right ),$
:$\operatorname_(p) = \operatorname_(p) \ge \rho_(p).$

As in the case of Descartes' rule of signs if var_''ab''(''p'') = 0 it follows that ρ_''ab''(''p'') = 0 and if var_''ab''(''p'') = 1 it follows that ρ_''ab''(''p'') = 1.

A special case of the Alesina–Galuzzi "a_b roots test" is Budan's "0_1 roots test".

Sketch of a proof

A detailed discussion of Vincent's theorem, its extension, the geometrical interpretation of the transformations involved and three different proofs can be found in the work by Alesina and Galuzzi. A fourth proof is due to Ostrowski who rediscovered a special case of a theorem stated by Obreschkoff, p. 81, in 1920–1923.

To prove (both versions of) Vincent's theorem Alesina and Galuzzi show that after a series of transformations mentioned in the theorem, a polynomial with one positive root eventually has one sign variation. To show this, they use the following corollary to the theorem by Obreschkoff of 1920–1923 mentioned earlier; that is, the following corollary gives the necessary conditions under which a polynomial with one positive root has exactly one sign variation in the sequence of its coefficients; see also the corresponding figure.

:Corollary. ( Obreschkoff's cone or sector theorem, 1920–1923 p. 81): If a real polynomial has one simple root , and all other (possibly multiple) roots lie in the sector
::$S_= \left \$
:then the sequence of its coefficients has exactly one sign variation.

Consider now the Möbius transformation
:$M(x)=\frac, \qquad a,b,c,d \in \mathbb_$
and the three circles shown in the corresponding figure; assume that

*The (yellow) circle
::$\left , x-\tfrac\left(\tfrac + \tfrac \right ) \right , =\tfrac\left (\tfrac - \tfrac \right )$
:whose diameter lies on the real axis, with endpoints and is mapped by the inverse Möbius transformation
::$M^(x)=\frac$
:onto the imaginary axis. For example the point
::$\tfrac\left(\tfrac + \tfrac \right )+\tfrac\left (\tfrac - \tfrac \right )$
:gets mapped onto the point The exterior points get mapped onto the half-plane with .

*The two circles (only their blue crescents are visible) with center
::$\tfrac\left(\tfrac + \tfrac \right ) \pm \tfrac \left (\tfrac - \tfrac \right )$
:and radius
::$\tfrac \left ( \tfrac-\tfrac \right )$
:are mapped by the inverse Möbius transformation
::$M^(x)=\frac$
:onto the lines . For example the point
::$\tfrac \left(\tfrac + \tfrac \right )-\tfrac \left (\tfrac - \tfrac \right )$
:gets mapped to the point
::$\tfrac\left (1-i\sqrt \right ).$
:The exterior points (those outside the eight-shaped figure) get mapped onto the $S_$ sector.

From the above it becomes obvious that if a polynomial has a single positive root inside the eight-shaped figure and all other roots are outside of it, it presents one sign variation in the sequence of its coefficients. This also guarantees the termination of the process.

Historical background

Early applications of Vincent's theorem

In his fundamental papers, Vincent presented examples that show precisely how to use his theorem to isolate real roots of polynomials with continued fractions. However the resulting method had exponential computing time, a fact that mathematicians must have realized then, as was realized by Uspensky p. 136, a century later.

The exponential nature of Vincent's algorithm is due to the way the partial quotients ''a_i'' (in Vincent's theorem) are computed. That is, to compute each partial quotient ''a_i'' (that is, to locate where the roots lie on the ''x''-axis) Vincent uses Budan's theorem as a "no roots test"; in other words, to find the integer part of a root Vincent performs successive substitutions of the form ''x'' ← ''x''+1 and stops only when the polynomials ''p''(''x'') and ''p''(''x''+1) differ in the number of sign variations in the sequence of their coefficients (i.e. when the number of sign variations of ''p''(''x''+1) is decreased).

See the corresponding diagram where the root lies in the interval (5, 6). It can be easily inferred that, if the root is far away from the origin, it takes a lot of time to find its integer part this way, hence the exponential nature of Vincent's method. Below there is an explanation of how this drawback is overcome.

Disappearance of Vincent's theorem

Vincent was the last author in the 19th century to use his theorem for the isolation of the real roots of a polynomial.

The reason for that was the appearance of Sturm's theorem in 1827, which solved the real root isolation problem in polynomial time, by defining the precise number of real roots a polynomial has in a real open interval (''a'', ''b''). The resulting (Sturm's) method for computing the real roots of polynomials has been the only one widely known and used ever since—up to about 1980, when it was replaced (in almost all computer algebra systems) by methods derived from Vincent's theorem, the fastest one being the Vincent–Akritas–Strzeboński (VAS) method.

Serret included in his Algebra, pp 363–368, Vincent's theorem along with its proof and directed all interested readers to Vincent's papers for examples on how it is used. Serret was the last author to mention Vincent's theorem in the 19th century.

Comeback of Vincent's theorem

In the 20th century Vincent's theorem cannot be found in any of the theory of equations books; the only exceptions are the books by Uspensky and Obreschkoff, where in the second there is just the statement of the theorem.

It was in Uspensky's book that Akritas found Vincent's theorem and made it the topic of his Ph.D. Thesis "Vincent's Theorem in Algebraic Manipulation", North Carolina State University, USA, 1978. A major achievement at the time was getting hold of Vincent's original paper of 1836, something that had eluded Uspensky—resulting thus in a great misunderstanding. Vincent's original paper of 1836 was made available to Akritas through the commendable efforts (interlibrary loan) of a librarian in the Library of the University of Wisconsin–Madison, USA.

Real root isolation methods derived from Vincent's theorem

Isolation of the real roots of a polynomial is the process of finding open disjoint intervals such that each contains exactly one real root and every real root is contained in some interval. According to the French school of mathematics of the 19th century, this is the first step in computing the real roots, the second being their approximation to any degree of accuracy; moreover, the focus is on the positive roots, because to isolate the negative roots of the polynomial ''p''(''x'') replace ''x'' by −''x'' (''x'' ← −''x'') and repeat the process.

The continued fractions version of Vincent's theorem can be used to isolate the positive roots of a given polynomial ''p''(''x'') of degree deg(''p''). To see this, represent by the Möbius transformation
:$M(x)=\frac, \qquad a,b,c,d \in \mathbb$
the continued fraction that leads to a transformed polynomial with one sign variation in the sequence of its coefficients. Then, the single positive root of ''f''(''x'') (in the interval (0, ∞)) corresponds to ''that'' positive root of ''p''(''x'') that is in the open interval with endpoints $\frac$ and $\frac$. These endpoints are ''not'' ordered and correspond to ''M''(0) and ''M''(∞) respectively.

Therefore, to isolate the positive roots of a polynomial, all that must be done is to compute—for ''each'' root—the variables ''a'', ''b'', ''c'', ''d'' of the corresponding Möbius transformation
:$M(x)=\frac$
that leads to a transformed polynomial as in equation (), with one sign variation in the sequence of its coefficients.

Crucial Observation: The variables ''a'', ''b'', ''c'', ''d'' of a Möbius transformation
:$M(x)=\frac$
(in Vincent's theorem) leading to a transformed polynomial—as in equation ()—with one sign variation in the sequence of its coefficients can be computed:
*either by ''continued fractions'', leading to the '' Vincent–Akritas–Strzebonski (VAS)'' continued fractions method,
*or by ''bisection'', leading to (among others) the '' Vincent–Collins–Akritas (VCA)'' bisection method.

The "bisection part" of this all important observation appeared as a special theorem in the papers by Alesina and Galuzzi.

All methods described below (see the article on Budan's theorem for their historical background) need to compute (once) an upper bound, ''ub'', on the values of the positive roots of the polynomial under consideration. Exception is the VAS method where additionally lower bounds, ''lb'', must be computed at almost every cycle of the main loop. To compute the lower bound ''lb'' of the polynomial ''p''(''x'') compute the upper bound ''ub'' of the polynomial $x^p\left (\frac \right )$ and set $lb = \frac$.

Excellent (upper and lower) bounds on the values of just the positive roots of polynomials have been developed by Akritas, Strzeboński and Vigklas based on previous work by Doru Stefanescu. They are described in P. S. Vigklas' Ph.D. Thesis and elsewhere. These bounds have already been implemented in the computer algebra systems Mathematica, SageMath, SymPy, Xcas etc.

All three methods described below follow the excellent presentation of François Boulier, p. 24.

Continued fractions method

Only one continued fractions method derives from Vincent's theorem. As stated above, it started in the 1830s when Vincent presented, in the papers several examples that show how to use his theorem to isolate the real roots of polynomials with continued fractions. However the resulting method had exponential computing time. Below is an explanation of how this method evolved.

Vincent–Akritas–Strzeboński (VAS, 2005)

This is the second method (after VCA) developed to handle the exponential behavior of Vincent's method.

The VAS continued fractions method is a ''direct'' implementation of Vincent's theorem. It was originally presented by Vincent from 1834 to 1938 in the papers in a exponential form; namely, Vincent computed each partial quotient ''a_i'' by a series of ''unit'' increments ''a_i'' ← ''a_i'' + 1, which are equivalent to substitutions of the form ''x'' ← ''x'' + 1.

Vincent's method was converted into its polynomial complexity form by Akritas, who in his 1978 Ph.D. Thesis (''Vincent's theorem in algebraic manipulation'', North Carolina State University, USA) computed each partial quotient ''a_i'' as the lower bound, ''lb'', on the values of the positive roots of a polynomial. This is called the ''ideal'' positive lower root bound that computes the integer part of the smallest positive root (see the corresponding figure). To wit, now set ''a_i'' ← ''lb'' or, equivalently, perform the substitution ''x'' ← ''x'' + ''lb'', which takes about the same time as the substitution ''x'' ← ''x'' + 1.

Finally, since the ideal positive lower root bound does not exist, Strzeboński introduced in 2005 the substitution $x \leftarrow lb_*x$, whenever $lb_>16$; in general $lb > lb_$ and the value 16 was determined experimentally. Moreover, it has been shown that the VAS (continued fractions) method is faster than the fastest implementation of the VCA (bisection) method, a fact that was confirmed independently; more precisely, for the Mignotte polynomials of high degree VAS is about 50,000 times faster than the fastest implementation of VCA.

In 2007, Sharma removed the hypothesis of the ideal positive lower bound and proved that VAS is still polynomial in time.

VAS is the default algorithm for root isolation in Mathematica, SageMath, SymPy, Xcas.

For a comparison between Sturm's method and VAS use the functions realroot(poly) and time(realroot(poly)) of Xcas. By default, to isolate the real roots of poly realroot uses the VAS method; to use Sturm's method write realroot(sturm, poly). See also the External links for an application by A. Berkakis for Android devices that does the same thing.

Here is how VAS(''p'', ''M'') works, where for simplicity Strzeboński's contribution is not included:
*Let ''p''(''x'') be a polynomial of degree deg(''p'') such that ''p''(0) ≠ 0. To isolate its positive roots, associate with ''p''(''x'') the Möbius transformation ''M''(''x'') = ''x'' and repeat the following steps while there are pairs to be processed.
*Use Descartes' rule of signs on ''p''(''x'') to compute, if possible, (using the number ''var'' of sign variations in the sequence of its coefficients) the number of its roots inside the interval (0, ∞). If there are no roots return the empty set, ∅ whereas if there is one root return the interval (''a'', ''b''), where ''a'' = min(''M''(0), ''M''(∞)), and ''b'' = max(''M''(0), ''M''(∞)); if ''b'' = ∞ set ''b'' = ''ub'', where ''ub'' is an upper bound on the values of the positive roots of ''p''(''x'').
*If there are two or more sign variations Descartes' rule of signs implies that there may be zero, one or more real roots inside the interval (0, ∞); in this case consider separately the roots of ''p''(''x'') that lie inside the interval (0, 1) from those inside the interval (1, ∞). A special test must be made for 1.
**To guarantee that there are roots inside the interval (0, 1) the ideal lower bound, ''lb'' is used; that is the integer part of the smallest positive root is computed with the help of the lower bound, $lb_$, on the values of the positive roots of ''p''(''x''). If $lb_>1$, the substitution $x \leftarrow x+lb_$ is performed to ''p''(''x'') and ''M''(''x''), whereas if $lb_ \le 1$ use substitution(s) ''x'' ← ''x''+1 to find the integer part of the root(s).
**To compute the roots inside the interval (0, 1) perform the substitution $x \leftarrow \frac$ to ''p''(''x'') and ''M''(''x'') and process the pair
:::$\left \,$
::whereas to compute the roots in the interval (1, ∞) perform the substitution ''x'' ← ''x'' + 1 to ''p''(''x'') and ''M''(''x'') and process the pair . It may well turn out that 1 is a root of ''p''(''x''), in which case, ''M''(1) is a root of the original polynomial and the isolation interval reduces to a point.

Below is a recursive presentation of VAS(''p'', ''M'').

VAS(''p'', ''M''):

Input: A univariate, square-free polynomial p(x) \in \mathbb p(0) \neq 0, of degree deg(''p''), and the Möbius transformation
:$M(x)= \frac=x, \qquad a, b, c, d \in \mathbb.$
Output: A list of isolating intervals of the positive roots of ''p''(''x'').

1 ''var'' ← the number of sign variations of ''p''(''x'') // Descartes' rule of signs;
2 if ''var'' = 0 then RETURN ∅;
3 if ''var'' = 1 then RETURN // ''a'' = min(''M''(0), ''M''(∞)), ''b'' = max(''M''(0), ''M''(∞)), but if ''b'' = ∞ set ''b'' = ''ub'', where ''ub'' is an upper bound on the values of the positive roots of ''p''(''x'');
4 ''lb'' ← the ''ideal'' lower bound on the positive roots of ''p''(''x'');
5 if ''lb'' ≥ 1 then ''p'' ← ''p''(''x'' + ''lb''), ''M'' ← ''M''(''x'' + ''lb'');
6 ''p''₀₁ ← (''x'' + 1)^deg(''p'') ''p''(), ''M''₀₁ ← ''M''() // Look for real roots in (0, 1);
7 ''m'' ← ''M''(1) // Is 1 a root?
8 ''p''_1∞ ← ''p''(''x'' + 1), ''M''_1∞ ← ''M''(''x'' + 1) // Look for real roots in (1, ∞);
9 if ''p''(1) ≠ 0 then
10 RETURN VAS(''p''₀₁, ''M''₀₁) ∪ VAS(''p''_1∞, ''M''_1∞)
11 else
12 RETURN VAS(''p''₀₁, ''M''₀₁) ∪ ∪ VAS(''p''_1∞, ''M''_1∞)
13 end

Remarks
*For simplicity Strzeboński's contribution is not included.
*In the above algorithm with each polynomial there is associated a Möbius transformation ''M''(''x'').
*In line 1 Descartes' rule of signs is applied.
*If lines 4 and 5 are removed from VAS(''p'', ''M'') the resulting algorithm is Vincent's exponential one.
*Any substitution performed on the polynomial ''p''(''x'') is also performed on the associated Möbius transformation ''M''(''x'') (lines 5 6 and 8).
*The isolating intervals are computed from the Möbius transformation in line 3, except for integer roots computed in line 7 (also 12).

Example of VAS(''p'', ''M'')

We apply the VAS method to (note that: ).

Iteration 1

VAS(''x''³ − 7''x'' + 7, ''x'')
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of ''p''(''x'') = ''x''³ − 7''x'' + 7
4 ''lb'' ← 1 // the ideal lower bound—found using ''lb_computed'' and substitution(s) ''x'' ← ''x'' + 1
5 ''p'' ← ''x''³ + 3''x''² − 4''x'' + 1, ''M'' ← ''x'' + 1
6 ''p''₀₁ ← ''x''³ − ''x''² − 2''x'' + 1, ''M''₀₁ ←
7 ''m'' ← 1
8 ''p''_1∞ ← ''x''³ + 6''x''² + 5''x'' + 1, ''M''_1∞ ← ''x'' + 2
10 RETURN VAS(''x''³ − ''x''² − 2''x'' + 1, ) ∪ VAS(''x''³ + 6''x''² + 5''x'' + 1, ''x'' + 2)

List of isolation intervals:

List of pairs to be processed:
:$\left \.$
Remove the first and process it.

Iteration 2

VAS(''x''³ − ''x''² − 2''x'' + 1, )
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of ''p''(''x'') = ''x''³ − ''x''² − 2''x'' + 1
4 ''lb'' ← 0 // the ideal lower bound—found using ''lb_computed'' and substitution(s) ''x'' ← ''x'' + 1
6 ''p''₀₁ ← ''x''³ + ''x''² − 2''x'' − 1, ''M''₀₁ ←
7 ''m'' ←
8 ''p''_1∞ ← ''x''³ + 2''x''² − ''x'' − 1, ''M''_1∞ ←
10 RETURN VAS(''x''³ + ''x''² − 2''x'' − 1, ) ∪ VAS(''x''³ + 2''x''² − ''x'' − 1, )

List of isolation intervals:

List of pairs to be processed:
:$\left \.$
Remove the first and process it.

Iteration 3

VAS(''x''³ + ''x''² − 2''x'' − 1, )
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of ''p''(''x'') = ''x''³ + ''x''² − 2''x'' − 1
3 RETURN

List of isolation intervals:

List of pairs to be processed:
:$\left \.$
Remove the first and process it.

Iteration 4

VAS(''x''³ + 2''x''² − ''x'' − 1, )
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of ''p''(''x'') = ''x''³ + 2''x''² − ''x'' − 1
3 RETURN

List of isolation intervals:

List of pairs to be processed:
:$\left \.$
Remove the first and process it.

Iteration 5

VAS(''x''³ + 6''x''² + 5''x'' + 1, ''x'' + 2)
1 ''var'' ← 0 // the number of sign variations in the sequence of coefficients of ''p''(''x'') = ''x''³ + 6''x''² + 5''x'' + 1
2 RETURN ∅

List of isolation intervals:

List of pairs to be processed: .

Finished.

Conclusion

Therefore, the two positive roots of the polynomial lie inside the isolation intervals and }. Each root can be approximated by (for example) bisecting the isolation interval it lies in until the difference of the endpoints is smaller than ; following this approach, the roots turn out to be and .

Bisection methods

There are various bisection methods derived from Vincent's theorem; they are all presented and compared elsewhere. Here the two most important of them are described, namely, the Vincent–Collins–Akritas (VCA) method and the Vincent–Alesina–Galuzzi (VAG) method.

The Vincent–Alesina–Galuzzi (VAG) method is the simplest of all methods derived from Vincent's theorem but has the most time consuming test (in line 1) to determine if a polynomial has roots in the interval of interest; this makes it the slowest of the methods presented in this article.

By contrast, the Vincent–Collins–Akritas (VCA) method is more complex but uses a simpler test (in line 1) than VAG. This along with certain improvements have made VCA the fastest bisection method.

Vincent–Collins–Akritas (VCA, 1976)

This was the first method developed to overcome the exponential nature of Vincent's original approach, and has had quite an interesting history as far as its name is concerned. This method, which isolates the real roots, using Descartes' rule of signs and Vincent's theorem, had been originally called ''modified Uspensky's algorithm'' by its inventors Collins and Akritas. After going through names like "Collins–Akritas method" and "Descartes' method" (too confusing if ones considers Fourier's article), it was finally François Boulier, of Lille University, who gave it the name ''Vincent–Collins–Akritas'' (VCA) method, p. 24, based on the fact that "Uspensky's method" does not exist and neither does "Descartes' method". The best implementation of this method is due to Rouillier and Zimmerman, and to this date, it is the fastest bisection method. It has the same worst case complexity as Sturm's algorithm, but is almost always much faster. It has been implemented in Maple's RootFinding package.

Here is how VCA(''p'', (''a'', ''b'')) works:

*Given a polynomial ''p''_orig(''x'') of degree deg(''p''), such that ''p''_orig(0) ≠ 0, whose positive roots must be isolated, first compute an upper bound, ''ub'' on the values of these positive roots and set ''p''(''x'') = ''p''_orig(''ub'' * ''x'') and (''a'', ''b'') = (0, ''ub''). The positive roots of ''p''(''x'') all lie in the interval (0, 1) and there is a bijection between them and the roots of ''p''_orig(''x''), which all lie in the interval (''a'', ''b'') = (0, ''ub'') (see the corresponding figure); this bijection is expressed by ''α''_{(''a'',''b'')} = ''a'' +''α''_(0,1)(''b'' − ''a''). Likewise, there is a bijection between the intervals (0, 1) and (0, ''ub'').

*Repeat the following steps while there are pairs to be processed.
*Use Budan's "0_1 roots test" on ''p''(''x'') to compute (using the number ''var'' of sign variations in the sequence of its coefficients) the number of its roots inside the interval (0, 1). If there are no roots return the empty set, ∅ and if there is one root return the interval (''a'', ''b'').
*If there are two or more sign variations Budan's "0_1 roots test" implies that there may be zero, one, two or more real roots inside the interval (0, 1). In this case cut it in half and consider separately the roots of ''p''(''x'') inside the interval (0, )—and that correspond to the roots of ''p''_orig(''x'') inside the interval (''a'', (''a'' + ''b'')) from those inside the interval (, 1) and correspond to the roots of ''p''_orig(''x'') inside the interval ((''a'' + ''b''), ''b''); that is, process, respectively, the pairs

::$\left \, \quad \left \$

:(see the corresponding figure). It may well turn out that is a root of ''p''(''x''), in which case (''a'' + ''b'') is a root of ''p''_orig(''x'') and the isolation interval reduces to a point.

Below is a recursive presentation of the original algorithm VCA(''p'', (''a'', ''b'')).

VCA(''p'', (''a'', ''b''))

Input: A univariate, square-free polynomial ''p''(''ub'' * ''x'') ∈ Z 'x'' ''p''(0) ≠ 0 of degree deg(''p''), and the open interval (''a'', ''b'') = (0, ''ub''), where ''ub'' is an upper bound on the values of the positive roots of ''p''(''x''). (The positive roots of ''p''(''ub'' * ''x'') are all in the open interval (0, 1)).

Output: A list of isolating intervals of the positive roots of ''p''(''x'')

1 ''var'' ← the number of sign variations of (''x'' + 1)^deg(''p'')''p''() // Budan's "0_1 roots test";
2 if ''var'' = 0 then RETURN ∅;
3 if ''var'' = 1 then RETURN ;
4 ''p''₀ ← 2^deg(''p'')''p''() // Look for real roots in (0, );
5 ''m'' ← (''a'' + ''b'') // Is a root?
6 ''p''₁ ← 2^deg(''p'')''p''() // Look for real roots in (, 1);
7 if ''p''() ≠ 0 then
8 RETURN VCA (''p''₀, (''a'', ''m'')) ∪ VCA (''p''₁, (''m'', ''b''))
9 else
10 RETURN VCA (''p''₀, (''a'', ''m'')) ∪ ∪ VCA (''p''₁, (''m'', ''b''))
11 end

Remark
*In the above algorithm with each polynomial there is associated an interval (''a'', ''b''). As shown elsewhere, p. 11, a Möbius transformation can also be associated with each polynomial in which case VCA looks more like VAS.
*In line 1 Budan's "0_1 roots test" is applied.

Example of VCA(''p'', (''a'',''b''))

Given the polynomial and considering as an upper bound on the values of the positive roots the arguments of the VCA method are: and .

Iteration 1

1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 7''x''³ − 7''x''² − 35''x'' + 43
4 ''p''₀ ← 64''x''³ − 112''x'' + 56
5 ''m'' ← 2
6 ''p''₁ ← 64''x''³ + 192''x''² + 80''x'' + 8
7 ''p''() = 1
8 RETURN VCA(64''x''³ − 112''x'' + 56, (0, 2)) ∪ VCA(64''x''³ + 192''x''² + 80''x'' + 8, (2, 4))

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 2

VCA(64''x''³ − 112''x'' + 56, (0, 2))
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 56''x''³ + 56''x''² − 56''x'' + 8
4 ''p''₀ ← 64''x''³ − 448''x'' + 448
5 ''m'' ← 1
6 ''p''₁ ← 64''x''³ + 192''x''² − 256''x'' + 64
7 ''p''() = 8
8 RETURN VCA(64''x''³ − 448''x'' + 448, (0, 1)) ∪ VCA(64''x''³ + 192''x''² − 256''x'' + 64, (1, 2))

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 3

VCA(64''x''³ − 448''x'' + 448, (0, 1))
1 ''var'' ← 0 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 448''x''³ + 896''x''² + 448''x'' + 64
2 RETURN ∅

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 4

VCA(64''x''³ + 192''x''² − 256''x'' + 64, (1, 2))
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 64''x''³ − 64''x''² − 128''x'' + 64
4 ''p''₀ ← 64''x''³ + 384''x''² − 1024''x'' + 512
5 ''m'' ←
6 ''p''₁ ← 64''x''³ + 576''x''² − 64''x'' + 64
7 ''p''() = −8
8 RETURN VCA(64''x''³ + 384''x''² − 1024''x'' + 512, (1, )) ∪ VCA(64''x''³ + 576''x''² − 64''x'' − 64, (, 2))

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 5

VCA(64''x''³ + 384''x''² − 1024''x'' + 512, (1, ))
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 512''x''³ + 512''x''² − 128''x'' − 64
3 RETURN

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 6

VCA(64''x''³ + 576''x''² − 64''x'' − 64, (, 2))
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = −64''x''³ − 256''x''² + 256''x'' + 512
3 RETURN

List of isolation intervals:

List of pairs to be processed:
:$\left \.$

Remove the first and process it.

Iteration 7

VCA(64''x''³ + 192''x''² + 80''x'' + 8, (2, 4))
1 ''var'' ← 0 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 8''x''³ + 104''x''² + 376''x'' + 344
2 RETURN ∅

List of isolation intervals:

List of pairs to be processed: .

Finished.

Conclusion

Therefore, the two positive roots of the polynomial lie inside the isolation intervals and }. Each root can be approximated by (for example) bisecting the isolation interval it lies in until the difference of the endpoints is smaller than ; following this approach, the roots turn out to be and .

Vincent–Alesina–Galuzzi (VAG, 2000)

This was developed last and is the simplest real root isolation method derived from Vincent's theorem.

Here is how VAG(''p'', (''a'', ''b'')) works:
*Given a polynomial ''p''(''x'') of degree deg(''p''), such that ''p''(0) ≠ 0, whose positive roots must be isolated, first compute an upper bound, ''ub'' on the values of these positive roots and set (''a'', ''b'') = (0, ''ub''). The positive roots of ''p''(''x'') all lie in the interval (''a'', ''b'').
*Repeat the following steps while there are intervals (''a'', ''b'') to be processed; in this case the polynomial ''p''(''x'') stays the same.
*Use the Alesina–Galuzzi "a_b roots test" on ''p''(''x'') to compute (using the number ''var'' of sign variations in the sequence of its coefficients) the number of its roots inside the interval (''a'', ''b''). If there are no roots return the empty set, ∅ and if there is one root return the interval (''a'', ''b'').
*If there are two or more sign variations the Alesina–Galuzzi "a_b roots test" implies that there may be zero, one, two or more real roots inside the interval (''a'', ''b''). In this case cut it in half and consider separately the roots of ''p''(''x'') inside the interval (''a'', (''a'' + ''b'')) from those inside the interval ((''a'' + ''b''), ''b''); that is, process, respectively, the intervals (''a'', (''a'' + ''b'')) and ((''a'' + ''b''), ''b''). It may well turn out that (''a'' + ''b'') is a root of ''p''(''x''), in which case the isolation interval reduces to a point.

Below is a recursive presentation of VAG(''p'', (''a'', ''b'')).

VAG(''p'', (''a'', ''b''))

Input: A univariate, square-free polynomial ''p''(''x'') ∈ Z 'x'' ''p''(0) ≠ 0 of degree deg(''p'') and the open interval (''a'', ''b'') = (0, ''ub''), where ''ub'' is an upper bound on the values of the positive roots of ''p''(''x'').

Output: A list of isolating intervals of the positive roots of ''p''(''x'').

1 ''var'' ← the number of sign variations of (''x'' + 1)^deg(''p'') ''p''() // The Alesina–Galuzzi "a_b roots test";
2 if ''var'' = 0 then RETURN ∅;
3 if ''var'' = 1 then RETURN ;
4 ''m'' ← (''a'' + ''b'') // Subdivide the interval (''a'', ''b'') in two equal parts;
5 if ''p''(''m'') ≠ 0 then
6 RETURN VAG(''p'', (''a'', ''m'')) ∪ VAG(''p'', (''m'', ''b''))
7 else
8 RETURN VAG(''p'', (''a'', ''m'')) ∪ ∪ VAG(''p'', (''m'', ''b''))
9 end

Remarks
*Compared to VCA the above algorithm is extremely simple; by contrast, VAG uses the time consuming "a_b roots test" and that makes it much slower than VCA.
*As Alesina and Galuzzi point out, p. 189, there is a variant of this algorithm due to Donato Saeli. Saeli suggested that the ''mediant'' of the endpoints be used instead of their midpoint . However, it has been shown that using the mediant of the endpoints is in general much slower than the "mid-point" version.

Example of VAG(''p'', (''a'',''b''))

Given the polynomial ''p''(''x'') = ''x''³ − 7''x'' + 7 and considering as an upper bound on the values of the positive roots ''ub'' = 4 the arguments of VAG are: ''p''(''x'') = ''x''³ − 7''x'' + 7 and (''a'', ''b'') = (0, 4).

Iteration 1

1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 43''x''³ − 35''x''² − 7''x'' + 7
4 ''m'' ← (0 + 4) = 2
5 ''p''(''m'') = 1
8 RETURN VAG(''x''³ − 7''x'' + 7, (0, 2)) ∪ VAG(''x''³ − 7''x'' + 7, (2, 4)

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 2

VAG(''x''³ − 7''x'' + 7, (0, 2))
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = ''x''³ − 7''x''² + 7''x'' + 7
4 ''m'' ← (0 + 2) = 1
5 ''p''(''m'') = 1
8 RETURN VAG(''x''³ − 7''x'' + 7, (0, 1)) ∪ VAG(''x''³ − 7''x'' + 7, (1, 2)

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 3

VAG(''x''³ − 7''x'' + 7, (0, 1))
1 ''var'' ← 0 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = ''x''³ + 7''x''² + 14''x'' + 7
2 RETURN ∅

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 4

VAG(''x''³ − 7''x'' + 7, (1, 2))
1 ''var'' ← 2 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = ''x''³ − 2''x''² − ''x'' + 1
4 ''m'' ← (1 + 2) =
5 ''p''(''m'') = −
8 RETURN VAG(''x''³ − 7''x'' + 7, (1, )) ∪ VAG(''x''³ − 7''x'' + 7, (, 2))

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 5

VAG(''x''³ − 7''x'' + 7, (1, ))
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of 2³(''x'' + 1)³''p''() = ''x''³ + 2''x''² − 8''x'' − 8
3 RETURN (1, )

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 6

VAG(''x''³ − 7''x'' + 7, (, 2))
1 ''var'' ← 1 // the number of sign variations in the sequence of coefficients of 2³(''x'' + 1)³''p''() = 8''x''³ + 4''x''² − 4''x'' − 1
3 RETURN (, 2)

List of isolation intervals: .

List of intervals to be processed: .

Remove the first and process it.

Iteration 7

VAG(''x''³ − 7''x'' + 7, (2, 4))
1 ''var'' ← 0 // the number of sign variations in the sequence of coefficients of (''x'' + 1)³''p''() = 344''x''³ + 376''x''² + 104''x'' + 8
2 RETURN ∅

List of isolation intervals: .

List of intervals to be processed: ∅.

Finished.

Conclusion

Therefore, the two positive roots of the polynomial lie inside the isolation intervals and }. Each root can be approximated by (for example) bisecting the isolation interval it lies in until the difference of the endpoints is smaller than ; following this approach, the roots turn out to be and .

See also

*Properties of polynomial roots
*Root-finding algorithm
*Vieta's formulas
*Newton's method

References

{{reflist

External links

* Berkakis, Antonis: RealRoots, a free App for Android devices to compare Sturm's method and VAS
* https://play.google.com/store/apps/details?id=org.kde.necessitas.berkakis.realroots

Mathematical theorems