# Exact gcd of integer polynomials in matlab

The following Matlab project contains the source code and Matlab examples used for exact gcd of integer polynomials. The polynomial GCD of two given polynomials can be found exactly if the polynomial coefficients are all integers.

# Gcd of polynomials in matlab

The following Matlab project contains the source code and Matlab examples used for gcd of polynomials. In the longhand polynomial division given as       P(k) = P(k-2) - P(k-1)*Q(k) The quotient Q(k) and the remainder P(k) are obtained from dividing the dividend P(k-2) by the divisor P(k-1).

# Manipulate and solve systems of multivariate polynomial equations by computing the groebner basis in matlab

The following Matlab project contains the source code and Matlab examples used for manipulate and solve systems of multivariate polynomial equations by computing the groebner basis . Example: simplify the system of equations   {x^2+2xy^2=0, xy+2y^3=1} >> groebner({'x^2+2*x*y^2','x*y+2*y^3-1'},'lex',{'x','y'}) returns {'y^3-0.

# Polynomial division derived form covolution in matlab

The following Matlab project contains the source code and Matlab examples used for polynomial division derived form covolution. For the division of univariate polynomials, given the dividend b(x) of degree n and the divisor a(x) of degree m, such that b(x) = q(x)*a(x) + r(x), the quotient q(x) of degree n-m and the remainder r(x) of degree m-1 are then obtained. 