The nearest polynomial with a zero in a given domain

DOI10.1016/J.TCS.2008.09.006MaRDI QIDQ2378507zbMATH OpenOpenAlexFDO

Authors Hiroshi Sekigawa

Publication date 8 January 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.09.006

zbMATH Keywords

\(l^\infty \)-normalgorithmnearest polynomialperturbationzero

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• The nearest complex polynomial with a zero in a given complex domain
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
• The nearest polynomial to multiple given polynomials with a given zero in the real case
• The nearest polynomial with a given zero, revisited

Cites work

• A note on a nearest polynomial with a given root
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• scientific article; zbMATH DE number 3846864 (Why is no real title available?)
• scientific article; zbMATH DE number 3613366 (Why is no real title available?)
• scientific article; zbMATH DE number 3616739 (Why is no real title available?)
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• scientific article; zbMATH DE number 621810 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 794708 (Why is no real title available?)
• Locating real multiple zeros of a real interval polynomial
• On the location of zero of an interval polynomial
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• Root Neighborhoods of a Polynomial
• Stability conditions for polytopes of polynomials
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited
• The nearest polynomial with a zero in a given domain from a geometrical viewpoint

Cited in

(10)

• 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
• Efficient computation of the nearest polynomial by linearized alternating direction method
• The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
• Polynomials With {0, +1, -1} Coefficients and a Root Close to a Given Point
• Overdetermined Weierstrass iteration and the nearest consistent system
• 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
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

This page was built for publication: The nearest polynomial with a zero in a given domain

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