HOME

TheInfoList



OR:

A system of polynomial equations (sometimes simply a polynomial system) is a set of
simultaneous equations In mathematics, a set of simultaneous equations, also known as a system of equations or an equation system, is a finite set of equations for which common solutions are sought. An equation system is usually classified in the same manner as single e ...
where the are
polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An exampl ...
s in several variables, say , over some field . A ''solution'' of a polynomial system is a set of values for the s which belong to some
algebraically closed In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . Examples As an example, the field of real numbers is not algebraically closed, because ...
field extension In mathematics, particularly in algebra, a field extension is a pair of fields E\subseteq F, such that the operations of ''E'' are those of ''F'' restricted to ''E''. In this case, ''F'' is an extension field of ''E'' and ''E'' is a subfield of ...
of , and make all equations true. When is the field of
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ra ...
s, is generally assumed to be the field of
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the fo ...
s, because each solution belongs to a
field extension In mathematics, particularly in algebra, a field extension is a pair of fields E\subseteq F, such that the operations of ''E'' are those of ''F'' restricted to ''E''. In this case, ''F'' is an extension field of ''E'' and ''E'' is a subfield of ...
of , which is isomorphic to a subfield of the complex numbers. This article is about the methods for solving, that is, finding all solutions or describing them. As these methods are designed for being implemented in a computer, emphasis is given on fields in which computation (including equality testing) is easy and efficient, that is the field of
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ra ...
s and
finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtr ...
s. Searching for solutions that belong to a specific set is a problem which is generally much more difficult, and is outside the scope of this article, except for the case of the solutions in a given finite field. For the case of solutions of which all components are integers or rational numbers, see
Diophantine equation In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a ...
.


Definition

A simple example of a system of polynomial equations is : \begin x^2 + y^2 - 5&= 0 \\ xy - 2 &= 0. \end Its solutions are the four pairs . These solutions can easily checked by substitution, but more work is needed for proving that there are no other solutions. The subject of this article is the study of generalizations of such an examples, and the description of the methods that are used for computing the solutions. A ''system of polynomial equations,'' or ''polynomial system'' is a collection of equations : \begin f_1\left(x_1, \ldots, x_m \right) &= 0 \\ & \;\;\vdots \\ f_n\left(x_1, \ldots, x_m \right) &= 0, \end where each is a
polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An exampl ...
in the indeterminates , with integer coefficients, or coefficients in some fixed field, often the field of
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ra ...
s or a
finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtr ...
. Other fields of coefficients, such as the
real number In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every ...
s, are less often used, as their elements cannot be represented in a computer (only approximations of real numbers can be used in computations, and these approximations are always rational numbers). A ''solution'' of a polynomial system is a
tuple In mathematics, a tuple is a finite ordered list (sequence) of elements. An -tuple is a sequence (or ordered list) of elements, where is a non-negative integer. There is only one 0-tuple, referred to as ''the empty tuple''. An -tuple is defi ...
of values of that satisfies all equations of the polynomial system. The solutions are sought in the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the fo ...
s, or more generally in an
algebraically closed field In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . Examples As an example, the field of real numbers is not algebraically closed, because ...
containing the coefficients. In particular, in
characteristic zero In mathematics, the characteristic of a ring , often denoted , is defined to be the smallest number of times one must use the ring's multiplicative identity (1) in a sum to get the additive identity (0). If this sum never reaches the additive ide ...
, all
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
solutions are sought. Searching for the
real Real may refer to: Currencies * Brazilian real (R$) * Central American Republic real * Mexican real * Portuguese real * Spanish real * Spanish colonial real Music Albums * ''Real'' (L'Arc-en-Ciel album) (2000) * ''Real'' (Bright album) (2010) ...
or
rational Rationality is the quality of being guided by or based on reasons. In this regard, a person acts rationally if they have a good reason for what they do or a belief is rational if it is based on strong evidence. This quality can apply to an abi ...
solutions are much more difficult problems that are not considered in this article. The set of solutions is not always finite; for example, the solutions of the system : \begin x(x-1) &= 0 \\ x(y-1) &= 0 \end are a point and a line . Even when the solution set is finite, there is, in general, no
closed-form expression In mathematics, a closed-form expression is a mathematical expression that uses a finite number of standard operations. It may contain constants, variables, certain well-known operations (e.g., + − × ÷), and functions (e.g., ''n''th r ...
of the solutions (in the case of a single equation, this is Abel–Ruffini theorem). The Barth surface, shown in the figure is the geometric representation of the solutions of a polynomial system reduced to a single equation of degree 6 in 3 variables. Some of its numerous singular points are visible on the image. They are the solutions of a system of 4 equations of degree 5 in 3 variables. Such an
overdetermined system In mathematics, a system of equations is considered overdetermined if there are more equations than unknowns. An overdetermined system is almost always inconsistent (it has no solution) when constructed with random coefficients. However, an over ...
has no solution in general (that is if the coefficients are not specific). If it has a finite number of solutions, this number is at most , by
Bézout's theorem Bézout's theorem is a statement in algebraic geometry concerning the number of common zeros of polynomials in indeterminates. In its original form the theorem states that ''in general'' the number of common zeros equals the product of the deg ...
. However, it has been shown that, for the case of the singular points of a surface of degree 6, the maximum number of solutions is 65, and is reached by the Barth surface.


Basic properties and definitions

A system is overdetermined if the number of equations is higher than the number of variables. A system is
inconsistent In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consiste ...
if it has no
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
solution (or, if the coefficients are not complex numbers, no solution in an
algebraically closed field In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . Examples As an example, the field of real numbers is not algebraically closed, because ...
containing the coefficients). By
Hilbert's Nullstellensatz In mathematics, Hilbert's Nullstellensatz (German for "theorem of zeros," or more literally, "zero-locus-theorem") is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic ...
this means that 1 is a linear combination (with polynomials as coefficients) of the first members of the equations. Most but not all overdetermined systems, when constructed with random coefficients, are inconsistent. For example, the system is overdetermined (having two equations but only one unknown), but it is not inconsistent since it has the solution . A system is underdetermined if the number of equations is lower than the number of the variables. An underdetermined system is either inconsistent or has infinitely many complex solutions (or solutions in an
algebraically closed field In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . Examples As an example, the field of real numbers is not algebraically closed, because ...
that contains the coefficients of the equations). This is a non-trivial result of
commutative algebra Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings. Both algebraic geometry and algebraic number theory build on commutative algebra. Prom ...
that involves, in particular,
Hilbert's Nullstellensatz In mathematics, Hilbert's Nullstellensatz (German for "theorem of zeros," or more literally, "zero-locus-theorem") is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic ...
and Krull's principal ideal theorem. A system is zero-dimensional if it has a finite number of complex solutions (or solutions in an algebraically closed field). This terminology comes from the fact that the
algebraic variety Algebraic varieties are the central objects of study in algebraic geometry, a sub-field of mathematics. Classically, an algebraic variety is defined as the set of solutions of a system of polynomial equations over the real or complex numbers. ...
of the solutions has
dimension In physics and mathematics, the dimension of a mathematical space (or object) is informally defined as the minimum number of coordinates needed to specify any point within it. Thus, a line has a dimension of one (1D) because only one coord ...
zero. A system with infinitely many solutions is said to be ''positive-dimensional''. A zero-dimensional system with as many equations as variables is sometimes said to be ''well-behaved''.
Bézout's theorem Bézout's theorem is a statement in algebraic geometry concerning the number of common zeros of polynomials in indeterminates. In its original form the theorem states that ''in general'' the number of common zeros equals the product of the deg ...
asserts that a well-behaved system whose equations have degrees has at most solutions. This bound is sharp. If all the degrees are equal to , this bound becomes and is exponential in the number of variables. (The
fundamental theorem of algebra The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non- constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomia ...
is the special case .) This exponential behavior makes solving polynomial systems difficult and explains why there are few solvers that are able to automatically solve systems with Bézout's bound higher than, say, 25 (three equations of degree 3 or five equations of degree 2 are beyond this bound).


What is solving?

The first thing to do for solving a polynomial system is to decide whether it is inconsistent, zero-dimensional or positive dimensional. This may be done by the computation of a
Gröbner basis In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field . A Gröbn ...
of the left-hand sides of the equations. The system is ''inconsistent'' if this Gröbner basis is reduced to 1. The system is ''zero-dimensional'' if, for every variable there is a leading monomial of some element of the Gröbner basis which is a pure power of this variable. For this test, the best
monomial order In mathematics, a monomial order (sometimes called a term order or an admissible order) is a total order on the set of all ( monic) monomials in a given polynomial ring, satisfying the property of respecting multiplication, i.e., * If u \leq v and ...
(that is the one which leads generally to the fastest computation) is usually the graded reverse lexicographic one (grevlex). If the system is ''positive-dimensional'', it has infinitely many solutions. It is thus not possible to enumerate them. It follows that, in this case, solving may only mean "finding a description of the solutions from which the relevant properties of the solutions are easy to extract". There is no commonly accepted such description. In fact there are many different "relevant properties", which involve almost every subfield of
algebraic geometry Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical ...
. A natural example of such a question concerning positive-dimensional systems is the following: ''decide if a polynomial system over the
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ra ...
s has a finite number of real solutions and compute them''. A generalization of this question is ''find at least one solution in each connected component of the set of real solutions of a polynomial system''. The classical algorithm for solving these question is
cylindrical algebraic decomposition In mathematics, cylindrical algebraic decomposition (CAD) is a notion, and an algorithm to compute it, that are fundamental for computer algebra and real algebraic geometry. Given a set ''S'' of polynomials in R''n'', a cylindrical algebraic decom ...
, which has a doubly exponential
computational complexity In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) ...
and therefore cannot be used in practice, except for very small examples. For zero-dimensional systems, solving consists of computing all the solutions. There are two different ways of outputting the solutions. The most common way is possible only for real or complex solutions, and consists of outputting numeric approximations of the solutions. Such a solution is called ''numeric''. A solution is ''certified'' if it is provided with a bound on the error of the approximations, and if this bound separates the different solutions. The other way of representing the solutions is said to be ''algebraic''. It uses the fact that, for a zero-dimensional system, the solutions belong to the algebraic closure of the field ''k'' of the coefficients of the system. There are several ways to represent the solution in an algebraic closure, which are discussed below. All of them allow one to compute a numerical approximation of the solutions by solving one or several univariate equations. For this computation, it is preferable to use a representation that involves solving only one univariate polynomial per solution, because computing the roots of a polynomial which has approximate coefficients is a highly unstable problem.


Extensions


Trigonometric equations

A trigonometric equation is an equation where is a
trigonometric polynomial In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(''nx'') and cos(''nx'') with ''n'' taking on the values of one or more natural numbers. The c ...
. Such an equation may be converted into a polynomial system by expanding the sines and cosines in it (using sum and difference formulas), replacing and by two new variables and and adding the new equation . For example, because of the identity :\cos(3x)=4\cos^3(x)-3\cos(x), solving the equation : \sin^3(x)+\cos(3x)=0 is equivalent to solving the polynomial system : \begin s^3+4c^3-3c&=0\\ s^2+c^2-1&=0. \end For each solution of this system, there is a unique solution of the equation such that . In the case of this simple example, it may be unclear whether the system is, or not, easier to solve than the equation. On more complicated examples, one lacks systematic methods for solving directly the equation, while software are available for automatically solving the corresponding system.


Solutions in a finite field

When solving a system over a finite field with elements, one is primarily interested in the solutions in . As the elements of are exactly the solutions of the equation , it suffices, for restricting the solutions to , to add the equation for each variable .


Coefficients in a number field or in a finite field with non-prime order

The elements of an
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a f ...
are usually represented as polynomials in a generator of the field which satisfies some univariate polynomial equation. To work with a polynomial system whose coefficients belong to a number field, it suffices to consider this generator as a new variable and to add the equation of the generator to the equations of the system. Thus solving a polynomial system over a number field is reduced to solving another system over the rational numbers. For example, if a system contains \sqrt, a system over the rational numbers is obtained by adding the equation and replacing \sqrt by in the other equations. In the case of a finite field, the same transformation allows always supposing that the field has a prime order.


Algebraic representation of the solutions


Regular chains

The usual way of representing the solutions is through zero-dimensional regular chains. Such a chain consists of a sequence of polynomials , , ..., such that, for every such that * is a polynomial in only, which has a degree in ; * the coefficient of in is a polynomial in which does not have any common zero with , ..., . To such a
regular chain In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular ...
is associated a ''triangular system of equations'' : \begin f_1(x_1)= 0\\ f_2(x_1,x_2)=0\\ \quad\vdots\\ f_n(x_1, x_2, \ldots, x_n)=0. \end The solutions of this system are obtained by solving the first univariate equation, substituting the solutions in the other equations, then solving the second equation which is now univariate, and so on. The definition of regular chains implies that the univariate equation obtained from has degree and thus that the system has solutions, provided that there is no multiple root in this resolution process (
fundamental theorem of algebra The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non- constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomia ...
). Every zero-dimensional system of polynomial equations is equivalent (i.e. has the same solutions) to a finite number of regular chains. Several regular chains may be needed, as it is the case for the following system which has three solutions. : \begin x^2-1=0\\ (x-1)(y-1)=0\\ y^2-1=0. \end There are several algorithms for computing a
triangular decomposition In computer algebra, a triangular decomposition of a polynomial system is a set of simpler polynomial systems such that a point is a solution of if and only if it is a solution of one of the systems . When the purpose is to describe the soluti ...
of an arbitrary polynomial system (not necessarily zero-dimensional) into
regular chain In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular ...
s (or
regular semi-algebraic system In computer algebra, a regular semi-algebraic system is a particular kind of triangular system of multivariate polynomials over a real closed field. Introduction Regular chains and triangular decompositions are fundamental and well-developed to ...
s). There is also an algorithm which is specific to the zero-dimensional case and is competitive, in this case, with the direct algorithms. It consists in computing first the
Gröbner basis In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field . A Gröbn ...
for the graded reverse lexicographic order (grevlex), then deducing the lexicographical Gröbner basis by FGLM algorithm and finally applying the Lextriangular algorithm. This representation of the solutions are fully convenient for coefficients in a finite field. However, for rational coefficients, two aspects have to be taken care of: * The output may involve huge integers which may make the computation and the use of the result problematic. * To deduce the numeric values of the solutions from the output, one has to solve univariate polynomials with approximate coefficients, which is a highly unstable problem. The first issue has been solved by Dahan and Schost: Among the sets of regular chains that represent a given set of solutions, there is a set for which the coefficients are explicitly bounded in terms of the size of the input system, with a nearly optimal bound. This set, called ''equiprojectable decomposition'', depends only on the choice of the coordinates. This allows the use of modular methods for computing efficiently the equiprojectable decomposition. The second issue is generally solved by outputting regular chains of a special form, sometimes called ''shape lemma'', for which all but the first one are equal to . For getting such regular chains, one may have to add a further variable, called ''separating variable'', which is given the index . The ''rational univariate representation'', described below, allows computing such a special regular chain, satisfying Dahan–Schost bound, by starting from either a regular chain or a Gröbner basis.


Rational univariate representation

The ''rational univariate representation'' or RUR is a representation of the solutions of a zero-dimensional polynomial system over the rational numbers which has been introduced by F. Rouillier. A RUR of a zero-dimensional system consists in a linear combination of the variables, called ''separating variable'', and a system of equations : \begin h(x_0)=0\\ x_1=g_1(x_0)/g_0(x_0)\\ \quad\vdots\\ x_n=g_n(x_0)/g_0(x_0), \end where is a univariate polynomial in of degree and are univariate polynomials in of degree less than . Given a zero-dimensional polynomial system over the rational numbers, the RUR has the following properties. * All but a finite number linear combinations of the variables are separating variables. * When the separating variable is chosen, the RUR exists and is unique. In particular and the are defined independently of any algorithm to compute them. * The solutions of the system are in one-to-one correspondence with the roots of and the multiplicity of each root of equals the multiplicity of the corresponding solution. * The solutions of the system are obtained by substituting the roots of in the other equations. * If does not have any multiple root then is the
derivative In mathematics, the derivative of a function of a real variable measures the sensitivity to change of the function value (output value) with respect to a change in its argument (input value). Derivatives are a fundamental tool of calculus. ...
of . For example, for the system in the previous section, every linear combination of the variable, except the multiples of , and , is a separating variable. If one chooses as a separating variable, then the RUR is : \begin t^3-t=0\\ x=\frac\\ y=\frac.\\ \end The RUR is uniquely defined for a given separating variable, independently of any algorithm, and it preserves the multiplicities of the roots. This is a notable difference with triangular decompositions (even the equiprojectable decomposition), which, in general, do not preserve multiplicities. The RUR shares with equiprojectable decomposition the property of producing an output with coefficients of relatively small size. For zero-dimensional systems, the RUR allows retrieval of the numeric values of the solutions by solving a single univariate polynomial and substituting them in rational functions. This allows production of certified approximations of the solutions to any given precision. Moreover, the univariate polynomial of the RUR may be factorized, and this gives a RUR for every irreducible factor. This provides the ''prime decomposition'' of the given ideal (that is the
primary decomposition In mathematics, the Lasker–Noether theorem states that every Noetherian ring is a Lasker ring, which means that every ideal can be decomposed as an intersection, called primary decomposition, of finitely many '' primary ideals'' (which are relate ...
of the
radical Radical may refer to: Politics and ideology Politics * Radical politics, the political intent of fundamental societal change *Radicalism (historical), the Radical Movement that began in late 18th century Britain and spread to continental Europe an ...
of the ideal). In practice, this provides an output with much smaller coefficients, especially in the case of systems with high multiplicities. Contrarily to triangular decompositions and equiprojectable decompositions, the RUR is not defined in positive dimension.


Solving numerically


General solving algorithms

The general numerical algorithms which are designed for any system of nonlinear equations work also for polynomial systems. However the specific methods will generally be preferred, as the general methods generally do not allow one to find ''all'' solutions. In particular, when a general method does not find any solution, this is usually not an indication that there is no solution. Nevertheless, two methods deserve to be mentioned here. *
Newton's method In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real- ...
may be used if the number of equations is equal to the number of variables. It does not allow one to find all the solutions nor to prove that there is no solution. But it is very fast when starting from a point which is close to a solution. Therefore, it is a basic tool for the homotopy continuation method described below. *
Optimization Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfi ...
is rarely used for solving polynomial systems, but it succeeded, circa 1970, in showing that a system of 81 quadratic equations in 56 variables is not inconsistent. With the other known methods, this remains beyond the possibilities of modern technology, . This method consists simply in minimizing the sum of the squares of the equations. If zero is found as a local minimum, then it is attained at a solution. This method works for overdetermined systems, but outputs an empty information if all local minimums which are found are positive.


Homotopy continuation method

This is a semi-numeric method which supposes that the number of equations is equal to the number of variables. This method is relatively old but it has been dramatically improved in the last decades. This method divides into three steps. First an upper bound on the number of solutions is computed. This bound has to be as sharp as possible. Therefore, it is computed by, at least, four different methods and the best value, say N, is kept. In the second step, a system g_1=0,\, \ldots,\, g_n=0 of polynomial equations is generated which has exactly N solutions that are easy to compute. This new system has the same number n of variables and the same number n of equations and the same general structure as the system to solve, f_1=0,\, \ldots,\, f_n=0. Then a
homotopy In topology, a branch of mathematics, two continuous functions from one topological space to another are called homotopic (from grc, ὁμός "same, similar" and "place") if one can be "continuously deformed" into the other, such a deform ...
between the two systems is considered. It consists, for example, of the straight line between the two systems, but other paths may be considered, in particular to avoid some singularities, in the system :(1-t)g_1+t f_1=0,\, \ldots,\, (1-t)g_n+t f_n=0. The homotopy continuation consists in deforming the parameter t from 0 to 1 and ''following'' the N solutions during this deformation. This gives the desired solutions for t = 1. ''Following'' means that, if t_1, the solutions for t=t_2 are deduced from the solutions for t=t_1 by Newton's method. The difficulty here is to well choose the value of t_2-t_1: Too large, Newton's convergence may be slow and may even jump from a solution path to another one. Too small, and the number of steps slows down the method.


Numerically solving from the rational univariate representation

To deduce the numeric values of the solutions from a RUR seems easy: it suffices to compute the roots of the univariate polynomial and to substitute them in the other equations. This is not so easy because the evaluation of a polynomial at the roots of another polynomial is highly unstable. The roots of the univariate polynomial have thus to be computed at a high precision which may not be defined once for all. There are two algorithms which fulfill this requirement. *
Aberth method The Aberth method, or Aberth–Ehrlich method or Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial. Th ...
, implemented in
MPSolve MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has spe ...
computes all the complex roots to any precision. * Uspensky's algorithm of Collins and Akritas, improved by Rouillier and Zimmermann and based on
Descartes' rule of signs In mathematics, Descartes' rule of signs, first described by René Descartes in his work ''La Géométrie'', is a technique for getting information on the number of positive real roots of a polynomial. It asserts that the number of positive roots i ...
. This algorithms computes the real roots, isolated in intervals of arbitrary small width. It is implemented in
Maple ''Acer'' () is a genus of trees and shrubs commonly known as maples. The genus is placed in the family Sapindaceae.Stevens, P. F. (2001 onwards). Angiosperm Phylogeny Website. Version 9, June 2008 nd more or less continuously updated since h ...
(functions ''fsolve'' and ''RootFinding solate').


Software packages

There are at least four software packages which can solve zero-dimensional systems automatically (by automatically, one means that no human intervention is needed between input and output, and thus that no knowledge of the method by the user is needed). There are also several other software packages which may be useful for solving zero-dimensional systems. Some of them are listed after the automatic solvers. The
Maple ''Acer'' () is a genus of trees and shrubs commonly known as maples. The genus is placed in the family Sapindaceae.Stevens, P. F. (2001 onwards). Angiosperm Phylogeny Website. Version 9, June 2008 nd more or less continuously updated since h ...
function ''RootFinding solate' takes as input any polynomial system over the rational numbers (if some coefficients are
floating point In computing, floating-point arithmetic (FP) is arithmetic that represents real numbers approximately, using an integer with a fixed precision, called the significand, scaled by an integer exponent of a fixed base. For example, 12.345 can ...
numbers, they are converted to rational numbers) and outputs the real solutions represented either (optionally) as intervals of rational numbers or as floating point approximations of arbitrary precision. If the system is not zero dimensional, this is signaled as an error. Internally, this solver, designed by F. Rouillier computes first a Gröbner basis and then a Rational Univariate Representation from which the required approximation of the solutions are deduced. It works routinely for systems having up to a few hundred complex solutions. The rational univariate representation may be computed with
Maple ''Acer'' () is a genus of trees and shrubs commonly known as maples. The genus is placed in the family Sapindaceae.Stevens, P. F. (2001 onwards). Angiosperm Phylogeny Website. Version 9, June 2008 nd more or less continuously updated since h ...
function ''Groebner ationalUnivariateRepresentation'. To extract all the complex solutions from a rational univariate representation, one may use
MPSolve MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has spe ...
, which computes the complex roots of univariate polynomials to any precision. It is recommended to run
MPSolve MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has spe ...
several times, doubling the precision each time, until solutions remain stable, as the substitution of the roots in the equations of the input variables can be highly unstable. The second solver is PHCpack, written under the direction of J. Verschelde. PHCpack implements the homotopy continuation method. This solver computes the isolated complex solutions of polynomial systems having as many equations as variables. The third solver is Bertini,Bertini: Software for Numerical Algebraic Geometry
/ref> written by D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. Bertini uses numerical homotopy continuation with adaptive precision. In addition to computing zero-dimensional solution sets, both PHCpack and Bertini are capable of working with positive dimensional solution sets. The fourth solver is the
Maple ''Acer'' () is a genus of trees and shrubs commonly known as maples. The genus is placed in the family Sapindaceae.Stevens, P. F. (2001 onwards). Angiosperm Phylogeny Website. Version 9, June 2008 nd more or less continuously updated since h ...
library ''RegularChains'', written by Marc Moreno-Maza and collaborators. It contains various functions for solving polynomial systems by means of
regular chain In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular ...
s.


See also

*
Elimination theory Elimination may refer to: Science and medicine *Elimination reaction, an organic reaction in which two functional groups split to form an organic product *Bodily waste elimination, discharging feces, urine, or foreign substances from the body ...
*
Systems of polynomial inequalities In mathematics, an inequality is a relation which makes a non-equal comparison between two numbers or other mathematical expressions. It is used most often to compare two numbers on the number line by their size. There are several different ...
*
Triangular decomposition In computer algebra, a triangular decomposition of a polynomial system is a set of simpler polynomial systems such that a point is a solution of if and only if it is a solution of one of the systems . When the purpose is to describe the soluti ...
*
Wu's method of characteristic set Wenjun Wu's method is an algorithm for solving multivariate polynomial equations introduced in the late 1970s by the Chinese mathematician Wen-Tsun Wu. This method is based on the mathematical concept of characteristic set introduced in the lat ...


References

* * * * {{DEFAULTSORT:Systems Of Polynomial Equations Equations Algebra Computer algebra Polynomials Algebraic geometry