Sökning: "Polynomial basis"
Visar resultat 1 - 5 av 35 avhandlingar innehållade orden Polynomial basis.
1. VLSI aspects on inversion in finite fields
Sammanfattning : 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. LÄS MER
2. Gröbner Basis Methods for Minimal Problems in Computer Vision
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. The Diamond Lemma for Power Series Algebras
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
4. Uncertainty Quantification and Numerical Methods for Conservation Laws
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. Algorithmic Methods in Combinatorial Algebra
Sammanfattning : 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. LÄS MER