Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Computer Algebra - Wolfram Koepf

Computer Algebra

An Algorithm-Oriented Introduction

(Autor)

Buch | Softcover
XII, 384 Seiten
2022 | 1st ed. 2021
Springer International Publishing (Verlag)
978-3-030-78019-7 (ISBN)
CHF 82,35 inkl. MwSt
Presented using Mathematica code, the book is fully supported by downloadable sessions in Mathematica, Maple, and Maxima.Opening with an introduction to computer algebra systems and the basics of programming mathematical algorithms, the book goes on to explore integer arithmetic.

This textbook offers an algorithmic introduction to the field of computer algebra. A leading expert in the field, the author guides readers through numerous hands-on tutorials designed to build practical skills and algorithmic thinking. This implementation-oriented approach equips readers with versatile tools that can be used to enhance studies in mathematical theory, applications, or teaching. Presented using Mathematica code, the book is fully supported by downloadable sessions in Mathematica, Maple, and Maxima.

Opening with an introduction to computer algebra systems and the basics of programming mathematical algorithms, the book goes on to explore integer arithmetic. A chapter on modular arithmetic completes the number-theoretic foundations, which are then applied to coding theory and cryptography. From here, the focus shifts to polynomial arithmetic and algebraic numbers, with modern algorithms allowing the efficient factorization of polynomials. The final chapters offer extensions into more advanced topics: simplification and normal forms, power series, summation formulas, and integration.

Computer Algebra is an indispensable resource for mathematics and computer science students new to the field. Numerous examples illustrate algorithms and their implementation throughout, with online support materials to encourage hands-on exploration. Prerequisites are minimal, with only a knowledge of calculus and linear algebra assumed. In addition to classroom use, the elementary approach and detailed index make this book an ideal reference for algorithms in computer algebra.

Wolfram Koepf is Professor of Mathematics (retired) at the University of Kassel. He is a leading expert in computer algebra. Between 2002 and 2010 he was the Chairman of the Fachgruppe Computeralgebra, the largest computer algebra group worldwide. He has organized numerous conferences and workshops around the world, including the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2010 as general chair, and a cooperation with the African Institute of Mathematical Sciences Cameroon in 2017 and 2018. In addition to his prolific research and organizational activities, he has a strong interest in education and teacher preparation. He is also a member of the executive committee of the German Mathematical Union (DMV).

1. Introduction to Computer Algebra.- 2. Programming in Computer Algebra Systems.- 3. Number Systems and Integer Arithmetic.- 4. Modular Arithmetic.- 5. Coding Theory and Cryptography.- 6. Polynomial Arithmetic.- 7. Algebraic Numbers.- 8. Factorization in Polynomial Rings.- 9. Simplification and Normal Forms.- 10. Power Series.- 11. Algorithmic Summation.- 12. Algorithmic Integration.- References.- List of Symbols.- Mathematica List of Keywords.- Index.

"Strong interplay between the abstract exposition, which includes the relevant theorems as well as their proofs, and the practical utilization of those concepts in Mathematica is certainly a remarkable feature of this textbook. ... Overall, the book is very well written and the approach to provide examples as actual Mathematica sessions is commendable." (Andreas Maletti, zbMATH 1484.68004, 2022)

“Strong interplay between the abstract exposition, which includes the relevant theorems as well as their proofs, and the practical utilization of those concepts in Mathematica is certainly a remarkable feature of this textbook. … Overall, the book is very well written and the approach to provide examples as actual Mathematica sessions is commendable.” (Andreas Maletti, zbMATH 1484.68004, 2022)

Erscheinungsdatum
Reihe/Serie Springer Undergraduate Texts in Mathematics and Technology
Zusatzinfo XII, 384 p. 27 illus., 26 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 178 x 254 mm
Gewicht 751 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Angewandte Mathematik
Schlagworte Algorithmic integration • Algorithmic Summation • Coding theory computer algebra • Computer algebra algorithms • Computer algebra for high school teachers • Computer algebra programming • Computer algebra reference • Computer algebra textbook • Cryptography computer algebra • Efficient factorization in polynomial rings • Maple algebra • Mathematica algebra • Maxima algebra • Polynomial multiplication fast algorithm
ISBN-10 3-030-78019-8 / 3030780198
ISBN-13 978-3-030-78019-7 / 9783030780197
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95