Sökning: "polynomial"

Visar resultat 21 - 25 av 331 avhandlingar innehållade ordet polynomial.

  1. 21. Khovanov Homology and Link Cobordisms

    Författare :Magnus Jacobsson; Oleg Viro; Jan-Erik Roos; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; Khovanov homology; Jones polynomial; Link cobordisms; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Sammanfattning : Khovanov homology associates to any link in three-dimensional space a bigraded chain complex of Z[c]-modules, whose graded Euler characteristic (after normalization) is the Jones polynomial of the link. The complex is invariant up to homotopy equivalence under ambient isotopy of the link. LÄS MER

  3. 22. Methods for Optimal Model Fitting and Sensor Calibration

    Författare :Erik Ask; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Model Fitting; Sensor Networks; Computer Vision; Polynomial Equations; Action Matrix Methods;

    Sammanfattning : The problem of fitting models to measured data has been studied extensively, not least in the field of computer vision. A central problem in this field is the difficulty in reliably find corresponding structures and points in different images, resulting in outlier data. LÄS MER

  4. 23. Uncertainty Quantification and Numerical Methods for Conservation Laws

    Författare :Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; uncertainty quantification; polynomial chaos; stochastic Galerkin methods; conservation laws; hyperbolic problems; finite difference methods; finite volume methods; Beräkningsvetenskap med inriktning mot numerisk analys; Scientific Computing with specialization in Numerical Analysis;

    Sammanfattning : Conservation laws with uncertain initial and boundary conditions are approximated using a generalized polynomial chaos expansion approach where the solution is represented as a generalized Fourier series of stochastic basis functions, e.g. orthogonal polynomials or wavelets. LÄS MER

  5. 24. On low order controller synthesis using rational constraints

    Författare :Daniel Ankelhed; Anders Hansson; Anders Helmersson; Anders Forsgren; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; H-infinity synthesis; Linear Matrix Inequalities; rank constraints; polynomial constraints; interior point methods; Automatic control; Reglerteknik;

    Sammanfattning : In order to design robust controllers, H-infinity synthesis is a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. LÄS MER

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