The Approximate Bilinear Algorithm of Length 46 for Multiplication of 4 x 4 Matrices
Numerical Analysis
2014-12-05 v1 Numerical Analysis
Abstract
We propose the arbitrary precision approximate (APA) bilinear algorithm of length 46 for multiplication of 4 x 4 and 4 x 4 matrices. The algorithm has polynomial order 3 and 352 nonzero coefficients from total 2208.
Keywords
Cite
@article{arxiv.1412.1687,
title = {The Approximate Bilinear Algorithm of Length 46 for Multiplication of 4 x 4 Matrices},
author = {A. V. Smirnov},
journal= {arXiv preprint arXiv:1412.1687},
year = {2014}
}
Comments
PDF, 8 pages