|
This article is cited in 4 scientific papers (total in 4 papers)
A bilinear algorithm of length $22$ for approximate multiplication of $2\times 7$ and $7\times 2$ matrices
A. V. Smirnov 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.
Received: 16.06.2014 Revised: 26.08.2014
Citation:
A. V. Smirnov, “A bilinear algorithm of length $22$ for approximate multiplication of $2\times 7$ and $7\times 2$ matrices”, Zh. Vychisl. Mat. Mat. Fiz., 55:4 (2015), 550–554; Comput. Math. Math. Phys., 55:4 (2015), 541–545
Linking options:
https://www.mathnet.ru/eng/zvmmf10181 https://www.mathnet.ru/eng/zvmmf/v55/i4/p550
|
|