Applied result detail

FMM: Fast Matrix Multiplication

BAŘINA, D.

Original Title

FMM: Fast Matrix Multiplication

English Title

FMM: Fast Matrix Multiplication

Type

Software

Abstract

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.

Abstract in English

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.

Keywords

matrix multiplication, Strassen algorithm

Key words in English

matrix multiplication, Strassen algorithm

Location

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

Licence fee

In order to use the result by another entity, it is always necessary to acquire a license

www

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

Documents

fmm