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

Cites Work

HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
On the asymptotic and practical complexity of solving bivariate systems over the reals
Title not available (Why is that?)
Title not available (Why is that?)
On approximate GCDs of univariate polynomials
Title not available (Why is that?)
Numerical Polynomial Algebra
Real Algebraic Numbers: Complexity Analysis and Experimentation
Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
Complexity of Bezout's theorem. V: Polynomial time
Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
Title not available (Why is that?)
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
Title not available (Why is that?)
Root Neighborhoods of a Polynomial
A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
Structured singular values and stability analysis of uncertain polynomials. II: A missing link
On the location of pseudozeros of a complex interval polynomial
Locating real multiple zeros of a real interval polynomial
Title not available (Why is that?)
The nearest polynomial with a zero in a given domain from a geometrical viewpoint
A note on a nearest polynomial with a given root
Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems

Cited In (6)

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
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
A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension

Uses Software

HOM4PS

   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 👍 👎

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)