Algorithms for Computer Algebra (Hardcover)

by Keith O. Geddes (Author), Stephen R. Czapor (Author), George Labahn (Author)

Editorial Reviews

Review
`The Computer Algebra community has been waiting for years for this book to appear. ...the book is a masterpiece and can be recommended to everyone interested in the algorithms for computer algebra, either as a reference for further research or just to give the casual user an idea why things work as good (or as bad) as they do in computer algebra packages. ...the recommendation would be clear: Buy this book! As it stands now my only advice is to stay away from this book, because you might be tempted to buy it anyway (at least I was).' Computer Algebra Nederland Newsletter, June 1993

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.

Product Details

• Hardcover: 608 pages
• Publisher: Springer; 1 edition (September 30, 1992)
• Language: English
• ISBN-10: 0792392590
• ISBN-13: 978-0792392590
• Product Dimensions: 8.9 x 6.3 x 1.5 inches
• Shipping Weight: 2.1 pounds (View shipping rates and policies)
• Average Customer Review: 4.5 out of 5 stars See all reviews (2 customer reviews)
• Amazon.com Sales Rank: #1,107,591 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

10 of 10 people found the following review helpful:

4.0 out of 5 stars Clear and understandable, but some bugs, August 25, 2000

By	David R. Koes (Pittsburgh, PA) - See all my reviews (REAL NAME)

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.

4 of 4 people found the following review helpful:

5.0 out of 5 stars an excellent treatment, October 21, 2003

By	WILSON YEUNG (Campbell, CA, USA) - See all my reviews (REAL NAME)

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.