Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881)

From MaRDI portal
Revision as of 15:54, 24 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Toward the best algorithm for approximate GCD of univariate polynomials
scientific article

    Statements

    Toward the best algorithm for approximate GCD of univariate polynomials (English)
    0 references
    0 references
    18 February 2021
    0 references
    symbolic-numeric algorithm for polynomials
    0 references
    approximate polynomial GCD
    0 references
    subresultant matrix
    0 references
    Sylvester matrix
    0 references
    QR factorization
    0 references
    rank structured matrix
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers