The nearest polynomial with a given zero, revisited

DOI10.1145/1113439.1113442zbMath1341.12002OpenAlexW2078605119MaRDI QIDQ5739514

Nargol Rezvani, Robert M. Corless

Publication date: 18 July 2016

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1113439.1113442

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (11)

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 ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval ⋮ 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, revisited