The nearest complex polynomial with a zero in a given complex domain
type: Item
instance of: scholarly article
title: The nearest complex polynomial with a zero in a given complex domain
zbMATH Open document ID: 1228.68066
author: Wenyu Hu
author: D. Sheen
author: Zhongxuan Luo
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12D10
zbMATH DE Number: 5987020
zbMATH Keywords: nearest polynomial
zbMATH Keywords: location of zeros
zbMATH Keywords: perturbation
zbMATH Keywords: univariate polynomial
describes a project that uses: HOM4PS
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.09.016
OpenAlex ID: W2010087264
cites work: Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
cites work: Structured singular values and stability analysis of uncertain polynomials. II: A missing link
cites work: On the asymptotic and practical complexity of solving bivariate systems over the reals
cites work: Real Algebraic Numbers: Complexity Analysis and Experimentation
cites work: Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
cites work: A note on a nearest polynomial with a given root
cites work: Q4232504
cites work: Q4227320
cites work: On approximate GCDs of univariate polynomials
cites work: HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
cites work: Q5546070
cites work: Root Neighborhoods of a Polynomial
cites work: Q5723445
cites work: A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
cites work: The nearest polynomial with a given zero, revisited
cites work: Q3447178
cites work: Locating real multiple zeros of a real interval polynomial
cites work: On the location of pseudozeros of a complex interval polynomial
cites work: The nearest polynomial with a zero in a given domain
cites work: The nearest polynomial with a zero in a given domain from a geometrical viewpoint
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
cites work: Q3156429
cites work: Numerical Polynomial Algebra
cites work: The nearest polynomial with a given zero, and similar problems
DOI: 10.1016/J.TCS.2011.09.016
description: scientific article; zbMATH DE number 5987020