Sökning: "gröbner basis"

Visar resultat 1 - 5 av 10 avhandlingar innehållade orden gröbner basis.

  1. 1. Gröbner Basis Methods for Minimal Problems in Computer Vision

    Författare :Henrik Stewenius; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer vision; minimal problems; gröbner basis; Matematik; Teknik; Mathematics; Technological sciences;

    Sammanfattning : A method is presented for building solvers for classes of multivariate polynomial equations. The method is based on solving an analogous template problem over a finite field, and then using the elimination order established for this problem for the original class of problems. LÄS MER

  3. 2. Mathematical Methods for Image Based Localization

    Författare :Klas Josephson; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Multiple View Geometry; Image Based Localization; Computer Vision; Gröbner Basis; Minimal Problems;

    Sammanfattning : The underlying question in localization is, where am I? In this thesis a purely image based approach is proposed to solve this problem. In order to create a complete image based system, there are many subproblems that have to be addressed. The localization problem can also be solved in other ways, for example, with a GPS. LÄS MER

  4. 3. The Diamond Lemma for Power Series Algebras

    Författare :Lars Hellström; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical analysis; diamond lemma; power series algebra; Gröbner basis; embedding into skew fields; archimedean element in semigroup; q-deformed Heisenberg--Weyl algebra; polynomial degree; ring norm; Birkhoff orthogonality; filtered structure; Matematisk analys; Mathematical analysis; Analys; Mathematics; matematik;

    Sammanfattning : The main result in this thesis is the generalisation of Bergman's diamond lemma for ring theory to power series rings. This generalisation makes it possible to treat problems in which there arise infinite descending chains. LÄS MER

  5. 4. Computational algorithms for algebras

    Författare :Samuel Lundqvist; Clas Löfwall; Ralf Fröberg; H. Michael Möller; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hilbert function; Gröbner basis; zero-dimensional ideal; affine variety; projective variety; run-time complexity; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

    Sammanfattning : This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. LÄS MER

  7. 5. Constructive Methods for SAGBI and SAGBI-Gröbner Bases

    Författare :Hans Öfverbeck; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics; elimination; intersection; automata; resultants; noncommutative invariants;

    Sammanfattning : The thesis consists of an introduction and the following four papers: Paper I: Using resultants for SAGBI basis verification in the univariate polynomial ring. Authors: Anna Torstensson, Victor Ufnarovski and Hans Öfverbeck. LÄS MER