GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients (Q5188250)

From MaRDI portal
Revision as of 23:37, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5679802
Language Label Description Also known as
English
GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
scientific article; zbMATH DE number 5679802

    Statements

    0 references
    10 March 2010
    0 references
    numerical examples
    0 references
    iterative method
    0 references
    greatest common divisor
    0 references
    polynomials with complex coefficients
    0 references
    algorithm
    0 references
    constrained minimization problem
    0 references
    Newton method
    0 references
    gradient-projection method
    0 references
    math.AC
    0 references
    cs.SC
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references