Computer Algebra and Symbolic Computation
Regular price
€107.99
14 days return policy
Shipping & Delivery
A01=Joel S. Cohen
Algebraic Operators
algorithmic problem solving
Arbitrary Constant
Atomic Expression
Author_Joel S. Cohen
Automatic Simplification
Category=PBF
Category=UYA
Coefficient Part
Compound Expression
Computer Algebra
Computer Algebra Systems
Derivative Symbol
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Expression Tree
Generalized Variables
Infix Operator
Integer Operand
Maple programming
Mathematica coding
Mathematical Expressions
Multivariate Polynomial
Order Ordinary Differential Equations
Ordinary Differential Equations
Polynom Ial
Polynomial
Polynomial Structure
rational expression analysis
recursive algorithm implementation
Recursive Calls
Recursive Procedure
Simplified Precedence Rules
symbolic mathematics
Trigonometric Expansion
Trigonometric Transformations
undergraduate mathematics resource
Product details
- ISBN 9781568811581
- Weight: 589g
- Dimensions: 152 x 229mm
- Publication Date: 19 Jul 2002
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
