Highly Influenced

# 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} }

- Published 1998 in ISSAC
DOI:10.1145/281508.281624

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

#### From This Paper

##### Figures, tables, and topics from this paper.

27 Citations

4 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential

Highly Influential