Hybrid method for computing the nearest singular polynomials (Q701907): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:01, 5 March 2024

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
    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