Hybrid method for computing the nearest singular polynomials (Q701907)

From MaRDI portal
Revision as of 14:49, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1152676)
scientific article
Language Label Description Also known as
English
Hybrid method for computing the nearest singular polynomials
scientific article

    Statements

    Hybrid method for computing the nearest singular polynomials (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2005
    0 references
    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.
    0 references
    symbolic-numeric algorithm
    0 references
    nearest singular polynomial
    0 references
    error bound
    0 references
    numerical examples
    0 references
    quadratic form
    0 references
    minimization
    0 references
    multiple roots
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references