Hybrid method for computing the nearest singular polynomials

DOI10.1007/BF03167469MaRDI QIDQ701907zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

error boundminimizationmultiple rootsnearest singular polynomialnumerical examplesquadratic formsymbolic-numeric algorithm

Mathematics Subject Classification ID

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

Review text

We propose a combined symbolic-numeric algorithm for computing the nearest singular polynomial and its multiple zero. Explicit expressions of the minimal and the nearest singular polynomials are presented. A theoretical error bound and several numerical examples are given.

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

Cites work

• Detection and validation of clusters of polynomial zeros
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1262454 (Why is no real title available?)
• scientific article; zbMATH DE number 3373921 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Nearest singular polynomials
• On approximate GCDs of univariate polynomials

Cited in

(8)

• Nearest singular polynomials
• Locating the closest singularity in a polynomial homotopy
• Approximate square-free part and decomposition
• Variable projection methods for approximate (greatest) common divisor computations
• 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
• Computing the nearest rank-deficient matrix polynomial

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)