Modern Computer Algebra - Joachim von zur Gathen, Jürgen Gerhard

Modern Computer Algebra

Buch | Hardcover
800 Seiten
2003 | 2nd Revised edition
Cambridge University Press (Verlag)
978-0-521-82646-4 (ISBN)
77,30 inkl. MwSt
zur Neuauflage
  • Titel erscheint in neuer Auflage
  • Artikel merken
Zu diesem Artikel existiert eine Nachauflage
This is the new edition of the comprehensive and authoritative textbook designed for advanced undergraduate or graduate students in computer science or mathematics. It is also an essential reference for professionals. The text has been smoothed and corrected, and updated with new sections including greatest common divisors and symbolic integration.
Computer algebra systems are gaining importance in all areas of science and engineering. This textbook gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. It is designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics. Its comprehensiveness and authority also make 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; a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). Some of this material has never appeared before in book form. For the new edition, errors have been corrected, the text has been smoothed and updated, and new sections on greatest common divisors and symbolic integration have been added.

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.

Erscheint lt. Verlag 3.7.2003
Zusatzinfo Worked examples or Exercises; 29 Tables, unspecified; 54 Line drawings, color
Verlagsort Cambridge
Sprache englisch
Maße 182 x 256 mm
Gewicht 1763 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Algebra
ISBN-10 0-521-82646-2 / 0521826462
ISBN-13 978-0-521-82646-4 / 9780521826464
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
25,00