Normale Ansicht MARC ISBD

Modern computer algebra Joachim von zur Gathen, Jürgen Gerhard

Von:

Zur Gathen, Joachim von [VerfasserIn]

Mitwirkende(r):

Gerhard, Jürgen, 1967- [VerfasserIn]

Materialtyp: Text

TextSprache: Englisch Verlag: Cambridge Cambridge Univ. Press 2013Auflage: 3. editionBeschreibung: XIII, 795 Seiten IllustrationenInhaltstyp:

Text

Medientyp:

ohne Hilfsmittel zu benutzen

Datenträgertyp:

Band

ISBN:

1107039037
9781107039032

Schlagwörter:

Andere physische Formen: Kein Titel; Erscheint auch als: Modern computer algebra; Erscheint auch als: Modern computer algebraLOC-Klassifikation:

QA155.7.E4

Andere Klassifikation:

17,1
ST 600
*68-02
68W30
13Pxx
11Y05
11Y11
68R05
94A60
54.71
31.76

Online-Ressourcen:

Zentralblatt MATH Inhaltstext

Zusammenfassung: 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, crytopgraphy, 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.Zusammenfassung: 1. Cyclohexane, cryptography, codes, and computer algebra -- 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 -- 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 -- 14. Factoring polynomials over finite fields -- 15. Hensel lifting and factoring polynomials -- 16. Short vectors in lattices -- 17. Applications of basis reduction -- 18. Primality testing -- 19. Factoring integers -- 20. Application: public key cryptography -- 21. Gröbner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental conceptsAndere Ausgaben: Erscheint auch als (Online-Ausgabe): / Zur Gathen, Joachim von: Modern computer algebra; Erscheint auch als (Online-Ausgabe): / Zur Gathen, Joachim von: Modern computer algebra

Exemplare ( 3 )
Titelinformationen ( 6 )

Exemplare
Medientyp	Aktuelle Bibliothek	Sammlung	Standort	Signatur	Status	Barcode	Semesterapparate
Buch	Gebäude E1 4 (MPI-INF)	MPI-INF (E1 4)	Internal	Zur Gathen (Regal durchstöbern(Öffnet sich unterhalb))	restricted use	2001000019526
Semesterapparat (Buch)	Gebäude E2 3 (UdS Campusbibliothek für Informatik und Mathematik)	Campusbibliothek für Informatik und Mathematik (E2 3)	Course Reference (GF)	GATh j 2013:1 2.Ex (Regal durchstöbern(Öffnet sich unterhalb))	Nicht ausleihbar	2200000319586	Computer Algebra Wintersemester 2022/2023
Buch	Gebäude E2 3 (UdS Campusbibliothek für Informatik und Mathematik)	Campusbibliothek für Informatik und Mathematik (E2 3)	Books A-Z (1st)	GATh j 2013:1 1.Ex (Regal durchstöbern(Öffnet sich unterhalb))	Verfügbar	2200000391353

Hier auch später erschienene, unveränderte Nachdrucke

Includes bibliographical references and index

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, crytopgraphy, 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.

1. Cyclohexane, cryptography, codes, and computer algebra -- 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 -- 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 -- 14. Factoring polynomials over finite fields -- 15. Hensel lifting and factoring polynomials -- 16. Short vectors in lattices -- 17. Applications of basis reduction -- 18. Primality testing -- 19. Factoring integers -- 20. Application: public key cryptography -- 21. Gröbner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental concepts

Zur Gathen, Joachim von: Modern computer algebra