Do you know if he'll be doing the full color octet calculations?

你知道他会不会教用矩阵乘法做八色胶子吗？

The most important kind of magical step is laying them out in a matrix and doing what's called matrix multiplication.

最关键的神奇步骤是将它们排列成矩阵，并所谓的矩阵乘法。

I can make matrix multiply go 10 times faster.

我可以将矩阵乘法速度提升十倍。

All these chips have big matrix multiply units.

所有这些芯片都有大型矩阵乘法单元。

It boils down essentially to a pair of matrix multiplications with a simple something in between.

归根结底就是两次矩阵乘法，间夹了一个简单的操作。

So you can get away with a smaller matrix multiply unit.

所以你可以使用一个较小的矩阵乘法单元。

When you do this calculation purely numerically, its matrix vector multiplication.

当你用纯数值的方法计时 它是矩阵向量的乘法。

And then 3.5 as the matrix multiply operator, and now it's like, okay, we gotta use that.

然后3.5作为矩阵乘法符，现在我们得使用它了。

And the reason they made the vocabulary so large is because TPUs like matrix multiply unit is massive.

他们将词汇量设计得如此庞大，原因在于像TPU这样的矩阵乘法单元规模巨大。

So the benchmark has at its core, a matrix multiply, two matrices being multiplied together.

因此，基准测试的核心是矩阵乘法，即两个矩阵相乘。

Unfortunately, matrix multiply is not the way in which we tackle problems today.

遗憾的是，矩阵乘法并非我们如今解决问题的方式。

In particular, I want to show you a way to think about matrix factor multiplication that doesn't rely on memorization.

特别地 我想向你们展示一种不依赖于记忆的矩阵因子乘法的方法。

So matrix multiply has the ability of moving n squared pieces of data and doing n cubed operations on it.

因此，矩阵乘法能够移动n平方个数据片段，并对这些数据n立方的。

Easier to think about rotations performing This matrix multiplication numerically is, once again, pretty similar to the two dimensional case.

更容易考虑旋转执这个矩阵乘法的数值 再一次 和二维情况很相似。

But when you think about matrix multiplication as applying one transformation after another, this property is just trivial.

但是当你把矩阵乘法看作是应用一个又一个变换时 这个性质就很简单了。

Trust me, this will give you a much better conceptual framework that makes the properties of matrix multiplication much easier to understand.

相信我 这将给你一个更好的概念框架 使矩阵乘法的性质更容易理解。

You might notice that this looks a lot like matrix vector multiplication.

你可能注意到这看起来很像矩阵向量乘法。

Once you know that it's linear, you know that there's some way to describe this function as matrix multiplication.

一旦你知道它是线性的 你就知道有一些方法可以用矩阵乘法来描述这个函数。

Applying One transformation after another is captured algebraically with matrix multiplication.

应用一个接一个的变换是用矩阵乘法代数捕获的。

One place where he didn't enough was we missed a matrix multiply operator, like that finally got added to Python, but about 10 years later than it should have.

有一个地方他做得不够， 就是我们错过了矩阵乘法符，这个功能最终被添加到Python，但比应该的时间晚了大约10年。