|
|
|
|
|
Sturm's TheoremIn mathematics, Sturm's theorem is a symbolic procedure to determine the number of unique real roots of a polynomial. It was named for its discoverer, Jacques Charles Franois Sturm. Whereas the fundamental theorem of algebra readily yields the number of real or complex roots of a polynomial, counted according to their multiplicities, Sturm's theorem deals with real roots and disregards their multiplicities. To apply Sturm's theorem, you first construct a Sturm chain from a polynomial . A sturm chain is the sequence of intermediary results when applying Euclid's algorithm to and its derivative . To obtain the Sturm chain, you compute -
X_2&=&-{\rm rem}(X,X_1)\\ X_3&=&-{\rm rem}(X_1,X_2)\\ &\ldots&\\ 0&=&-{\rm rem}(X_{r-1},X_r), \end{matrix} i.e., you successively take the remainders with a polynom division and change theirs signs. Each is a polynom of at least degree one, hence the algorithm will stop at last. then is the GCD of and its derivative. If only had simple roots, it will be a constant. The Sturm chain then is . Let be the number of sign changes (zeroes are not counted) in the sequence . Sturm's theorem then states that for two real numbers |
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|