Sciweavers

6 search results - page 2 / 2
» issac 1998
Sort
View
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 2 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen