Fast Computation in Quotient Rings

Roman Pearce, CECM, SFU

Friday January 13th, 2006 at 10:30am in K9509.


We will discuss the problem of computing in polynomial quotient rings and
their fields of fractions. In particular, we will show how the normal form
algorithm (which computes canonical forms for polynomials) can be sped up
by at least an order of magnitude over its usual Maple implementation.
We will also consider the problem of computing inverses when the quotient
ring is a field.