The nearest complex polynomial with a zero in a given complex domain
From MaRDI portal
Publication:650944
DOI10.1016/j.tcs.2011.09.016zbMath1228.68066OpenAlexW2010087264MaRDI QIDQ650944
Wenyu Hu, Dongwoo Sheen, Zhong-xuan 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
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items (4)
Efficient computation of the nearest polynomial by linearized alternating direction method ⋮ The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
- Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On approximate GCDs of univariate polynomials
- 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
- Complexity of Bezout's theorem. V: Polynomial time
- The nearest polynomial with a zero in a given domain
- On the location of pseudozeros of a complex interval polynomial
- Locating real multiple zeros of a real interval polynomial
- Root Neighborhoods of a Polynomial
- The nearest polynomial with a given zero, and similar problems
- Numerical Polynomial Algebra
- The nearest polynomial with a zero in a given domain from a geometrical viewpoint
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- A note on a nearest polynomial with a given root
- The nearest polynomial with a given zero, revisited
This page was built for publication: The nearest complex polynomial with a zero in a given complex domain
