I'd like to find numerically a solution to a sparse system of 2000000 polynomial equations of degree 3 with 50000 variables and integer coefficients (or at least to decide whether or not a solution exists). Question: Is there an algorithm and a supercomputer for which this computation is tractable today?
Is the numerical resolution of this huge sparse polynomial system tractable?
numerical analysis;complexity;numpy;polynomials