Sökning: "polynomial solver"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden polynomial solver.

  1. 1. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks

    Författare :Yubin Kuang; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; polynomial solver; geometric problems; computer vision; sensor networks; symmetry;

    Sammanfattning : Given images of a scene taken by a moving camera or recordings of a moving smart phone playing a song by a microphone array, how hard is it to reconstruct the scene structure or the moving trajectory of the phone? In this thesis, we study and solve several fundamental geometric problems in order to provide solutions to these problems. The key underlying technique for solving such geometric problems is solving systems of polynomial equations. LÄS MER

  2. 2. Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems

    Författare :Martin Byröd; Matematik LTH; []
    Nyckelord :Minimal Problems; Bundle Adjustment; Computer Vision; Polynomial Equations;

    Sammanfattning : 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. LÄS MER

  3. 3. Automated Computational Modeling

    Författare :Johan Jansson; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; multi-adaptivity; Galerkin; ODE; PDE; plasticity; elasticity; FEM; automated;

    Sammanfattning : This thesis is part of the FEniCS project of Automation of Computational Mathematical Modeling (ACMM) as the modern manifestation of the basic principle of science:formulating mathematical equations (modeling) and solving equations (computation). The vision of FEniCS is to set a new standard towards the goals of generality, efficiency, and simplicity, concerning mathematical methodology, implementation, and application. LÄS MER

  4. 4. 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

  5. 5. Spectral/hp Discontinuous Galerkin Methods for Computational Hydraulics

    Författare :Claes Eskilsson; Chalmers University of Technology; []
    Nyckelord :spectral hp elements; surface gravity waves; Boussinesq-type equations; shallow water equations; discontinuous Galerkin method;

    Sammanfattning : We present the concept of spectral/hp element methods, i.e. finite element methods of arbitrarily (high) polynomial order, and apply the methods to computational hydraulics. LÄS MER