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 20 of 68 for “"Polynomial Systems"”.
-
Sparse polynomial systems in optimization
Systems of polynomial equations appear both in mathematics, as well as in many applications in the sciences, economics and engineering. Solving these systems is at the heart of computational algebraic geometry, a field which is often associated with symbolic computations based on Gr¨obner bases. …
-
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 …
-
Preconditioning polynomial systems for homotopy continuation
Polynomial systems are ubiquitous in today's scientific world. These systems need to be solved quickly and 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 …
-
Preconditioning polynomial systems using Macaulay dual spaces
Polynomial systems arise in many applications across a diverse landscape of subjects. Solving these systems has been an area of intense research for many years. Methods for solving these systems numerically fit into the field of numerical algebraic geometry. Many of these methods rely on an idea …
-
Applications of monodromy in solving polynomial systems
Polynomial systems of equations that occur in applications frequently have a special structure. Part of that structure can be captured by an associated Galois/monodromy group. This makes numerical homotopy continuation methods that exploit this monodromy action an attractive choice for solving …
-
Homotopy methods for solving deficient polynomial systems
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1990
-
Parameterized Polynomial Systems: Monodromy, Sparse Polynomials, and Solutions
… We show how this result may be applied to sparse polynomial systems, where the restricted monodromy group can be obtained by changing one coefficient parameter. As an application, we complete the proof of the sparse trace test. The sparse trace test verifies that a computed solution set of a …
-
Solving polynomial systems in Cn by polyhedral homotopies
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2000
-
Real root counting for parametric polynomial systems and applications.
Polynomial systems appear in many different fields of study. Many important problems can be reduced to solving systems of polynomial equations and usually the coefficients involve parameters. This thesis is devoted to finding practical ways to solve such problems from two fields, the studies of …
-
Toric Varieties and Numerical Algorithms for Solving Polynomial Systems
This work utilizes toric varieties for solving 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 …
-
Resultants and height bounds for zeros of homogeneous polynomial systems
… bounds for the common zeros of a system of polynomials in terms of the heights of those polynomials. We then use these theorems to give a short proof of a more general (albeit, known) version of Cassels' Theorem and give some weaker results concerning the rational points of a cubic or a pair …
-
Quantitative Aspects of Sums of Squares and Sparse Polynomial Systems
… algebraic geometry is the study of roots of polynomials and polynomial systems. We are familiar with the notion of degree, but there are other ways to consider a polynomial: How many variables does it have? How many terms does it have? Considering the sparsity of a polynomial means we pay …
-
Robust Control for Boiler-Turbine Systems and Control Synthesis for Polynomial Systems
… nonlinear, strongly coupled boiler-turbine systems that are commonly found in the power generation environment is introduced. Following the direct approach, more generalized concepts of controlling polynomial systems, a class of nonlinear systems that is superior to linear systems in its …
-
Algorithms for solving polynomial systems by homotopy continuation method and its parallelization
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2008
-
POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations
… for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked, and in …
-
Finding all isolated roots of polynomial systems in Cn via stable mixed volume
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1999
-
Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis
… contains algorithms for solving linear and polynomial systems of equations over GF(2). The objective is to provide fast and exact tools for algebraic cryptanalysis and other applications. Accordingly, it is divided into two parts. The first part deals with polynomial systems. Chapter 2 …
Page 1 of 4