Department of Justice, Russian Federal Center of Forensic Examination, Khokhlovskii pereul. 13-2, Moscow, 109028, Russia
Abstract:
A bilinear algorithm of bilinear complexity 22 for approximate multiplication of $2\times 7$ and $7\times 2$ matrices is presented. An upper bound is given for the bilinear complexity of approximate multiplication of $2\times 2$ and $2\times n$ matrices ($n\geqslant1$).
Key words:matrix multiplication, fast algorithm for multiplying matrices, bilinear algorithm, approximate bilinear algorithm, bilinear complexity, length of algorithm.
Fulltext:
PDF file (173 kB)