Sökning: "linjär algebra"

Visar resultat 1 - 5 av 27 uppsatser innehållade orden linjär algebra.

  1. 1. HasLin - ett DSL för linjär algebra

    Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Adam Eliasson; Daniel Nikoalev; Filip Nordmark; Sebastian Sjögren; Linus Sundkvist; [2023-03-03]
    Nyckelord :Haskell; DSL; Linjär algebra; Agda; pedagogik; bevis;

    Sammanfattning : Matematik är en viktig del av datavetenskap och ett vanligt förekommande ämne på teknikinriktade program på universitet är linjär algebra. Om matematik tolkas inom kontexten av ett domänspecifikt språk kan klyftan mellan matematik och datavetenskap överbryggas. LÄS MER

  3. 2. Randomized Diagonal Estimation

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Niclas Joshua Popp; [2023]
    Nyckelord :Diagonal estimation; randomized numerical linear algebra; low-rank approximation; matrix functions; Diagonalestimering; randomiserad numerisk linjär algebra; lågrankad approximation; matrisfunktioner;

    Sammanfattning : Implicit diagonal estimation is a long-standing problem that is concerned with approximating the diagonal of a matrix that can only be accessed through matrix-vector products. It is of interest in various fields of application, such as network science, material science and machine learning. LÄS MER

  4. 3. Building a Deep Neural Network From Scratch

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Fredrik Sundström; Samppa Raittila; [2023]
    Nyckelord :;

    Sammanfattning : Machine learning is becoming increasingly common in our society and is predictedto have a major impact in the future. Therefore, it would be both interesting and valuable tohave a deep understanding of one of the most used algorithms in machine learning, deepneural network. LÄS MER

  5. 4. Tensor rank and support rank in the context of algebraic complexity theory

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Pelle Andersson; [2023]
    Nyckelord :linear algebra; tensor product; tensor rank; matrix multiplication; complexity; linjär algebra; tensorprodukt; tensorrang; matrismultiplikation; komplexitet;

    Sammanfattning : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. LÄS MER

  7. 5. Perron-Frobenius' Theory and Applications

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Karl Eriksson; [2023]
    Nyckelord :Positive matrices; nonnegative matrices; Perron-Frobenius; linear dynamical systems; Leslie matrices; Markov chain; Google s PageRank algorithm; Positiva matriser; icke-negativa matriser; Perron-Frobenius; linjära dynamiska system; Leslie matris; Markov-kedja; Google s PageRank algoritm;

    Sammanfattning : This is a literature study, in linear algebra, about positive and nonnegative matrices and their special properties. We say that a matrix or a vector is positive/nonnegative if all of its entries are positive/nonnegative. First, we study some generalities and become acquainted with two types of nonnegative matrices; irreducible and reducible. LÄS MER