This is a really interesting article and I&#x27;m glad this is getting attention. It&#x27;s especially refreshing to see a theoretical treatment bridging algorithms with more &quot;modern&quot; hardware implementations.<p>One opportunity I do find in this article is real-world performance tests and determining the importance of constants in performance tuning. Prakop et al. did some really interesting work in 1999 on cache-oblivious algorithms, with applications to kernels such as the FFT and matrix multiplication. The work is theoretically extremely interesting, but in practice, hand-written or machine-generated algorithms continue to dominate. The most famous example of this is probably Kazushige Goto, whose hand-optimized GotoBLAS (now under open source license as OpenBLAS) still provides some of the fastest linear algebra kernels in the world.<p>If you&#x27;re interested in learning more about how the differences between the two approaches shake out in linear algebra, I recommend &quot;Is Cache-Oblivious DGEMM Viable?&quot; by Gunnels et al.