Computing the nearest singular univariate polynomials with given root multiplicities

DOI10.1016/J.TCS.2012.10.027MaRDI QIDQ385010zbMATH OpenOpenAlexFDO

Authors Zijia Li, Lihong Zhi

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

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)

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

Cites work

• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• Computing multiple roots of inexact polynomials
• Hybrid method for computing the nearest singular polynomials
• Nearest multivariate system with given root multiplicities
• Nearest singular polynomials
• Numerical Polynomial Algebra
• The nearest polynomial with a given zero, and similar problems
• The nearest polynomial with a given zero, revisited

Cited in

(11)

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

Describes a project that uses

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)