Two resultant based methods computing the greatest common divisor of two polynomials (Q5710620)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2235293
Language Label Description Also known as
default for all languages
No label defined
    English
    Two resultant based methods computing the greatest common divisor of two polynomials
    scientific article; zbMATH DE number 2235293

      Statements

      Numerical Analysis and Its Applications (English)
      0 references
      Two resultant based methods computing the greatest common divisor of two polynomials (English)
      0 references
      0 references
      0 references
      2 December 2005
      0 references
      Greater Common Divisor
      0 references
      Sylvester matrix
      0 references
      Gaussian elimination
      0 references
      QR factorization
      0 references

      Identifiers