Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots (1998)

by Markus A. Hitz
Citations:37 - 12 self

Documents Related by Co-Citation

83 The Singular Value Decomposition for Polynomial Systems – Robert M. Corless, Patrizia M. Gianni, Barry M. Trager, Stephen M. Watt - 1995
51 Approximate polynomial greatest common divisors and nearest singular polynomials – N Karmarkar, Y N Lakshman - 1996
758 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones – Jos F. Sturm - 1998
23 On approximate GCDs of univariate polynomials – N K Karmarkar, Y N Lakshman - 1998
43 Certified approximate univariate GCDs – Ioannis Z. Emiris, AndrĂ© Galligo, Henri Lombardi - 1997
4756 Matrix Analysis – R A Horn, C R Johnson - 2012
861 Accuracy and Stability of Numerical Algorithms – N J Higham - 2002
613 Theoretical Numerical Methods for Least Squares Problems – A Bjorck - 1996
19 A numerical absolute primality test for bivariate polynomials – AndrĂ© Galligo, Stephen M Watt - 1997