We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data\" of the system of differential equations through the theory of differential kernels to provide a new upper bound for proving the consistency of the system. We then prove a new upper bound for the effective differential Nullstellensatz, which determines a sufficient number of times to differentiate the original system in order to prove its inconsistency. Finally, we study the Rosenfeld-Gröbner algorithm, which approaches differential elimination by decomposing the given system of differential equations into simpler systems. We analyze the complexity of the Rosenfeld-Gröbner algorithm by computing an upper bound for the orders of the derivatives in all intermediate steps and in the output of the algorithm.
","abstract_html":"<p>We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data" of the system of differential equations through the theory of differential kernels to provide a new upper bound for proving the consistency of the system. We then prove a new upper bound for the effective differential Nullstellensatz, which determines a sufficient number of times to differentiate the original system in order to prove its inconsistency. Finally, we study the Rosenfeld-Gröbner algorithm, which approaches differential elimination by decomposing the given system of differential equations into simpler systems. We analyze the complexity of the Rosenfeld-Gröbner algorithm by computing an upper bound for the orders of the derivatives in all intermediate steps and in the output of the algorithm.</p>","abstract_has_math":false,"creators":["Gustavson, Richard"],"institution":"The Graduate School and University Center of The City University of New York","degree_name":"Doctor of Philosophy","degree_level":"Doctoral","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":["Alexey Ovchinnikov"],"committee_chairs":[],"committee_members":["Alexey Ovchinnikov","Richard Churchill","Benjamin Steinberg"],"year":2017,"date_issued":"2017-06-02T07:00:00Z","date_published":"2017-06-02T07:00:00Z","updated_at":"2026-07-24T02:00:35Z","subjects":["Algebra","Partial Differential Equations","algebraic differential equations","differential elimination algorithms","effective differential Nullstellensatz"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://academicworks.cuny.edu/gc_etds/1970","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Alexey Ovchinnikov"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Alexey Ovchinnikov","Richard Churchill","Benjamin Steinberg"]},{"key":"dc:creator","label":"Author","values":["Gustavson, Richard"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-03-08T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The Graduate School and University Center of The City University of New York"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Algebra","Partial Differential Equations","algebraic differential equations","differential elimination algorithms","effective differential Nullstellensatz"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://academicworks.cuny.edu/gc_etds/1970"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data\" of the system of differential equations through the theory of differential kernels to provide a new upper bound for proving the consistency of the system. We then prove a new upper bound for the effective differential Nullstellensatz, which determines a sufficient number of times to differentiate the original system in order to prove its inconsistency. Finally, we study the Rosenfeld-Gröbner algorithm, which approaches differential elimination by decomposing the given system of differential equations into simpler systems. We analyze the complexity of the Rosenfeld-Gröbner algorithm by computing an upper bound for the orders of the derivatives in all intermediate steps and in the output of the algorithm.
"]},{"key":"dc:title","label":"Title","values":["Elimination for Systems of Algebraic Differential Equations"]}]}],"canonical_facts":{"dc:contributor.advisor":["Alexey Ovchinnikov"],"dc:contributor.committeemember":["Alexey Ovchinnikov","Richard Churchill","Benjamin Steinberg"],"dc:creator":["Gustavson, Richard"],"dc:date.available":["2017-03-08T08:00:00Z"],"dc:description.abstract":["We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data\" of the system of differential equations through the theory of differential kernels to provide a new upper bound for proving the consistency of the system. We then prove a new upper bound for the effective differential Nullstellensatz, which determines a sufficient number of times to differentiate the original system in order to prove its inconsistency. Finally, we study the Rosenfeld-Gröbner algorithm, which approaches differential elimination by decomposing the given system of differential equations into simpler systems. We analyze the complexity of the Rosenfeld-Gröbner algorithm by computing an upper bound for the orders of the derivatives in all intermediate steps and in the output of the algorithm.
"],"dc:identifier":["https://academicworks.cuny.edu/gc_etds/1970"],"dc:subject":["Algebra","Partial Differential Equations","algebraic differential equations","differential elimination algorithms","effective differential Nullstellensatz"],"dc:title":["Elimination for Systems of Algebraic Differential Equations"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["The Graduate School and University Center of The City University of New York"]},"updated_at":"2026-07-24T02:00:35Z"}