正在加载视频...

视频加载失败

加载此视频时出现问题。这可能是由于临时网络问题，或视频可能不可用。

Matrix multiplication seems complex until you observe it step by step. Watch how each of the nine entries is formed: one row from matrix A, one column from matrix B, three products, and one sum.

The Math Flow

89,857 subscribers

44,627 次观看 • 1 个月前 •via X (Twitter)

艺术教育科学技术

Anya Rossi• Live Now

Private livecam show

3 条评论

Max Stozek 的头像

Max Stozek1 个月前

I can understand the meaning of what is a sum, a multiplication, even the different meanings of what is a matrix. I can repeat the process of multiplying one matrix by another, but understanding what this means is still something obscure to me

G Labs 的头像

G Labs1 个月前

Mathematician here. Many wonder what matrix multiplication means, physically. I'm here to explain that. A matrix represents a phenomena that could change a vector. For example, wind conditions that could change a ship's velocity. Matrix multiplication is one matrix acting on another, resulting in a different matrix as an output. It represents one phenomena acting on another, generating a new vector altering phenomena as a result. For example, temperature conditions acting on wind conditions, resulting in different wind conditions. To those interested, see my lecture on Matrix Multiplication:

ESteiner001 的头像

ESteiner0011 个月前

Oh DAMMIT, Mr. Wing🫠

相关视频

8. Opal Principle: The Matrix Step 1 - Create an evil matrix Step 2 - Position your product as the savior One of the best video ads I've seen in a long time.

8. Opal Principle: The Matrix Step 1 - Create an evil matrix Step 2 - Position your product as the savior One of the best video ads I've seen in a long time.

Ad Professor

60,231 次观看 • 2 年前

One of the most underrated scenes from The Matrix

One of the most underrated scenes from The Matrix

Solana Sensei

65,901 次观看 • 6 个月前

Step out of the Matrix!

Step out of the Matrix!

Ted Logan

218,224 次观看 • 3 年前

Tax revolt, sure why not but I think I got one step better How about a health insurance revolt, 2 months of that and the matrix would collapse in on itself. We could start today. pull yourself out of the matrix any way you can, stop feeding the beast.

Tax revolt, sure why not but I think I got one step better How about a health insurance revolt, 2 months of that and the matrix would collapse in on itself. We could start today. pull yourself out of the matrix any way you can, stop feeding the beast.

The Artist known as Jess

67,607 次观看 • 9 个月前

Writing a CUDA kernel requires a shift in mental model. Instead of one fast processor, you manage thousands of tiny threads. Here is the code and the logic explained for Matrix Multiplication.

Writing a CUDA kernel requires a shift in mental model. Instead of one fast processor, you manage thousands of tiny threads. Here is the code and the logic explained for Matrix Multiplication.

Ashutosh Maheshwari

189,260 次观看 • 11 个月前

You start with a plain old complex polynomial p(z) = a₀ + a₁z + … + aₙzⁿ. Instead of fixing the coefficients, you treat them as variables in a controlled experiment and modulate them. Maybe you draw each aₖ from some distribution, or you let them drift along a parameter path. Do that 50,000 times, say, and you no longer have a polynomial. You have an ensemble. For each realization, the goal is the same Find its roots. Instead of attacking p(z)=0 directly with something like fsolve, you rewrite the polynomial as a matrix problem. Specifically, you build its Companion Matrix. For a monic polynomial zⁿ + bₙ₋₁zⁿ⁻¹ + … + b₀ the companion matrix is an n×n matrix whose last column contains the coefficients (with minus signs), and whose subdiagonal is filled with ones. Everything else is zero. It’s sparse, structured and deterministic. The theorem that makes this worth doing is simple and beautiful The eigenvalues of the companion matrix are exactly the roots of the polynomial. So each polynomial sample becomes a matrix. Each matrix becomes an eigenvalue problem. And eigenvalues are something numerical linear algebra is very, very good at computing.

You start with a plain old complex polynomial p(z) = a₀ + a₁z + … + aₙzⁿ. Instead of fixing the coefficients, you treat them as variables in a controlled experiment and modulate them. Maybe you draw each aₖ from some distribution, or you let them drift along a parameter path. Do that 50,000 times, say, and you no longer have a polynomial. You have an ensemble. For each realization, the goal is the same Find its roots. Instead of attacking p(z)=0 directly with something like fsolve, you rewrite the polynomial as a matrix problem. Specifically, you build its Companion Matrix. For a monic polynomial zⁿ + bₙ₋₁zⁿ⁻¹ + … + b₀ the companion matrix is an n×n matrix whose last column contains the coefficients (with minus signs), and whose subdiagonal is filled with ones. Everything else is zero. It’s sparse, structured and deterministic. The theorem that makes this worth doing is simple and beautiful The eigenvalues of the companion matrix are exactly the roots of the polynomial. So each polynomial sample becomes a matrix. Each matrix becomes an eigenvalue problem. And eigenvalues are something numerical linear algebra is very, very good at computing.

Mathelirium

15,566 次观看 • 8 个月前

Matrix Multiplication

Matrix Multiplication

Python Programming

13,395 次观看 • 4 个月前

all it takes is one trade. escape the matrix. LOCK IN.

all it takes is one trade. escape the matrix. LOCK IN.

spuno

81,732 次观看 • 2 年前

This is a great lecture at MIT by David Shirokoff on Markov Chains. He covers the fundamentals of Markov Chains using a simple particle movement example. He starts by explaining how a particle moves between two positions, A & B, with different probabilities. From there, the talk converts the problem into matrix form using a Markov matrix. The main topics covered are: - Transition probabilities - Markov matrices - Probability vectors - Matrix multiplication in Markov Chains - Finding probabilities after n steps - Eigenvalues and eigenvectors - Matrix diagonalization - Long-term steady state distribution

This is a great lecture at MIT by David Shirokoff on Markov Chains. He covers the fundamentals of Markov Chains using a simple particle movement example. He starts by explaining how a particle moves between two positions, A & B, with different probabilities. From there, the talk converts the problem into matrix form using a Markov matrix. The main topics covered are: - Transition probabilities - Markov matrices - Probability vectors - Matrix multiplication in Markov Chains - Finding probabilities after n steps - Eigenvalues and eigenvectors - Matrix diagonalization - Long-term steady state distribution

𝗿𝗮𝗺𝗮𝗸𝗿𝘂𝘀𝗵𝗻𝗮— 𝗲/𝗮𝗰𝗰

142,204 次观看 • 5 个月前

Visualization of cache-optimized matrix multiplication

Visualization of cache-optimized matrix multiplication

ℏεsam

214,622 次观看 • 1 年前

Visualization of cache-optimized matrix multiplication

Visualization of cache-optimized matrix multiplication

ℏεsam

99,369 次观看 • 1 年前

🚨🇺🇸ELON: WE’RE REPROGRAMMING THE MATRIX "We’re reprogramming the matrix. Success was never one of the possible outcomes—it was a Kobayashi Maru situation. If you're in the matrix, success was never possible. The only way to achieve success is to reprogram the matrix so that success becomes one of the possible outcomes. That’s what we’re doing." Source: The Joe Rogan Experience, February 28, 2025

🚨🇺🇸ELON: WE’RE REPROGRAMMING THE MATRIX "We’re reprogramming the matrix. Success was never one of the possible outcomes—it was a Kobayashi Maru situation. If you're in the matrix, success was never possible. The only way to achieve success is to reprogram the matrix so that success becomes one of the possible outcomes. That’s what we’re doing." Source: The Joe Rogan Experience, February 28, 2025

Mario Nawfal

684,949 次观看 • 1 年前

BEYONCÉ = THE ONE = NEO TELEPHONES AND THE MATRIX:

BEYONCÉ = THE ONE = NEO TELEPHONES AND THE MATRIX:

Lore Breakers

230,938 次观看 • 8 个月前

Matrix Multiplication:👇

Matrix Multiplication:👇

The Math Flow

38,776 次观看 • 7 个月前

ELON MUSK: “We're reprogramming the matrix. Success was never one of the possible outcomes. If you're in the matrix, success was never possible. The only way to achieve success is to reprogram the matrix such that success is one of the possible outcomes. That's what we're doing”

ELON MUSK: “We're reprogramming the matrix. Success was never one of the possible outcomes. If you're in the matrix, success was never possible. The only way to achieve success is to reprogram the matrix such that success is one of the possible outcomes. That's what we're doing”

DogeDesigner

186,991 次观看 • 1 个月前

Visualizing 3x3 Matrix Multiplication.

Visualizing 3x3 Matrix Multiplication.

The Math Flow

36,124 次观看 • 8 个月前

A deleted scene from Scary Movie 3 where Cindy enters the matrix to battle hundreds of Samara’s and realize she’s the one

A deleted scene from Scary Movie 3 where Cindy enters the matrix to battle hundreds of Samara’s and realize she’s the one

𝚃𝙷𝙺

894,490 次观看 • 7 个月前

If they didn't need public consent, they wouldn't spend so much time and money shoving propaganda down your throat. Unplug from the matrix Fox news is the matrix The NFL is the matrix Dan Bongino is the matrix Fuck the matrix Good luck to you all America first Long Live The Republic

If they didn't need public consent, they wouldn't spend so much time and money shoving propaganda down your throat. Unplug from the matrix Fox news is the matrix The NFL is the matrix Dan Bongino is the matrix Fuck the matrix Good luck to you all America first Long Live The Republic

The Artist known as Jess

59,489 次观看 • 8 个月前