Sökning: "low-rank approximation"

Visar resultat 6 - 10 av 13 avhandlingar innehållade orden low-rank approximation.

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

    Författare :Yinan Yu; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; 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

  3. 7. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Författare :Andreas Björklund; Institutionen för datavetenskap; []
    Nyckelord :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

  4. 8. Numerical methods for Sylvester-type matrix equations and nonlinear eigenvalue problems

    Författare :Emil Ringh; Elias Jarlebring; Johan Karlsson; Per Enqvist; Daniel Kressner; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Matrix equations; Lyapunov equation; Sylvester equation; nonlinear eigenvalue problems; two-parameter eigenvalue problems; Krylov methods; iterative methods; preconditioning; projection methods; Matrisekvationer; Lyapunovekvationen; Sylvesterekvationen; ickelinjära egenvärdesproblem; två-parameters egenvärdesproblem; Krylovmetoder; iterativa metoder; förkonditionering; projektionsmetoder; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics; Optimization and Systems Theory; Optimeringslära och systemteori; Numerical Analysis; Numerisk analys;

    Sammanfattning : Linear matrix equations and nonlinear eigenvalue problems (NEP) appear in a wide variety of applications in science and engineering. Important special cases of the former are the Lyapunov equation, the Sylvester equation, and their respective generalizations. These appear, e.g. LÄS MER

  5. 9. Splitting schemes for nonlinear parabolic problems

    Författare :Tony Stillfjord; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis is based on five papers, which all analyse different aspects of splitting schemes when applied to nonlinear parabolic problems. These numerical methods are frequently used when a problem has a natural decomposition into two or more parts, as the computational cost may then be significantly decreased compared to other methods. LÄS MER

  7. 10. Low-complexity algorithms in digital receivers

    Författare :Ove Edfors; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; Signal Processing;

    Sammanfattning : This thesis addresses low-complexity algorithms in digital receivers. This includes algorithms for estimation, detection, and source coding. LÄS MER