# High-Performance Numeric Solution of Polynomial Systems

Mathematica 10 includes a new homotopy-based numerical polynomial solver. This method is automatically selected when appropriate. The following charts compare the timing of this new algorithm with Mathematica 9's Gröbner-basis method and the faster of Maple 18's solve or Homotopy commands. All tests were performed on a 16-core, 2.40 GHz 64-bit Linux system with Hyper-Threading enabled and a time limit of 12 hours.

Comparison for a standard economics system in variables, total degree , and distinct solutions, given by the following formula.

 In[1]:= Xeco[k_] := Append[ Table[(Subscript[x, i] + Sum[Subscript[x, j] Subscript[x, j + 1], {j, i, k - 2}]) Subscript[x, k] - i == 0, {i, 1, k - 1}], Sum[Subscript[x, i], {i, 1, k - 1}] + 1 == 0]

For example, for the system takes the following form.

 In[2]:= XColumn[eco[8]] // TraditionalForm

Comparison for the standard Noonburg neural-network system, given by the following formula. For variables, this system has total degree and different solutions.

 In[3]:= Xnoon[k_] := Table[Subscript[x, i] (Sum[Subscript[x, j]^2, {j, 1, k}] - Subscript[x, i]^2 - 1.1) + 1 == 0, {i, 1, k}]

For example, in five variables the system takes the following form.

 In[4]:= XColumn[noon[5]] // TraditionalForm