An alternative algorithm for computing the pseudo-remainder of multivariate polynomials (Q2489188)

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 5023471
Language Label Description Also known as
default for all languages
No label defined
    English
    An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
    scientific article; zbMATH DE number 5023471

      Statements

      An alternative algorithm for computing the pseudo-remainder of multivariate polynomials (English)
      0 references
      0 references
      16 May 2006
      0 references
      The author presents a new method to compute the pseudo-remainder for multivariate polynomials from the ring \({ R}\) that is restricted to a unique factorization domain. This method reduces the problem of computing the pseudo-remainder to finding the determinant of a matrix, which can be found with the help of coefficient of certain polynomials. There are 8 examples that show the efficiency of the new algorithm when one computes the determinants of matrices by using Gaussian elimination in the Maple system.
      0 references
      Multivariate polynomial
      0 references
      Pseudo-remainder
      0 references
      Gaussian elimination
      0 references
      Determinant of a matrix
      0 references
      Numerical examples
      0 references

      Identifiers