I'm looking for a fast algorithm to solve a system of N polynomial equations on 3 unknown variables. That is, given 3 functions, F0(x,y,z), F1(x,y,z)... FN(x,y,z)
, I want to find x, y, z
such that F0(x,y,z) = F1(x,y,z) = ... = FN(x,y,z) = 0
.
I've tried finding the solution in several different places, but I could only find very advanced papers on topics such as algebraic geometry or cryptography. What I need, though, is a simple/quick algorithm that returns a fast numerical solution. Is there such algorithm?