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 8 of 8 for “"Polynomial system solving"”.
-
Exact polynomial system solving for robust geometric computation
… an exact method for computing roots of a system of multivariate polynomials with rational coefficients, called the rational univariate reduction. This method enables performance of exact algebraic computation of coordinates of the roots of polynomials. In computational geometry, curves, …
-
Polyhedral homotopy and its applications to polynomial system solving
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1998
-
Algorithms for Analytic Combinatorics in Several Variables
… first algorithm applies numerical methods for polynomial system solving to compute minimal points which are essential to asymptotics, while the second algorithm leverages the geometry of a so-called height map in two variables to compute asymptotics even in the absence of minimal points. We …
-
Unrestricted dynamic Gröbner Basis algorithms
… necessary tool to solve many problems involving polynomial ideals, including applications such as nonlinear polynomial system solving, integer programming and cryptography. Traditional Gröbner Basis algorithms are static, in the sense that they receive a monomial order as input and it is fixed …
-
Solving systems of polynomial equations over binary fields: State-of-the-art algorithms and selected methods.
The literature on the topic of methods for solving polynomial systems over F2 is extensively developed but lacks internal consistency: there are, for example, di erent choices of formulations of the underlying problem, the notion of complexity and of what assumptions about the input system are …
-
Homotopy algorithms for solving structured determinantal systems
Multivariate polynomial systems arising in numerous applications have special structures. In particular, determinantal structures and invariant systems appear in a wide range of applications such as in polynomial optimization and related questions in real algebraic geometry. The goal of this thesis …
-
Computation and Complexity in Algebraic Geometry
In this thesis, we examine systems of polynomial equations and their solutions through the lens of computation and complexity. We explore problems from mathematics, science and engineering, driven by the desire to design efficient algorithms and to uncover structural complexity. After a preliminary …
-
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 …