A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (Q2043999): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-021-00345-x
+Normal rank
@@ Property / OpenAlex ID @@
+W3143939112
@@ Property / OpenAlex ID: W3143939112 / rank @@
+Normal rank
@@ Property / cites work @@
+A new fast recursive matrix multiplication algorithm
+Normal rank
@@ Property / cites work @@
+A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
+Normal rank
@@ Property / cites work @@
+Fast hybrid matrix multiplication algorithms
@@ Property / cites work: Fast hybrid matrix multiplication algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+New fast hybrid matrix multiplication algorithms
@@ Property / cites work: New fast hybrid matrix multiplication algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+On multiplication of 2 \(\times\) 2 matrices
@@ Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Inner Product
@@ Property / cites work: A New Algorithm for Inner Product / rank @@
+Normal rank