Sökning: "matrix algebra"

Visar resultat 1 - 5 av 20 uppsatser innehållade orden matrix algebra.

  1. 1. Examples of G-Hom-Associative Algebras

    Master-uppsats, Mälardalens universitet/Akademin för utbildning, kultur och kommunikation

    Författare :Felicia Modin; [2024]
    Nyckelord :G-hom-associative algebra; hom-associative algebra; hom-Lie admissible algebra;

    Sammanfattning : In this thesis we look at hom-associative algebras (which turn out to be exactly the G1-hom-associative algebras), by, in two and three dimensions, trying to find the structure constants for which an algebra becomes hom-associative when the homomorphism 𝛼 is defined as different matrix units. These algebras are also hom-Lie admissible (or G6-hom-associative, which turn out to be the same thing) with a commutator, so we also find the commutator for each of these hom-Lie admissible algebras. 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. Methods from Linear Algebra for the Enumeration of Spanning Trees

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Nils Forsgren; [2023]
    Nyckelord :Spanning Tree Enumeration;

    Sammanfattning : In this report, we study the enumeration of spanning trees in graphs, using two methods withinlinear algebra, Kirchhoff’s Matrix Tree Theorem and an alternative method, also referred to asLemma 1, derived by S. Klee and M.T Stamps in [KS20]. 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