The Numerical Solution of Systems of Polynomials Arising in Engineering and Science

From MaRDI portal





This is an excellent book on numerical solutions of polynomials systems for engineers, scientists and numerical analysts. As pioneers of the field of numerical algebraic geometry, the authors have provided a comprehensive summary of ideas, methods, problems of numerical algebraic geometry and applications to solving polynomial systems. Through the book readers will experience authors' original ideas, contributions and their techniques in handling practical problems. This book is comprised of three parts. Chapters 1-6 make up the part one. The chapters 1-3 is an introduction of various types of polynomial systems in practice; their solution sets; homotopy continuation; solutions at infinity and continuation paths going to the infinity; projective spaces in algebraic geometry that sew up infinity, compactify Euclidean space and enable accurate statement of the number of roots of polynomial systems and easy numerical treatment of solutions at infinity. The chapter 4 discusses the concept of genericity and probability one, and their application in numerical continuation. Chapter 5 discusses the algebraic properties, the analytic behaviour of roots and the numerical behaviour in floating point computation of polynomials in one variable. Chapter 6 ties up nicely exclusion methods, eliminants and Gröbner bases with numerical solutions of polynomial systems. Part two of this book, consisting of Chapters 7-11, is about the theory and practice of finding isolated solutions of polynomial systems, particularly those arising in engineering and science. Chapter 7 discusses parameter-dependent polynomial systems and coefficient-parameter homotopy to find all solutions of a family of polynomial systems where all solutions of some systems within the family are known at the outset. ``Gamma Trick, nested parameter and symmetry respected homotopies, and the historical cheater's homotopy are explained with case studies. In Chapter 8 the authors introduce a very useful hierarchy of classes of special structures in constructing homotopies and illustrate the strategy of determining the start system and designing the homotopy paths that facilitate numerical path-following process toward the desired solutions. Chapter 9 is a collection of application problems ranging from game theory, chemistry to kinematics. Through these case studies the authors have demonstrated that a clean formulation of the problem and simple manipulation of the equations can generate to more practical homotopies with fewer paths that save computational work. The Chapter 10 is about continuation procedure when the homotopy parameter \(t\) approaches 0, and convergence properties and improvement of Newton-like methods near singular solutions. Chapter 11 provides useful practical techniques and tips for checking and correcting failures in the path-following process. Part three of the book, from Chapter 12 to 16, describes how to use homotopy continuation to compute higher-dimensional solution sets of polynomial systems. The authors introduce ``witness sets to represent curves, surfaces and other algebraic-geometric sets as numerical objects. These ideas form the foundation of the new and rapid growing field: Numerical Algebraic Geometry. Chapter 12 discusses different sorts of algebraic sets and their relationships and introduces the Zariski topology, its relation to the complex topology, the irreducible decomposition and constructive algebraic sets and multiplicity. Chapter 13 introduces concept of the numerical algebraic geometry, the field that the authors have laid foundation with their pioneering work and significant contribution. The witness points, a numerical data structure for encoding irreducible algebraic sets, and the numerical irreducible decomposition techniques that lead the reduction to systems with the same number of equations as unknowns, are discussed extensively in this chapter. Chapters 14 and 15 describe alternative and numerical procedures to compute the ``witness point supersets and numerical irreducible decompositions. One particular section in the chapter 15 is devoted to the singular path-following, an area closely related to the reduced systems in the numerical bifurcation theory. Chapter 16 introduces some recent advances in finding the numerical irreducible decomposition of the intersection of irreducible algebraic sets. The book ends with very useful appendices on fundamental elements of algebraic geometry, structure theorem of parameter-dependent polynomial systems, an extensive list of software packages of continuation method for solving polynomial systems and user guide of the author's software ``HOMLAB. Many interesting examples from engineering and science have been used throughout the book. Also the exercises are well designed in line with the content, along with algorithms, sample programs in Matlab and author's own software ``HOMLAB for polynomial continuation. This is a remarkable book that I recommend to engineers, scientists, researchers, professionals and students, and particularly numerical analysts who will benefit from the rapid development of numerical algebraic geometry.




Cited in
(only showing first 100 items - show all)


Describes a project that uses

Uses Software






This page was built for publication: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312787)