Stably computing the multiplicity of known roots given leading coefficients

We show that a monic univariate polynomial over a field of characteristic zero, with k distinct nonzero known roots, is determined by precisely k of its proper leading coefficients. Furthermore, we give an explicit, numerically stable algorithm for computing the exact multiplicities of each root ove...

Full description

Bibliographic Details
Main Authors: Clark, G, Cooper, J
Format: Journal article
Language:English
Published: Wiley 2019