Back to search

Clemson University

Certified Approximation Algorithms of Algebraic Curves

Abstract

dc:description.abstract

One of the fundamental problems in mathematics is to determine the set of solutions to a system of equations. In algebraic geometry, the equations studied are polynomials, and the solution set is called an algebraic variety. For single variable polynomials of degree less than five, the roots can be determined exactly using algebraic methods, but for polynomials of degree five or higher, numerical methods are required. When using numerical methods, it is important to know when the computed approximation is indeed a correct solution, which leads to the idea of a certified algorithm. An algorithm is said to be certified if it outputs both the solution to the problem and a certificate (a proof) that the solution is correct. In this dissertation, I study the problem of approximating algebraic curves using certified methods with a focus on correctly handling intersection points of the curves.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
School of Mathematical and Statistical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Byrd, Michael, Jr.
Contributors dc:contributor
  • Michael Burr
  • James Coykendall
  • Brian Dean
  • Shuhong Gao
  • Svetlana Poznanovikj

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/4083

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Byrd, Michael, Jr.. Certified Approximation Algorithms of Algebraic Curves. Dissertation thesis, https://open.clemson.edu/all_dissertations/4083