{"id":{"repo_id":"uwo","oai_identifier":"oai:uwo.scholaris.ca:20.500.14721/19954"},"canonical_url":"https://search.dev.ndltd.org/etd/uwo/oai:uwo.scholaris.ca:20.500.14721/19954","repository":{"repo_id":"uwo","name":"Western University","base_url":"https://uwo.scholaris.ca/server/oai/request"},"display":{"title":"APPROXIMATE GROBNER BASES A BACKWARDS APPROACH","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Scott, Robin J."],"institution":null,"degree_name":"M Sc","degree_level":null,"degree_discipline":"Applied Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":["Reid, Greg"],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-01-01","date_published":"2006-01-01","updated_at":"2026-07-27T21:56:01Z","subjects":["Approximate Coefficients","Grobner Bases","Hilbert Polynomial","Partial Differential Equations","Involutive Systems","Nearby Systems","Numerical Linear Algebra","Polynomial Algebra","Reduced Row Echelon Form","Singular Value Decomposition","Structured Matrices."],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14721/19954","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Reid, Greg"]},{"key":"dc:creator","label":"Author","values":["Scott, Robin J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-06-25T19:12:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-06-25T19:12:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2006-01-01"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Applied Mathematics"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M Sc"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Approximate Coefficients","Grobner Bases","Hilbert Polynomial","Partial Differential Equations","Involutive Systems","Nearby Systems","Numerical Linear Algebra","Polynomial Algebra","Reduced Row Echelon Form","Singular Value Decomposition","Structured Matrices."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14721/19954"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["APPROXIMATE GROBNER BASES A BACKWARDS APPROACH"]}]}],"canonical_facts":{"dc:contributor.advisor":["Reid, Greg"],"dc:creator":["Scott, Robin J."],"dc:date.accessioned":["2025-06-25T19:12:56Z"],"dc:date.available":["2025-06-25T19:12:56Z"],"dc:date.issued":["2006-01-01"],"dc:description.abstract":["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."],"dc:identifier.uri":["https://hdl.handle.net/20.500.14721/19954"],"dc:subject":["Approximate Coefficients","Grobner Bases","Hilbert Polynomial","Partial Differential Equations","Involutive Systems","Nearby Systems","Numerical Linear Algebra","Polynomial Algebra","Reduced Row Echelon Form","Singular Value Decomposition","Structured Matrices."],"dc:title":["APPROXIMATE GROBNER BASES A BACKWARDS APPROACH"],"dc:type":["thesis"],"thesis:degree_discipline":["Applied Mathematics"],"thesis:degree_name":["M Sc"]},"updated_at":"2026-07-27T21:56:01Z"}