Due to the new algebraic methods of algorithm design, recently it became possible to perform multiplication and inversion of N × N matrices using O(N 2,496) rather than O(N 3) arithmetical operations.

A new research paper titled “Discovering faster matrix multiplication algorithms with reinforcement learning” was published by researchers at DeepMind. “Here we report a deep reinforcement learning ...

The most widely used matrix-matrix multiplication routine is GEMM (GEneral Matrix Multiplication) from the BLAS (Basic Linear Algebra Subroutines) library. And these days it can be found being used in ...

Sparse matrix computations are prevalent in many scientific and technical applications. In many simulation applications, the solving of the sparse matrix-vector multiplication (SpMV) is critical for ...

This paper addresses the problem of rectangular matrix multiplication on bidirectional linear systolic arrays (SAs). We analyze all bidirectional linear SAs in terms of efficiency. We conclude that ...

The inspiration for this column comes not from the epic 1999 film The Matrix, as the title may suggest, but from an episode of Sean Carroll’s Mindscape podcast that I listened to over the summer. The ...