Search for dissertations about: "Polynomial basis"

Showing result 1 - 5 of 30 swedish dissertations containing the words Polynomial basis.

  1. 1. VLSI aspects on inversion in finite fields

    Author : Mikael Olofsson; Christof Paar; Linköpings universitet; []
    Keywords : VLSI; Inversion; Finite Fields; Area; Delay; Power dissipation; Irreducible polynomials; Polynomial basis; Triangular basis; Normal basis; Dual basis; Tower fields.; TECHNOLOGY; TEKNIKVETENSKAP;

    Abstract : Different algorithms and architectures for inversion in finite extension fields are studied. The investigation is restricted to fields of characteristic two. Based on a simple transistor model, various architectures are compared with respect to delay, area requirement, and energy consumption. READ MORE

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

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

    Abstract : 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. READ MORE

  3. 3. The Diamond Lemma for Power Series Algebras

    Author : Lars Hellström; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; 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;

    Abstract : 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. READ MORE

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

    Author : Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; Uppsala universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; 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;

    Abstract : 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. READ MORE

  5. 5. Algorithmic Methods in Combinatorial Algebra

    Author : Anna Torstensson; Algebra; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; algebraic geometry; field theory; Number Theory; maximal symmetry group; resultant; SAGBI basis; Orthogonal decomposition; algebra; group theory; Talteori; fältteori; algebraisk geometri; gruppteori;

    Abstract : This thesis consists of a collection of articles all using and/or developing algorithmic methods for the investigation of different algebraic structures. Part A concerns orthogonal decompositions of simple Lie algebras. The main result of this part is that the symplectic Lie algebra C3 has no orthogonal decomposition of so called monomial type. READ MORE