The Approximate Bilinear Algorithm of Length 46 for Multiplication of 4 x 4 Matrices
classification
🧮 math.NA
cs.NA
keywords
algorithmapproximatebilinearlengthmatricesmultiplicationarbitrarycoefficients
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.