| The Ontario Research Centre for Computer Algebra
The UWO ORCCA Reading Room
Abstract: This paper outlines some new algorithms for operations on multivariate polynomials. The point of view taken in the paper is that all polynomials considered are given by their values at known points, and that the degrees of the polynomials are known or can be deduced. The first nontrivial algorithm considered is division; then Bezout matrices, generalized companion matricies, GCD, and the solution of zero-dimensional polynomial systems are investigated. A new algorithm is given for such solution: neither Gr\"obner basis nor resultant-based, it shares some characteristics with resultant algorithms.
If you have any questions or comments regarding this page please send mail to