I was wondering if it were possible to efficiently solve the common root of 4 polynomials in 4 variables algebraically. I am currently using a gradient descent method, which can find these roots in a couple seconds; however, I am concerned about local minima.(adsbygoogle = window.adsbygoogle || []).push({});

So far I have attempted to use the Caylay-Dixon and Macaualy resultant to solve this problem, but these methods take far more memory to compute than is available. Is there a method that is more efficient than the ones I have tried?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Common roots of multivariate polynomials

Loading...

Similar Threads - Common roots multivariate | Date |
---|---|

Can anyone give a common-sense explanation of singular values? | Dec 10, 2012 |

Looking for a common solution of two systems | Nov 29, 2012 |

Theorem 1.2.1. Common Divisor | Jun 21, 2012 |

Common factor : new algo? | Mar 15, 2012 |

**Physics Forums - The Fusion of Science and Community**