Determining Roots of a Polynomial with Interval Estimates of Coefficients Let $f$ be a monic univariate polynomial with real coefficients:
$$f_A(x) = x^n + a_{n-1}x^{n-1} + ... + a_{0}$$
The values of $A=(a_{n-1},...,a_0)$ are unknown, but are estimated as $B=(b_{n-1},...,b_0)$ with error $\epsilon$.  Therefore, $b_i - \epsilon \leq a_i \leq b_i + \epsilon$.  Furthermore, the value of $\epsilon$ can be reduced arbitrarily, but cannot be set to 0.  (Changing $\epsilon$ will alter the $B$ estimates).  $lim_{\epsilon\rightarrow 0} B = A$
Question 1) Is there any method of determining if $f_A$ has a repeated root using $B$ and the ability to reduce $\epsilon$?
I've worked out how to isolate the roots of $f_A$ if $f_A$ does not have repeated roots as follows:
$D(A)$, the discriminant of $f_A$, must be non-zero.  As computing $D(B)$ from the Sylvester resultant of $f_B$ and $f_B'$ can be accomplished with only $+$ and $*$ operators, $g(\epsilon,B)$, the error propagated while calculating the resultant, must strictly increase.  We can decrease the value of $\epsilon$ until $D(B) + g(\epsilon,B) < 0$ or $D(B) - g(\epsilon,B) > 0$.  This gives us  the bound $|D(A)| \geq \min(|D(B) + g(\epsilon,B)|,|D(B) - g(\epsilon,B)|)$.  This lower bound for $|D(A)|$ can be plugged into Rump's inequality to generate a root separation bound.  Then Sturm's theorem can be applied until the roots are sufficiently isolated (including the error generated from $\epsilon$).
Question 2) If $f_A$ has multiple roots, is there any way of isolating these roots?
In this case, Sturm's theorem can isolate the roots to an arbitrary degree of precision, but without a root separation bound, there is no way to disambiguate between repeated roots and close roots.
If we try to calculate the number of distinct zeros as $n - \gcd(f_B,f_B')$, there will always be a remainder term $r$.  By reducing $\epsilon$, we might be able to make $r$ arbitrarily close to 0, but we run into the same problem as with Sturm's theorem in that we don't have an bound on $r$ which differentiates between $r=0$ and $r$ is just small.
 A: Polynomials with a multiple root form a Zariski closed set (vanishing of the discriminant, which is a certain polynomial in the coefficients); hence, this set is nowhere dense, whereas its complement is dense. In other words, in any neighborhood of any point, "most" polynomials are nonsingular, and it's very unlikely one can detect the singularity unless the coefficients are known exactly.
A: You might find the idea of Companion matrix to be useful. The eigenvalues $\lambda$ of the companion matrix $C$ are equal to the roots of a polynomial and its eigenvectors $v$ are functions of the eigen-values and $v$ are linearly independent iff the eigenvalues(ie, roots) are distinct. 
Now the question becomes that if only have noisy estimates of the companion matrix then is the original matrix diagonalizable. Interestingly there is a construction in linear algebra that shows that diagonalizable matrices are dense which means that we can always find polynomials with distinct roots no matter how small $\epsilon$ is. This is a linear algebraic way of stating what @Alex said above.
I wish I could knew more about how the eigenvalues of $A$ change with perturbations  (by using Weyl's inequalities perhaps) but I now realize that $A$ is non-hermitian and all the standard textbook theory only talks about hermitian matrices.  
A: You may want to look into the notion of "pseudospectrum" or "pseudo-zero set".  The $\epsilon$-pseudospectrum of a matrix $A$ is the set of points in the complex plane which are eigenvalues of matrices that are $\epsilon$-close to $A$ (under some choice of norm).  The pseudozero set is an analogous quantity defined for polynomial zeros.  Just by googling around I think one place to start would be the papers of Stef Graillat.
