Solving polynomial equations. Foundations, algorithms, and applications (Q1776342)

From the preface: The subject of this book is the solution of polynomial equations, that is, systems of (generally) nonlinear algebraic equations. This study is at the heart of several areas of mathematics and its applications. It has provided the motivation for advances in different branches of mathematics such as algebra, geometry, topology, and numerical analysis. In recent years, an explosive development 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 biological 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 effective algebraic geometry and computer algebra has extended well beyond its original constituency of pure and applied 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, differential equations and number theory to discrete geometry, combinatorics and complexity theory. The goal of this book is to provide a general introduction to modern mathematical aspects in computing with multivariate polynomials and in solving algebraic systems. The book is intended for upper-lower undergraduate and graduate students, and researchers in pure and applied mathematics and engineering who are interested in computational algebra and in the connections between computer algebra and numerical mathematics. The articles of this volume will be reviewed individually. Indexed articles: \textit{Cattani, Eduardo; Dickenstein, Alicia}, Introduction to residues and resultants, 1-63, 393-418 [Zbl 1152.14312] \textit{Cox, David A.}, Solving equations via algebras, 63-123, 393-418 [Zbl 1152.13306] \textit{Elkadi, Mohamed; Mourrain, Bernard}, Symbolic-numeric methods for solving polynomial equations and applications, 125-168, 393-418 [Zbl 1152.68701] \textit{Kehrein, Achim; Kreuzer, Martin; Robbiano, Lorenzo}, An algebraist's view on border bases, 169-202, 393-418 [Zbl 1152.13304] \textit{Stillman, Michael}, Tools for computing primary decompositions and applications to ideals associated to Bayesian networks, 203-239, 393-418 [Zbl 1152.13300] \textit{Sabia, Juan}, Algorithms and their complexities, 241-268, 393-418 [Zbl 1152.68450] \textit{Emiris, Ioannis Z.}, Toric resultants and applications to geometric modelling, 269-300, 393-418 [Zbl 1152.14307] \textit{Sommese, Andrew J.; Verschelde, Jan; Wampler, Charles W.}, Introduction to numerical algebraic geometry, 301-335, 393-418 [Zbl 1152.14313] \textit{Chèze, Guillaume; Galligo, André}, Four lectures on polynomial absolute factorization, 339-392, 393-418 [Zbl 1152.13302]