Efficient algorithms for computing the nearest polynomial with constrained roots
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On computing nearest singular hankel matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A note on a nearest polynomial with a given root
ACM SIGSAM Bulletin
A gain-based lower bound algorithm for real and mixed µ problems
Automatica (Journal of IFAC)
The nearest complex polynomial with a zero in a given complex domain
Theoretical Computer Science
Structured Pseudospectra for Small Perturbations
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.00 |