Efficient algorithms for computing the nearest polynomial with constrained roots

Authors:
Erich Kaltofen;Joseph E. Flaherty;Markus Alois Hitz
Affiliations:
-;-;-
Venue:
Efficient algorithms for computing the nearest polynomial with constrained roots
Year:
1998

Citing 0
Cited 3

Efficient algorithms for computing the nearest polynomial with constrained roots

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with a real root and related problems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A note on a nearest polynomial with a given root

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract