Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots

@inproceedings{Hitz1998EfficientAF,
  title={Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots},
  author={Markus A. Hitz and Erich Kaltofen},
  booktitle={ISSAC},
  year={1998}
}
The location of polynomial roots is sensitive to perturbations of the coefficients. C ontinuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem of finding the minimal perturbations to the coefficients to move one or seve ral roots to given loci. We measure minimality in the Euclidean distance to the coefficient vector, as well as the maximal coefficient-wise change in absolute value (i nfinity norm), and in the Manhattan norm ( l1-norm). In the… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
27 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

How near is a stable polynomial to an unstable polynomial

  • M. A. ing
  • IEEE Trans . Circuits Syst . I CAS -
  • 1997
Highly Influential
8 Excerpts

Distance of a complex coefficient

  • A. C. Desages, L. Castro, H Cendra
  • 1992
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…