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 25 for “"System of polynomial equations"”.
-
Ideals, varieties, and Groebner bases
… in this project present and interesting picture of close connections between algebra and geometry. Given a specific system of polynomial equations we show how to construct a Groebner basis using Buchbergers Algorithm. Gröbner bases have very nice properties, e.g. they do give a unique remainder …
-
Ideals, varieties, and Groebner bases
… in this project present and interesting picture of close connections between algebra and geometry. Given a specific system of polynomial equations we show how to construct a Groebner basis using Buchbergers Algorithm. Gröbner bases have very nice properties, e.g. they do give a unique remainder …
-
Non-Resonant Uniserial Representations of Vec(R)
… non-resonant bounded uniserial representations of Vec(R) form a certain class of extensions composed of tensor density modules, all of whose subquotients are indecomposable. The problem of classifying the extensions with a given composition series is reduced via cohomological methods to …
-
Multi-Vehicle Function Tracking by Moment Matching
The evolution of many natural and man-made environmental events can be represented as scalar functions of time and space. Examples include the boundary and intensity of wildfires, of waste spills in bodies of water, and of natural emissions of methane from the earth. The difficult task of …
-
On Some Applications of a Generalized Dwork Trace Formula to L-functions associated to Exponential Sums over Galois Rings
… [Dwo60] (Section 2: Lemma 2), and it is one of the main ingredients in his celebrated proof of the rationality of the zeta function of an (affine or projective) algebraic variety over a finite field. In this thesis, we will prove a generalization of Dwork’s trace formula that applies to …
-
Applied Hilbert's Nullstellensatz for Combinatorial Problems
… Combinatorial Optimization can be stated using systems of polynomial equations. Determining the existence of a \textit{stable set} of a given size, finding the \textit{chromatic number} of a graph or more generally, determining the feasibility of an \textit{Integer Programming problem} are …
-
New Results on Triangulation, Polynomial Equation Solving and Their Application in Global Localization
This thesis addresses the problem of global localization from images. The overall goal is to find the location and the direction of a camera given an image taken with the camera relative a 3D world model. In order to solve the problem several subproblems have to be handled. The two main steps for …
-
Realization of minimal two-element-kind one-port networks
A new method of realizing two-element-kind driving-point Impedances is given and illustrated by examples. In this method, networks of any desired topology and having a minimum of elements are utilized. A transformation to normal coordinates forms the basis of the method and, in order to determine …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Computation of Schubert Galois Groups
… groups, which help us understand the solvability of equations and the structure of field extensions. What many do not know is that in the first comprehensive treatise on Galois Theory, Jordan also considered Galois groups in the context of enumerative geometry. Enumerative geometry concerns …
-
Algebraic Input-Output Equations of Four-Bar Kinematic Chains: Planar; Spherical; Spatial
… been investigated for hundreds, if not thousands of years. The extensive research interest stems not only from the wide use in the industry but also from the ability to generate complex kinematic trajectory profiles, one of them being the function generating input-output (IO) equation. This thesis …
-
Algorithms for the Elliptic Curve Discrete Logarithm Problem and the Approximate Common Divisor Problem
Public key cryptosystems such as Diffie-Hellman key exchange and homomorphic encryption over the integers are based on the assumption that the Discrete Logarithm Problem (DLP) and the Approximate Common Divisor (ACD) problem are hard respectively. These computational assumptions can be tested by …
-
Interactions of Algebra, Statistics and Optimization
… constrained optimization from the perspective of maximum likelihood estimation in statistics, and Publication IV looks at the optimization problems with polynomial constraints. In maximum likelihood estimation, one observes a data sample and computes the probability density that maximizes the …
-
Simulation based methods to determine linear equivalent models of power system devices
Small signal stability analysis (linear analysis) of power systems is a very useful component in any power system study. Greater insight into the system can be obtained by it. It also opens the power systems and its controllers to a large body of knowledge on linear systems and controls. It has …
-
An analytic approach to problems connected with plane tree enumeration
Combinatorics involves a wide range of enumeration problems. Many such problems have some characteristics in common. As an example, various structures can be related to a set of plane trees that has eliminated all trees that contain any element of a defined set of forbidden substructures. In …
-
Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems
This thesis presents a number of results and algorithms for the numerical solution of problems in geometric computer vision. In geometric computer vision one tries to extract geometric information about the world and the observer from a sequence of images. Estimation of scene structure and camera …
Page 1 of 2