Hybrid method for computing the nearest singular polynomials

DOI10.1007/BF03167469zbMATH Open1138.65049OpenAlexW2028594942MaRDI QIDQ701907FDOQ701907

Authors: Lihong Zhi, M.-T. Noda, Hiroshi Kai, Wenda 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

Recommendations

• Computing the nearest singular univariate polynomials with given root multiplicities
• Nearest singular polynomials
• scientific article; zbMATH DE number 1262454
• scientific article; zbMATH DE number 1254271
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

zbMATH Keywords

minimizationnumerical examplesquadratic formerror boundmultiple rootsnearest singular polynomialsymbolic-numeric algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On approximate GCDs of univariate polynomials
• Title not available (Why is that?)
• Detection and validation of clusters of polynomial zeros
• Nearest singular polynomials
• Title not available (Why is that?)

Cited In (6)

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

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

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