Date of Award


Degree Type


Degree Name

Master of Science


Applied Mathematics


Dr. Greg Reid


The main result of this thesis is to give a method for approximating the Grobner basis of an approximate polynomial system. The Grobner basis of a polynomial system is arguably the most fundamental object of exact computation polynomial algebra, as it answers many of the important questions of commutative algebra, such as ideal membership and computation of the Hilbert polynomial. It is traditionally computed using variants of Buchberger’s algorithm. Here, we take a backwards approach, and show that a Grobner basis can be computed using the Hilbert polynomial and another important basis from the jet theory of partial differential equations: an involutive basis. This direction, motivated by approximate systems, will allow us to avoid the strict monomial orderings and ordered elimination (reduction) strategies, at the heart of Buchberger-type methods, which are usually numerically unstable. For the the computation of exact bases for an ideal near to the one from which we began, we make avid use of structured (numerical) linear algebra. Additionally, we introduce approximate leading terms and an approximate reduced row echelon form. Neither of these require Gaussian elimination, unlike the exact case.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.