Modern Computer Algebra

Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'.

Joachim von zur Gathen (Author), Jürgen Gerhard (Author)

9781107039032, Cambridge University Press

Hardback, published 25 April 2013

808 pages, 55 b/w illus. 53 colour illus. 40 tables 560 exercises
24.9 x 18.3 x 4.1 cm, 1.77 kg

'… a polished introduction to algorithms for performing algebraic operations on a computer … The book is almost as interesting for the advanced mathematics (mostly in ring and ideal theory and in linear algebra) that is needed to develop the algorithms. It assumes familiarity with the fundamentals of these topics, but does include a 25-page appendix summarizing the needed background. It is well-equipped with exercises, ranging from numerical practice to extensions and variants on results in the body.' Allen Stenger, MAA Reviews

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

Introduction
1. Cyclohexane, cryptography, codes, and computer algebra
Part I. Euclid: 2. Fundamental algorithms
3. The Euclidean Algorithm
4. Applications of the Euclidean Algorithm
5. Modular algorithms and interpolation
6. The resultant and gcd computation
7. Application: decoding BCH codes
Part II. Newton: 8. Fast multiplication
9. Newton iteration
10. Fast polynomial evaluation and interpolation
11. Fast Euclidean Algorithm
12. Fast linear algebra
13. Fourier Transform and image compression
Part III. Gauß: 14. Factoring polynomials over finite fields
15. Hensel lifting and factoring polynomials
16. Short vectors in lattices
17. Applications of basis reduction
Part IV. Fermat: 18. Primality testing
19. Factoring integers
20. Application: public key cryptography
Part V. Hilbert: 21. Gröbner bases
22. Symbolic integration
23. Symbolic summation
24. Applications
Appendix: 25. Fundamental concepts
Sources of illustrations
Sources of quotations
List of algorithms
List of figures and tables
References
List of notation
Index.

Subject Areas: Maths for computer scientists [UYAM], Computer science [UY], Algorithms & data structures [UMB], Algebra [PBF], Mathematics [PB]