Computing the nearest singular univariate polynomials with given root multiplicities

DOI10.1016/j.tcs.2012.10.027zbMath1291.65082OpenAlexW2100678196MaRDI QIDQ385010

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

zbMATH Keywords

multiple rootsmultiplicity structurenearest singular polynomial

Mathematics Subject Classification ID

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

Related Items (4)

Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Approximate square-free part and decomposition ⋮ A unified approach to computing the nearest complex polynomial with a given zero ⋮ Variable projection methods for approximate (greatest) common divisor computations

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Hybrid method for computing the nearest singular polynomials
• Nearest multivariate system with given root multiplicities
• Nearest singular polynomials
• Computing multiple roots of inexact polynomials
• The nearest polynomial with a given zero, and similar problems
• Numerical Polynomial Algebra
• The nearest polynomial with a given zero, revisited

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