This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...