Computer scientists are a demanding bunch. For them, it’s not enough to get the right answer to a problem — the goal, almost always, is to get the answer as efficiently as possible. Take the act of ...

Computer scientists have discovered a new way to multiply large matrices faster than ever before by eliminating a previously unknown inefficiency, reports Quanta Magazine. This could eventually ...

A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to make improvements. For computer ...

Solving many scientific and technical applications entails the use of matrix multiplies somewhere in the algorithm and thus the computer code. With today’s multicore CPUs, proper use of complier ...

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 ...

This paper develops an algorithm to multiply a p × 2 matrix by a 2 × n matrix in $\lceil(3pn + \max (n, p))/2\rceil$ multiplications without use of commutativity of matrix elements. The algorithm ...

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 ...

Researchers claim to have developed a new way to run AI language models more efficiently by eliminating matrix multiplication from the process. This fundamentally redesigns neural network operations ...