The procedure:
void ALIAS_Euclidian_Division(int Degree,INTERVAL_VECTOR &Coeff1, INTERVAL_VECTOR &Coeff2,INTERVAL &Residu,INTERVAL &a)computes the division of the polynomial P with interval coefficients Coeff1 by x-a and returns the polynomial P1 with coefficients Coeff2 such that P=(x-a)P1+Residu
Another procedure that perform the same process if a is a double is
void Divide_Single(int Degree,INTERVAL_VECTOR &Coeff1,double a, INTERVAL_VECTOR &Coeff2, INTERVAL &Residu)For dividing a polynomial
INTERVAL Divide_Evaluate_Multiple(int Degree,INTERVAL_VECTOR &Coeff1, int n,double *a,INTERVAL_VECTOR &X)where
For the Euclidian division by an arbitrary polynomial you may use
int Divide_Polynom(int Degree,INTERVAL_VECTOR &Coeff,int DegreeDivisor, INTERVAL_VECTOR &CoeffDivisor, INTERVAL_VECTOR &CoeffQuo, INTERVAL_VECTOR &CoeffRem)The polynomial
Note that Divide_Polynom and Divide_Evaluate_Multiple may be used to perform the deflation of an univariate polynomial as soon as approximate roots for the polynomial have been found. This may be useful to decrease the computation time for solving a polynomial or for numerically instable polynomial such as the Wilkinson polynomial. A combination of Rouche filtering and of deflation allows to solve Wilkinson polynomial of order 18, while the general solving procedure will fail starting at order 13.
A special Euclidian division is the division of a polynomial by
its derivative. This can be done with
void Quotient_UP_Derivative(int Degree,VECTOR &Coeff,VECTOR &CoeffD,VECTOR &Quo, VECTOR &Rem)where