The nearest polynomial with a given zero, and similar problems

DOI10.1145/500457.500458zbMATH Open1097.65524OpenAlexW2027267671MaRDI QIDQ4810163FDOQ4810163

Authors: Hans J. Stetter 

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

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)

Cited In (15)

• Efficient computation of the nearest polynomial by linearized alternating direction method
• The nearest polynomial with a zero in a given domain
• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
• 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
• Pseudozeros of multivariate polynomials
• A sequence of nearest polynomials with given factors
• On approximate triangular decompositions in dimension zero
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
• On real factors of real interval polynomials
• 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
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
• Computing the nearest singular univariate polynomials with given root multiplicities

This page was built for publication: The nearest polynomial with a given zero, and similar problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810163)