Elements of computer algebra with applications Book

Computer algebra refers to the capability of computers to manipulate mathematical expressions in a symbolic, rather than numerical, way--which frees scientists from the painstaking concern for numerical errors (which result from truncation and rounding off). This book describes the best subresultant method for computing polynomial, greatest common divisors and remainder sequences; the importance of Budan's theorem, and its relation to a theorem by Fourier; and the fastest existing method for isolating the real roots of a polynomial equation. Clear and detailed enough to serve as an introductory text, and current and thorough enough to stand as a reference.