Sökning: "Singular vectors"
Visar resultat 1 - 5 av 10 avhandlingar innehållade orden Singular vectors.
1. Principal Word Vectors
Sammanfattning : Word embedding is a technique for associating the words of a language with real-valued vectors, enabling us to use algebraic methods to reason about their semantic and grammatical properties. This thesis introduces a word embedding method called principal word embedding, which makes use of principal component analysis (PCA) to train a set of word embeddings for words of a language. LÄS MER
2. On Vertex Operator Algebras of Affine Type at Admissible Levels
Sammanfattning : The main purpose of this thesis is the study of the structure and representation theory of simple vertex operator algebras (VOAs) of affine type at admissible levels. To do this, it is crucial to obtain knowledge of the singular vectors which generate the maximal submodules, with respect to which these VOAs appear as irreducible quotients, and therefore a substantial part of the text is devoted to this matter. LÄS MER
3. Singular Value Computations for Toeplitz Matrices and Subspace Tracking
Sammanfattning : This thesis addresses the problem of computing the largest singular values and corresponding singular vectors of a Toeplitz matrix. These are often requested in signal processing and system identification to extract the signal from the noise. LÄS MER
4. Topics on Harmonic analysis and Multilinear Algebra
Sammanfattning : The present thesis consists of six different papers. Indeed, they treat three different research areas: function spaces, singular integrals and multilinear algebra. In paper I, a characterization of continuity of the $p$-$\Lambda$-variation function is given and Helly's selection principle for $\Lambda BV^{(p)}$ functions is established. LÄS MER
5. On Methods for Solving Symmetric Systems of Linear Equations Arising in Optimization
Sammanfattning : In this thesis we present research on mathematical properties of methods for solv- ing symmetric systems of linear equations that arise in various optimization problem formulations and in methods for solving such problems.In the first and third paper (Paper A and Paper C), we consider the connection be- tween the method of conjugate gradients and quasi-Newton methods on strictly convex quadratic optimization problems or equivalently on a symmetric system of linear equa- tions with a positive definite matrix. LÄS MER