Nearest singular polynomials
From MaRDI portal
Publication:1281843
DOI10.1006/jsco.1998.0233zbMath0917.65055MaRDI QIDQ1281843
Publication date: 22 March 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0233
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
30C10: Polynomials and rational functions of one complex variable
Related Items
Hybrid method for computing the nearest singular polynomials, Nearest multivariate system with given root multiplicities, On real factors of real interval polynomials, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, Approximate gcds of polynomials and sparse SOS relaxations, The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval