On computing nearest singular hankel matrices
Efficient algorithms for computing the nearest polynomial with constrained roots
Efficient algorithms for computing the nearest polynomial with a real root and related problems
Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC ’98
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC ’05
Proceedings of the 1999 international symposium on Symbolic and algebraic computation - ISSAC ’99
Erich Kaltofen
Y. N. Lakshman