The nearest polynomial with a given zero, and similar problems
From MaRDI portal
Publication:4810163
DOI10.1145/500457.500458zbMath1097.65524OpenAlexW2027267671MaRDI QIDQ4810163
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/500457.500458
Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)
Related Items (14)
Pseudozeros of multivariate polynomials ⋮ The nearest polynomial with a zero in a given domain ⋮ Efficient computation of the nearest polynomial by linearized alternating direction method ⋮ Computing the nearest singular univariate polynomials with given root multiplicities ⋮ The nearest complex polynomial with a zero in a given complex domain ⋮ Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions ⋮ On approximate triangular decompositions in dimension zero ⋮ The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval ⋮ Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems ⋮ A Sequence of Nearest Polynomials with Given Factors ⋮ Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization ⋮ On real factors of real interval polynomials ⋮ A unified approach to computing the nearest complex polynomial with a given zero ⋮ The nearest polynomial to multiple given polynomials with a given zero in the real case
This page was built for publication: The nearest polynomial with a given zero, and similar problems
