Computing the nearest singular univariate polynomials with given root multiplicities

DOI10.1016/J.TCS.2012.10.027zbMATH Open1291.65082OpenAlexW2100678196MaRDI QIDQ385010FDOQ385010

Lihong Zhi, Zijia Li

Publication date: 29 November 2013

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

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

Recommendations

• Hybrid method for computing the nearest singular polynomials
• Nearest singular polynomials
• scientific article; zbMATH DE number 1262454
• A note on a nearest polynomial with a given root
• scientific article; zbMATH DE number 1254271

zbMATH Keywords

multiple rootsmultiplicity structurenearest singular polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Approximation by polynomials (41A10) Real polynomials: location of zeros (26C10) Numerical approximation and computational geometry (primarily algorithms) (65D99) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cites Work

• Nearest multivariate system with given root multiplicities
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Nearest singular polynomials
• Title not available (Why is that?)
• Computing multiple roots of inexact polynomials
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited
• Hybrid method for computing the nearest singular polynomials

Cited In (8)

• Hybrid method for computing the nearest singular polynomials
• Locating the closest singularity in a polynomial homotopy
• A unified approach to computing the nearest complex polynomial with a given zero
• Approximate square-free part and decomposition
• Efficient computation of dual space and directional multiplicity of an isolated point
• Variable projection methods for approximate (greatest) common divisor computations
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value

Uses Software

• MultRoot

This page was built for publication: Computing the nearest singular univariate polynomials with given root multiplicities

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