Computer Algebra and Symbolic Computation: Elementary Algorithms

Portada
Taylor & Francis, 2002 M07 19 - 323 páginas
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.

Dentro del libro

Contenido

Introduction to Computer Algebra
1
Recursive Algorithms
171
Structure of Polynomials and Rational Expressions
213
Derechos de autor

Otras 3 secciones no mostradas

Otras ediciones - Ver todas

Términos y frases comunes

Información bibliográfica