Hybrid method for computing the nearest singular polynomials

DOI10.1007/BF03167469zbMath1138.65049OpenAlexW2028594942MaRDI QIDQ701907

Matu-Tarow Noda, Hiroshi Kai, Lihong Zhi, Wen Da Wu

Publication date: 14 January 2005

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167469

zbMATH Keywords

numerical examplesquadratic formerror boundminimizationmultiple rootsnearest singular polynomialsymbolic-numeric algorithm

Mathematics Subject Classification ID

Related Items (5)

Approximate gcds of polynomials and sparse SOS relaxations ⋮ Computing the nearest singular univariate polynomials with given root multiplicities ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Approximate square-free part and decomposition ⋮ Variable projection methods for approximate (greatest) common divisor computations

Cites Work

• On approximate GCDs of univariate polynomials
• Nearest singular polynomials
• Detection and validation of clusters of polynomial zeros
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid method for computing the nearest singular polynomials