Solving Polynomial Equation Systems I

Erscheinungsjahr 2019
ISBN: 978-0-521-81154-5
Verlag: Cambridge University Press

Buch, Englisch, Band 88, 438 Seiten, HC gerader Rücken kaschiert, Format (B × H): 161 mm x 240 mm, Gewicht: 901 g

Reihe: Encyclopedia of Mathematics and its Applications

Polynomial equations have been long studied, both theoretically and with a view to solving them. Until recently, manual computation was the only solution method and the theory was developed to accommodate it. With the advent of computers, the situation changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasising computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval Model and the Thom Codification. Mora aims to show that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials.

Autoren/Hrsg.

Mora, Teo

Fachgebiete

• Mathematik | Informatik Mathematik Algebra Homologische Algebra
• Mathematik | Informatik Mathematik Algebra Elementare Algebra

Inhaltsverzeichnis

Preface; Part I. The Kronecker-Duval Philosophy: 1. Euclid; 2. Intermezzo: Chinese remainder theorems; 3. Cardano; 4. Intermezzo: multiplicity of roots; 5. Kronecker I: Kronecker's philosophy; 6. Intermezzo: Sylvester; 7. Galois I: finite fields; 8. Kronecker II: Kronecker's model; 9. Steinitz; 10. Lagrange; 11. Duval; 12. Gauss; 13. Sturm; 14. Galois II; Part II. Factorization: 15. Ouverture; 16. Kronecker III: factorization; 17. Berlekamp; 18. Zassenhaus; 19. Fermeture; Bibliography; Index.