Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"Numerical algebraic geometry"”.
-
Newton Polytopes and Numerical Algebraic Geometry
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a …
-
Algorithms in numerical algebraic geometry and applications
… independent, are unified under the field of numerical algebraic geometry. With ties to some of the oldest areas in mathematics, numerical algebraic geometry is relatively young as a field of study in its own right. The field is concerned with the numerical approximation of the solution sets …
-
The numerical algebraic geometry approach to polynomial optimization
Numerical algebraic geometry (NAG) consists of a collection of numerical algorithms, based on homotopy continuation, to approximate the solution sets of systems of polynomial equations arising from applications in science and engineering. This research focused on finding global solutions to …
-
Gale duality, decoupling, parameter homotopies, and monodromy
Numerical Algebraic Geometry (NAG) has recently seen significantly increased application among scientists and mathematicians as a tool that can be used to solve nonlinear systems of equations, particularly polynomial systems. With the many recent advances in the field, we can now routinely solve …
-
Preconditioning polynomial systems using Macaulay dual spaces
… many years. Methods for solving these systems numerically fit into the field of numerical algebraic geometry. Many of these methods rely on an idea called homotopy continuation. This method is very effective for solving systems of polynomials in many variables. However, in the case of …
-
Identifying Trace Affine Linear Sets Using Homotopy Continuation
… an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new …
-
Avoiding singularities during homotopy continuation
In numerical algebraic geometry, the goal is to find solutions to a polynomial system F(x1,x2,...xn). This is done through a process called homotopy continuation. During this process, it is possible to encounter areas of ill-conditioning. These areas can cause failure of homotopy continuation or an …
-
FDOA-based passive source localization: a geometric perspective
… position is contained in the corresponding algebraic variety. This provides motivation for the use of methods from algebraic geometry, specifically numerical algebraic geometry (NAG), to solve for the emitter's location and gain insight into this system's interesting structure.
-
Symmetric ideals and numerical primary decomposition
The thesis considers two distinct strategies for algebraic computation with polynomials in high dimension. The first concerns ideals and varieties with symmetry, which often arise in applications from areas such as algebraic statistics and optimization. We explore the commutative algebra properties …
-
Preconditioning polynomial systems for homotopy continuation
… efficiently. One key solution method comes from Numerical Algebraic Geometry, specifically Homotopy Continuation. This method involves following paths from the solutions of a simpler system to the solutions of the target system. If we can follow fewer or better conditioned paths to the solution …
-
Finding and certifying numerical roots of systems of equations
Numerical algebraic geometry studies methods to approach problems in algebraic geometry numerically. Especially, finding roots of systems of equations using theory in algebraic geometry involves symbolic algorithm which requires expensive computations, numerical techniques often provides faster …
-
Sparse polynomial systems in optimization
… these systems is at the heart of computational algebraic geometry, a field which is often associated with symbolic computations based on Gr¨obner bases. Over the last thirty years, increasing performance and versatility made numerical algebraic geometry emerge as an alternative. It enables us to …
-
Hyper-gates Framework for Straight-line Programs and Their Applications in Nonlinear Algebra
… engineering, with their solutions studied with algebraic geometry and approximated by numerical algebraic geometry algorithms like homotopy continuation. These solvers rely on automatic (auto) differentiation, and since auto differentiation can be represented as an SLP, it is of great interest …
-
An analysis on the application of algebraic geometry in Initial Orbit Determination problems
… system that can be solved using tools from numerical algebraic geometry. This method is time-free and does not require any type of initialization. This makes it unaffected by the problems related to the estimate of the time-of-flight, that usually affects the accuracy of the solution. A …
-
Toric Newton-Okounkov Functions, the Kingman Coalescent, and Fully Mixed Cells
… with the study of problems from toric and numerical algebraic geometry, as well as mathematical population genetics from the perspective of discrete geometry. The introductory Chapter 1 contains a short summary of the results. Furthermore, we introduce the objects stemming from discrete …
-
Existence and Computation of Equilibria in Games and Economies
… 2013) by using recent developments in methods of numerical algebraic geometry. The Eraslan-McLennan model is a legisla- tive bargaining model which studies weighted voting games with players that are heterogeneous in their discount factors, voting weights and in terms of the probabilities of being …
-
Pseudo-Companion Matrices for Polynomial Systems
Roots of a scalar polynomial in one variable are frequently found by computing the eigenvalues of the standard companion matrix. In this exploratory work, we introduce the pseudo-companion matrix for finding roots of multivariable polynomial systems. In some cases, a perturbation of the polynomial …
-
Toric Varieties and Numerical Algorithms for Solving Polynomial Systems
… of equations. In particular, it includes two numerical homotopy continuation algorithms for numerically solving systems of equations. The first algorithm, the Cox homotopy, solves a system of equations on a compact toric variety. The Cox homotopy tracks points in the total coordinate space of …
-
Field Theoretic Lagrangian From Off-shell Supermultiplet Gauge Quotients
… in Lie algebras, sets off chains of algebraic paradigms in discrete-graph and continuous-field variables, the links of which feature distinct, supersymmetric Lagrangian templates. Collectively, these Adiankraic series air new symbolic genera for equation to phase moments in Feynman …