COMING SOON! PQDT Open is getting a new home!

ProQuest Open Access Dissertations & Theses will remain freely available as part of a new and enhanced search experience at

Questions? Please refer to this FAQ.

Dissertation/Thesis Abstract

Connectivity in Semi-Algebraic Sets
by Rohal, James Joseph, Ph.D., North Carolina State University, 2014, 100; 3647578
Abstract (Summary)

A semi-algebraic set is a subset of real space defined by polynomial equations and inequalities and is a union of finitely many maximally connected components. In this thesis we consider the problem of deciding whether two given points in a semi-algebraic set are connected; that is, whether the two points lie in the same connected component. In particular, we consider the semi-algebraic set defined by f ≠ 0 where f is a given polynomial. The motivation comes from the observation that many important or non-trivial problems in science and engineering can be often reduced to that of connectivity. Due to its importance, there has been intense research effort on the problem. We will describe a symbolic-numeric method for solving this problem based on gradient ascent. In the first part of this thesis we will describe the symbolic part of the method. In a forthcoming second paper, we will describe the numeric part of the method. The second part of this thesis focuses on proving the partial correctness and termination of the symbolic method assuming the correctness of the numeric part. In the third part of the thesis we give an upper bound on the length of a path connecting the two input points if they lie in a same connected component. In the last part of the thesis we give experimental timing results for the symbolic-numeric method.

Indexing (document details)
Advisor: Hong, Hoon
School: North Carolina State University
School Location: United States -- North Carolina
Source: DAI-B 76/05(E), Dissertation Abstracts International
Subjects: Applied Mathematics, Mathematics
Keywords: Connectivity, Morse theory, Motion planning, Semi-algebraic sets
Publication Number: 3647578
ISBN: 978-1-321-40900-0
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy