Solving Polynomial Equations

Foundations, Algorithms, and Applications

  • Manuel Bronstein
  • Arjeh M. Cohen
  • Henri Cohen
  • David Eisenbud
  • Bernd Sturmfels
  • Alicia Dickenstein
  • Ioannis Z. Emiris

Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 14)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Eduardo Cattani, Alicia Dickenstein
    Pages 1-61
  3. David A. Cox
    Pages 63-123
  4. Achim Kehrein, Martin Kreuzer, Lorenzo Robbiano
    Pages 169-202
  5. Juan Sabia
    Pages 241-268
  6. Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
    Pages 301-337
  7. Guillaume Chèze, André Galligo
    Pages 339-392
  8. Back Matter
    Pages 393-425

About this book


The subject of this book is the solution of polynomial equations, that is, s- tems of (generally) non-linear algebraic equations. This study is at the heart of several areas of mathematics and its applications. It has provided the - tivation for advances in di?erent branches of mathematics such as algebra, geometry, topology, and numerical analysis. In recent years, an explosive - velopment of algorithms and software has made it possible to solve many problems which had been intractable up to then and greatly expanded the areas of applications to include robotics, machine vision, signal processing, structural molecular biology, computer-aided design and geometric modelling, as well as certain areas of statistics, optimization and game theory, and b- logical networks. At the same time, symbolic computation has proved to be an invaluable tool for experimentation and conjecture in pure mathematics. As a consequence, the interest in e?ective algebraic geometry and computer algebrahasextendedwellbeyonditsoriginalconstituencyofpureandapplied mathematicians and computer scientists, to encompass many other scientists and engineers. While the core of the subject remains algebraic geometry, it also calls upon many other aspects of mathematics and theoretical computer science, ranging from numerical methods, di?erential equations and number theory to discrete geometry, combinatorics and complexity theory. Thegoalofthisbookistoprovideageneralintroduction tomodernma- ematical aspects in computing with multivariate polynomials and in solving algebraic systems.


algorithm algorithms complexity computer algebra polynomial robotics statistics system solving

Editors and affiliations

  • Manuel Bronstein
  • Arjeh M. Cohen
  • Henri Cohen
  • David Eisenbud
  • Bernd Sturmfels
  • Alicia Dickenstein
    • 1
  • Ioannis Z. Emiris
    • 2
  1. 1.Departamento de Matemática Facultad de Ciencias Exactas y NaturalesUniversidad de Buenos AiresBuenos AiresArgentina
  2. 2.Department of Informatics and TelecommunicationsNational Kapodistrian University of AthensPanepistimiopolisGreece

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-24326-7
  • Online ISBN 978-3-540-27357-8
  • Series Print ISSN 1431-1550
  • About this book