Detail aplikovaného výsledku

FMM: Fast Matrix Multiplication

BAŘINA, D.

Originální název

FMM: Fast Matrix Multiplication

Anglický název

FMM: Fast Matrix Multiplication

Druh

Software

Abstrakt

This is a library written in C++98 (actually it is a C++ class). It implements fast algorithm for matrix multiplication. The library implements the Strassen algorithm. The asymptotic complexity of the Strassen algorithm is O(n^2.80735). The naive algorithm has O(n^3). Strassen algorithm is faster for matrices with sizes from 32.

Abstrakt aglicky

This is a library written in C++98 (actually it is a C++ class). It implements fast algorithm for matrix multiplication. The library implements the Strassen algorithm. The asymptotic complexity of the Strassen algorithm is O(n^2.80735). The naive algorithm has O(n^3). Strassen algorithm is faster for matrices with sizes from 32.

Klíčová slova

matrix multiplication, Strassen algorithm

Klíčová slova anglicky

matrix multiplication, Strassen algorithm

Umístění

http://www.fit.vutbr.cz/research/prod/?id=871

Licenční poplatek

K využití výsledku jiným subjektem je vždy nutné nabytí licence

www

http://www.fit.vutbr.cz/research/prod/?id=871

Dokumenty

fmm