The book provides a systematic approach for the algorithmic formulation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and construct expressions, we can implement many elementary operations from algebra, trigonometry, calculus, and differential equations. A CD with full, searchable text and implementations of all algorithms in Maple, Mathematica, and MuPad is included. More advanced concepts are covered in the second book in this series, Computer Algebra and Symbolic Computation: Mathematical Methods.
With a minimum of prerequisites, this book is accessible to and useful for students of mathematics, computer science, the sciences, engineering, and other technical fields.
Send questions and comments about this book to Joel Cohen at