Sökning: "low-rank approximation"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden low-rank approximation.

  1. 1. Rank Reduction with Convex Constraints

    Författare :Christian Grussler; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

    Sammanfattning : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. LÄS MER

  2. 2. Numerical Methods for Wave Propagation : Analysis and Applications in Quantum Dynamics

    Författare :Emil Kieri; Sverker Holmgren; Vasile Gradinaru; Hans O. Karlsson; Tobias Jahnke; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; computational wave propagation; quantum dynamics; time-dependent Schrödinger equation; spectral methods; Gaussian beams; splitting methods; low-rank approximation; Scientific Computing; Beräkningsvetenskap;

    Sammanfattning : We study numerical methods for time-dependent partial differential equations describing wave propagation, primarily applied to problems in quantum dynamics governed by the time-dependent Schrödinger equation (TDSE). We consider both methods for spatial approximation and for time stepping. LÄS MER

  3. 3. Algorithms in data mining using matrix and tensor methods

    Författare :Berkant Savas; Lars Eldén; Lieven De Lathauwer; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; Numerical analysis; Numerisk analys;

    Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER

  4. 4. Machine Learning Methods Using Class-specific Subspace Kernel Representations for Large-Scale Applications

    Författare :Yinan Yu; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; class-specific kernels; large-scale framework; subspace model; classification; kernel approximation; RKHS;

    Sammanfattning : Kernel techniques became popular due to and along with the rising success of Support Vector Machines (SVM). During the last two decades, the kernel idea itself has been extracted from SVM and is now widely studied as an independent subject. LÄS MER

  5. 5. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Författare :Andreas Björklund; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; control; Datalogi; numerical analysis; systems; Computer science; Approximation algorithms; Exact algorithms; NP-hard problems; Algorithm theory; kontroll;

    Sammanfattning : In this thesis we present new worst case computational bounds on algorithms for some of the most well-known NP-complete and #P-complete problems and their optimization variants. We consider graph problems like Longest Path, Maximum Cut, Number of Perfect Matchings, Chromatic and Domatic Number, as well as Maximum k-Satisfiability and Set Cover. LÄS MER