A unified approach to computing the nearest complex polynomial with a given zero

DOI10.1016/J.TCS.2015.06.015zbMATH Open1329.65095OpenAlexW578674925MaRDI QIDQ2354766FDOQ2354766

Xingjun Luo, Wenyu Hu, Zhongxuan Luo

Publication date: 24 July 2015

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

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

zbMATH Keywords

Lagrange dual problemdual normexplicit expressionnearest polynomial

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model Selection and Estimation in Regression with Grouped Variables
• Nearest multivariate system with given root multiplicities
• On approximate GCDs of univariate polynomials
• Numerical Polynomial Algebra
• Convex multi-task feature learning
• Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\)
• Computing the nearest singular univariate polynomials with given root multiplicities
• 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
• Root Neighborhoods of a Polynomial
• A simple procedure for the exact stability robustness computation of polynomials with affine coefficient perturbations
• A note on a nearest polynomial with a given root
• 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
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• Nearest matrix with two prescribed eigenvalues
• The nearest polynomial to multiple given polynomials with a given zero
• Using weighted norms to find nearest polynomials satisfying linear constraints

Cited In (4)

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

Uses Software

• MultRoot

This page was built for publication: A unified approach to computing the nearest complex polynomial with a given zero

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