Archive for the 'CM30070' Category

Greatest common divisor

Tuesday, February 8th, 2005

View as: view on E2  view as PDF

Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.

Buchberger’s Algorithm

Thursday, January 20th, 2005

View as: view on E2  view as PDF

An algorithm for determining a Gröbner basis for a collection of polynomials.

Gröbner Basis

Tuesday, January 18th, 2005

View as: view on E2  view as PDF

A Gröbner basis for a system of polynomials preserves the common roots whilst being simpler relative to an ordering.

Canonical Representation of polynomials

Saturday, January 15th, 2005

View as: view on E2  view as PDF

Discussion of canonical forms for polynomials- single variable dense and sparse representations; orderings for multivariate polynomials.