Computer Algebra and Symbolic Computation:

Mathematical Methods

by

Joel S. Cohen

Department of Computer Science

University of Denver

Applying the ideas introduced in the companion book, Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the mathematical concepts that form the basis for computer algebra software and describes algorithms for algebraic simplification, polynomial decomposition, polynomial greatest common divisor calculation, resultant calculation, simplification with side relations, and polynomial factorization.

It is well-suited for self-study and can be used as the basis for an advanced undergraduate course or a beginning graduate course in computer algebra. The book includes a CD with an electronic, hyperlinked version of the text, additional reference files, and implementations of the algorithms in the Mathematica, Maple, and MuPAD computer algebra languages.

- Publication Information: A K Peters, LTD, 63 South Avenue, Natick, MA 01760, (508)655-9933; 448 pages, 2003, ISBN 1-56881-159-4.
- Table of Contents (pdf).
- Preface (pdf).
- Computer Algebra System Announcements (html).

Send questions and comments about this book to Joel Cohen at

Department of Computer Science

University of Denver

Denver, CO 80208, USA

(303) 871-3292

jscohen@cs.du.edu