Wi-Fi Technology Forum | Wireless Networking, Mobile Internet News and Reviews

Wi-Fi Technology Forum - Wireless Networking Products Reviews

Blogs
Reviews
Papers
Forums
Software
Publications
Product Reviews


Electronics Hardware, Software and Wireless Products Store



Search 


Algorithms for Computer Algebra


Algorithms for Computer Algebra

Binding: Hardcover
Author: Keith O. Geddes
Manufacturer: Springer
Availability: Usually ships in 24 hours
Average Rating: 4.5
Total Customer Reviews: 2
List Price: $99.00
Our Price: $99.00
Sales Rank: 1644990

More Details



Product Description


Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter.
Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.

Users Product Reviews:

Product Review Summary: an excellent treatment

We used this book in an advanced undergraduate/early graduate class in computer algebra. The book provides a concise and rigorous, but very readable introduction to computational algebra theory, with algorithms written in pseudo code.

Assuming proficiency in programming, as further pre-requisite I would suggest an undergraduate course in abstract algebra (or equivalent mathematical maturity) for maximum benefit.

An excellent collection of algorithms, proofs, and advanced introductory material, written in a (comparatively) breezy style.


Product Review Summary: Clear and understandable, but some bugs

I found this book very useful as a reference while writing a small computer algebra system. It's a definate must-have for all the hordes of people out there who are rewriting subsets of Maple, Mathematica, etc. The explanation of the theory is relatively clear and helpful so that a not-so-theory-inclined person (such as myself) can understand the material. The cost of such clarity is a loss of some conciseness so someone who lives and breathes abstract algebra may desire a more esoteric book (like Winkler's). The biggest flaw of the book are the poorly debugged algorithms. Almost every algorithm presented in the book has some sort of minor flaw with serious reprecussions on correctness. This results in much frustration if you're actually trying to implement the algorithms.

More Details



Similar Products with reviews:



Programming in Python 3: A Complete Introduction to the Python Language


The Princeton Companion to Mathematics


Modern Computer Algebra


Numerical Recipes 3rd Edition: The Art of Scientific Computing


Design Concepts in Programming Languages


Wireless Products Store


Disclaimer: All product data on this page belongs to Amazon.com. No guarantees are made as to accuracy of prices and information.