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 27 for “"Groebner Basis"”.
-
Integer Programming With Groebner Basis
… solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso …
-
Geometric theorem proving using the Groebner basis algorithm
… Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the application of the Groebner Basis Algorithm to geometric problems.
-
Geometric theorem proving using the Groebner basis algorithm
… Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the application of the Groebner Basis Algorithm to geometric problems.
-
An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation
… to Buchberger's original algorithm for Groebner basis computation including the Gebauer-Moeller Criteria, the "Sugar" strategy, and Jean-Charles Faugere's F4 algorithm. Since Faugere's F4 is generally accepted as being a particularly efficient approach to Groebner basis computation, we …
-
Synthesis of the Complete Inverse Kinematic Model of Non-Redundant Open-Chain Robotic Systems using Groebner Basis Theory
… cinemática abierta usando la teoría de Bases de Groebner, el cual no depende de la geometría del robot. Las entradas del procedimiento desarrollado son los parámetros de Denavit-Hartenberg del robot y el rango de movimiento de sus actuadores, mientras que la salida es el IKM sintetizado, listo …
-
A Case Study of A Multithreaded Buchberger Normal Form Algorithm
Groebner bases have many applications in mathematics, science, and engineering. This dissertation deals with the algorithmic aspects of computing these bases. The dissertation begins with a brief introduction of fundamental concepts about Groebner bases. Following this a discussion of various …
-
New Algorithms for Computing Groebner Bases
… thesis, we present new algorithms for computing Groebner bases. The first algorithm, G2V, is incremental in the same fashion as F5 and F5C. At a typical step, one is given a Groebner basis G for an ideal I and any polynomial g, and it is desired to compute a Groebner basis for the new ideal , …
-
Computational Algebraic Geometry Applied to Invariant Theory
… is drawn from a modern standpoint. The Hilbert Basis Theorem and the Nullstellenstatz were considered lemmas for classical invariant theory. The Groebner basis is a modern tool used and is implemented with the computer algebra system Mathematica. Number 14 of Hilbert\'s 23 problems is discussed …
-
Groebner Bases
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson's Lemma, closely following the proof in Cox, Little, and O'Shea's Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. We then provide a …
-
Algorithms and applications of comprehensive Groebner bases.
… to algorithms used to generate comprehensive Groebner bases of Volker Weispfenning (7). Comprehensive Groebner bases are bases for ideals in the ring of polynomials in several variables whose coefficients are polynomials in several symbolic parameters over a given field. These bases have the …
-
Algebraic Methods for Proving Geometric Theorems
… defining equations. The ability to change the basis of an ideal without changing the variety is a powerful tool in determining a variety. In general, the quotient and remainder on division of polynomials in more than one variable are not unique. One property of a Groebner basis is that it …
-
Ideals, varieties, and Groebner bases
… 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 in the division algorithm. We use these bases to solve systems of polynomial quations in several variables and to determine …
-
Ideals, varieties, and Groebner bases
… 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 in the division algorithm. We use these bases to solve systems of polynomial quations in several variables and to determine …
-
Normal forms for coupled Takens-Bogdanov systems
… giving a Stanley decomposition of that module. Groebner basis methods are used to determine the Stanley decomposition of the ring of invariants, that arise in normal forms for systems with nilpotent linear part consisting of repeated 2 x 2 Jordan blocks. Then an efficient algorithm developed by …
-
Essays in Applied and Computational Game Theory
… chapter we introduce the MGBA, the Modular Groebner Basis Approach, which is a solution technique from Algebraic Geometry that can be used to ``triangularize'' polynomial systems. The MGBA is a computational tool that overcomes the typical computational problems of intermediate coefficient …
-
Points and Curves in Affine Space
… a Java program that calculates the reduced Groebner basis for the ideals of these curves.
-
An Algebraic Approach to Reverse Engineering with an Application to Biochemical Networks
… method uses algorithmic tools, including Groebner-basis techniques, to build the set of all discrete models that fit time series data and to select minimal models from this set. The models used in this work are discrete-time finite dynamical systems, which, when defined over a finite …
-
Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems
… (over finite fields) that have infinite reduced Groebner bases, and can be used to generate a public key. We present classes of such ideals and prove that they do not have a finite Groebner basis under any admissible order. We also examine various techniques to realize finite Groebner bases, in …
Page 1 of 2