Hitro množenje matrik

delo diplomskega seminarja

Matej Marinko (Author), Klemen Šivic (Mentor)

Abstract

Množenje matrik je v linearni algebri preprosta operacija, ki se pogosto pojavlja v rešitvah najrazličnejših problemov. Prav zato je bilo v iskanje hitrih algoritmov za množenje matrik vloženega že veliko dela. V diplomskem delu definiramo problem iskanja zgornje meje eksponenta matričnega množenja in razvijemo teorijo ranga in mejnega ranga bilinearnih preslikav. Predstavimo več algoritmov za hitro množenje matrik, ki slonijo na tej teoriji. Izbrane algoritme tudi implementiramo, jih primerjamo med seboj in ocenimo njihovo uporabnost v praksi.

Keywords

množenje matrik;eksponent matričnega množenja;rang tenzorjev;mejni rang;algoritmi;

Data

Language:	Slovenian
Year of publishing:	2020
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FMF - Faculty of Mathematics and Physics
Publisher:	[M. Marinko]
UDC:	004:512
COBISS:	58244355
Views:	847
Downloads:	163
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Fast matrix multiplication
Secondary abstract:	Matrix multiplication is one of the most basic operations in linear algebra and thus very common in various scientific disciplines. Consequently, the computation complexity of matrix multiplication has been extensively studied. In this work, we define a problem of finding the upper bound for the exponent of matrix multiplication and present the theory of rank and border rank of bilinear maps. We describe multiple fast matrix multiplication algorithms based on this theory. In the end, we implement some selected algorithms, compare them, and discuss their value in practical applications.
Secondary keywords:	matrix multiplication;exponent of matrix multiplication;tensor rank;border rank;
Type (COBISS):	Final seminar paper
Study programme:	0
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za matematiko in fiziko, Oddelek za matematiko, Matematika - 1. stopnja
Pages:	51 str.
ID:	12039033