0

Is there any way to tell how many clusters there are with respect to all the roots of a polynomial?

Specifically, I'm after the multiplicity of each root but since I would like to work in floating-point arithmetic I'm afraid I have to deal with clusters.

I don't mind any method of finding out: be it by numerical-iterative means during the convergence, a priori/a posteriori guess, maybe some matrix method would help..? If I have to set some small disk radius, that's ok, too.

Ecir Hana
  • 985
  • 1
  • 9
  • 20

1 Answers1

1

Probably the single most important result you need to know is Rouché's theorem.

However, for postprocessing the output of numerical iterative methods (Aberth-Ehrlich, Durand-Kerner, ...), have a look at Siegfried Rump's Ten methods to bound multiple roots of polynomials; in particular methods 4 and 5 by Neumaier (based on Gershgorin circles of the companion matrix in a suitable basis).

akobel
  • 700
  • 4
  • 7