Hybrid method for computing the nearest singular polynomials
Copyright policy )Hybrid method for computing the nearest singular polynomials
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.
- Beijing Computing Center China (People's Republic of)
- Ehime University Japan
numerical examples, nearest singular polynomial, Numerical mathematical programming methods, multiple roots, error bound, Computational aspects of field theory and polynomials, minimization, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), quadratic form, symbolic-numeric algorithm
numerical examples, nearest singular polynomial, Numerical mathematical programming methods, multiple roots, error bound, Computational aspects of field theory and polynomials, minimization, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), quadratic form, symbolic-numeric algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!