Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
106 CHAPTER 3. POLYNOMIAL EQUATIONS<br />
exact 24 numerical approximation or a Thom’s Lemma [CR88] list <strong>of</strong> signs <strong>of</strong><br />
derivatives.<br />
Definition 68 A decomposition D <strong>of</strong> R n is said to the sign-invariant <strong>for</strong> a<br />
polynomial p(x 1 , . . . , x n ) if and if only if, <strong>for</strong> each cell C ∈ D, precisely one <strong>of</strong><br />
the following is true:<br />
1. ∀x ∈ C p(x) > 0;<br />
2. ∀x ∈ C p(x) < 0;<br />
3. ∀x ∈ C p(x) = 0;<br />
It is sign-invariant <strong>for</strong> a set <strong>of</strong> polynomials if, and only if, <strong>for</strong> each polynomial,<br />
one <strong>of</strong> the above conditions is true <strong>for</strong> each cell.<br />
It there<strong>for</strong>e follows that, <strong>for</strong> a sampled decomposition, the sign throughout the<br />
cell is that at the sample point.<br />
3.5.4 Cylindrical Algebraic Decomposition<br />
Notation 18 Let n > m be positive natural numbers, and let R n have coordinates<br />
x 1 , . . . , x n , with R m having coordinates x 1 , . . . , x m .<br />
Definition 69 An algebraic decomposition D <strong>of</strong> R n is said to be cylindrical<br />
over a decomposition D ′ <strong>of</strong> R m if the projection onto R m <strong>of</strong> every cell <strong>of</strong> D is a<br />
cell <strong>of</strong> D ′ . The cells <strong>of</strong> D which project to C ∈ D ′ are said to <strong>for</strong>m the cylinder<br />
over C, denoted Cyl(C). For a sampled algebraic decomosition, we also insist<br />
that the sample point in C be the projection <strong>of</strong> the sample points <strong>of</strong> all the cells<br />
in the cylinder over C.<br />
Cylindricity is by no means trivial.<br />
Example 4 Consider the decomposition <strong>of</strong> R 2 = S 1 ∪ S 2 ∪ S 3 where<br />
S 1 = {(x, y) | x 2 + y 2 − 1 > 0},<br />
S 2 = {(x, y) | x 2 + y 2 − 1 < 0},<br />
S 3 = {(x, y) | x 2 + y 2 − 1 = 0}.<br />
This is an algebraic decomposition, and is sign-invariant <strong>for</strong> x 2 + y 2 − 1. However,<br />
it is not cylindrical over any decomposition <strong>of</strong> the x-axis R 1 . The projection<br />
<strong>of</strong> S 2 is (−1, 1), so we need to decompose R 1 as<br />
(−∞, −1) ∪ {−1} ∪ (−1, 1) ∪ {1} ∪ (1, ∞). (3.58)<br />
24 By this, we mean an approximation such that the root cannot be confused with any other,<br />
which generally means at least an approximation close enough that Newton’s iteration will<br />
converge to the indicated root. Maple’s RootOf supports such a concept.