The nearest complex polynomial with a zero in a given complex domain

DOI10.1016/J.TCS.2011.09.016MaRDI QIDQ650944zbMATH OpenOpenAlexFDO

Authors Wenyu Hu, D. Sheen, Zhongxuan Luo

Publication date 7 December 2011

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

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

zbMATH Keywords

perturbationlocation of zerosunivariate polynomialnearest polynomial

Mathematics Subject Classification ID

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

Recommendations

• Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
• The nearest polynomial with a zero in a given domain
• A note on a nearest polynomial with a given root
• 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

Cites work

• scientific article; zbMATH DE number 2125604 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• 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
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Locating real multiple zeros of a real interval polynomial
• Numerical Polynomial Algebra
• On approximate GCDs of univariate polynomials
• On the asymptotic and practical complexity of solving bivariate systems over the reals
• On the location of pseudozeros of a complex interval polynomial
• On the location of zero of an interval polynomial
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Root Neighborhoods of a Polynomial
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
• Structured singular values and stability analysis of uncertain polynomials. II: A missing link
• 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
• The nearest polynomial with a zero in a given domain from a geometrical viewpoint

Cited in

(8)

• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• 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 Real Polynomial with a Real Multiple Zero in a Given Real Interval
• 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

Describes a project that uses

Uses Software

• HOM4PS

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

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