The Approximate Bilinear Algorithm of Length 46 for Multiplication of 4 x 4 Matrices
A. V. Smirnov
TL;DR
This paper introduces an approximate bilinear algorithm with length 46 for multiplying 4x4 matrices, reducing computational complexity while maintaining polynomial order 3 and using a specific number of nonzero coefficients.
Contribution
The paper presents a novel approximate bilinear algorithm of length 46 for 4x4 matrix multiplication, improving efficiency with a polynomial order of 3 and a specific coefficient structure.
Findings
Algorithm length is 46 for 4x4 matrix multiplication.
Uses 352 nonzero coefficients out of 2208 total.
Polynomial order of the algorithm is 3.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Tensor decomposition and applications · Complexity and Algorithms in Graphs