Sökning: "Strassen"

Hittade 2 uppsatser innehållade ordet Strassen.

1. 1. 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

3. 2. Algorithms for Large Matrix Multiplications : Assessment of Strassen's Algorithm

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

   Författare :Björn Johansson; Emil Österberg; [2018]
   Nyckelord :Strassen; Matrix multiplication; Precision; Complexity; Strassen; Matrismultiplikation; Precision; Komplexitet;

   Sammanfattning : 1968 var Strassens algoritm en av de stora genombrotten inom matrisanalyser. I denna rapport kommer teorin av Volker Strassens algoritm för matrismultiplikationer tillsammans med teorier om precisioner att presenteras. LÄS MER