This textbook explains the formulation of algorithms that solve symbolic mathematical problems, and the implementation of these algorithms in computer algebra programming languages. The mathematical pseudo-language (MPL) is used throughout the book to illustrate the structure of recursive procedures, polynomials, rational expressions, and exponential and trigonometric functions. The CD- ROM contains algorithms and an electronic version of the text. Annotation c. Book News, Inc., Portland, OR (booknews.com)
This book provides a systematic approach for the algorithmic formulation and implementation 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. With a minimum of prerequisites this book is accessible to and useful for students of mathematics, computer science, and other technical fields. The book contains a CD with the full, searchable text and implementations of all algorithms in the Maple, Mathematica, and MuPad programming languages.
Rohkem infot Taylor & Francis e-raamatute kohta