As an alternative to interval solving `ALIAS` proposes a numerical
algorithm

ALIAS_Solve_Poly((double *C, int *Degree,double *Sol),The arguments are the coefficients

There is also a version of the Newton scheme for univariate polynomial:

int Fast_Newton(int Degree,REAL *Input,VECTOR &Coeff,VECTOR &CoeffG, double Accuracy,int Max_Iter,REAL *Residu)where

`Degree`is the degree of the polynomial`Input`: an approximation of the solution`Coeff`: the polynomial is written as`Coeff[1]+Coeff[2]x+.....Coeff[Degree+1]pow(x,Degree)``CoeffG`: the coefficients of the derivative of the polynomial`Accuracy`: the algorithm will stop if the absolute value of the evaluation of the polynomial at the current point is lower than this number`Max_Iter`: maximum number of iteration`Residu`: the value of the polynomial at the solution