Video yükleniyor...

Video Yüklenemedi

Bu video yüklenirken bir sorun oluştu. Bu geçici bir ağ sorunundan kaynaklanıyor olabilir veya video kullanılamıyor olabilir.

Ana Sayfaya Dön

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

62,009 subscribers

37,848 görüntüleme • 2 gün önce •via X (Twitter)

Sanat Eğitim Bilim & Teknoloji

Anya Rossi• Live Now

Private livecam show

3 Yorum

Max Stozek profil fotoğrafı

Max Stozek2 gün önce

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 profil fotoğrafı

G Labs2 gün önce

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 profil fotoğrafı

ESteiner0011 gün önce

Oh DAMMIT, Mr. Wing🫠

Benzer Videolar

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 görüntüleme • 2 yıl önce

One of the most underrated scenes from The Matrix

One of the most underrated scenes from The Matrix

Solana Sensei

65,901 görüntüleme • 5 ay önce

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,537 görüntüleme • 7 ay önce

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 görüntüleme • 9 ay önce

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 görüntüleme • 6 ay önce

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

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

141,930 görüntüleme • 3 ay önce

🚨🇺🇸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 görüntüleme • 1 yıl önce

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

𝚃𝙷𝙺

893,626 görüntüleme • 6 ay önce

Unfortunately no one can be told what the Matrix is, you have to see it for yourself....

Unfortunately no one can be told what the Matrix is, you have to see it for yourself....

SpiritualStreetfighter 17

15,182 görüntüleme • 5 ay önce

Discrete Fourier Transform by hand ✍️ ~ 12 steps walkthrough below Here is a little-known secret about the DFT and the inverse DFT: it is just matrix multiplication in both directions, one the transpose of the other, exactly like the forward pass and backpropagation I drew in other examples. Goal: recover which cosine waves a signal is made of, using nothing but multiplication and addition. = 1. Given = Three signals written as sums of cosines, and a fourth, X, that we do not know yet. = 2. Frequency matrix F = Let us write the coefficients as a matrix. Each signal is a row, each frequency a column, so A = cos(w) + 2cos(2w) becomes [1, 2, 0, 0]. = 3. Sample the waves = We read the four cosine waves at ten discrete time points. That word "discrete" is the whole difference between this and the continuous transform. = 4. Cosine matrix W = Let us write those samples as a matrix: each frequency a row, each time point a column. = 5. Frequency to time = We multiply F by W. That combines the four cosine waves in the proportions F specifies, and the result T is the three signals as they would look in time. = 6. Transpose = Let us stand each signal up as a column. = 7. Time to frequency = We multiply W by that transpose. Every cell is the dot product of one signal with one cosine wave, which measures how much of that wave the signal contains. Zero means none of it. = 8. Scale = Let us multiply by 2/n, with n = 10. The projections come out five times too large, and this is the correction. = 9. Transpose back = We turn it back around, and it is F again, exactly. That is the check: the transform recovered the coefficients we started from. = 10. Now solve for X = Let us run the same multiplication on the one signal whose recipe we never knew. = 11. Scale = We divide by 5 again. = 12. Transpose back = And X reads [0, 0, 3, 2], which says X = 3cos(3w) + 2cos(4w). Note: I originally drew this to show that the DFT is a special case of a convolution layer, its filters fixed to sine and cosine waves rather than learned. No wonder, then, that a convolution layer free to learn its own filters can be trained to process signals. 💾 Save this post!

Discrete Fourier Transform by hand ✍️ ~ 12 steps walkthrough below Here is a little-known secret about the DFT and the inverse DFT: it is just matrix multiplication in both directions, one the transpose of the other, exactly like the forward pass and backpropagation I drew in other examples. Goal: recover which cosine waves a signal is made of, using nothing but multiplication and addition. = 1. Given = Three signals written as sums of cosines, and a fourth, X, that we do not know yet. = 2. Frequency matrix F = Let us write the coefficients as a matrix. Each signal is a row, each frequency a column, so A = cos(w) + 2cos(2w) becomes [1, 2, 0, 0]. = 3. Sample the waves = We read the four cosine waves at ten discrete time points. That word "discrete" is the whole difference between this and the continuous transform. = 4. Cosine matrix W = Let us write those samples as a matrix: each frequency a row, each time point a column. = 5. Frequency to time = We multiply F by W. That combines the four cosine waves in the proportions F specifies, and the result T is the three signals as they would look in time. = 6. Transpose = Let us stand each signal up as a column. = 7. Time to frequency = We multiply W by that transpose. Every cell is the dot product of one signal with one cosine wave, which measures how much of that wave the signal contains. Zero means none of it. = 8. Scale = Let us multiply by 2/n, with n = 10. The projections come out five times too large, and this is the correction. = 9. Transpose back = We turn it back around, and it is F again, exactly. That is the check: the transform recovered the coefficients we started from. = 10. Now solve for X = Let us run the same multiplication on the one signal whose recipe we never knew. = 11. Scale = We divide by 5 again. = 12. Transpose back = And X reads [0, 0, 3, 2], which says X = 3cos(3w) + 2cos(4w). Note: I originally drew this to show that the DFT is a special case of a convolution layer, its filters fixed to sine and cosine waves rather than learned. No wonder, then, that a convolution layer free to learn its own filters can be trained to process signals. 💾 Save this post!

Tom Yeh

25,684 görüntüleme • 1 ay önce

Discrete Fourier Transform by hand ✍️ ~ 12 steps walkthrough below Here is a little-known secret about the DFT and the inverse DFT: it is just matrix multiplication in both directions, one the transpose of the other, exactly like the forward pass and backpropagation I drew in other examples. Goal: recover which cosine waves a signal is made of, using nothing but multiplication and addition. = 1. Given = Three signals written as sums of cosines, and a fourth, X, that we do not know yet. = 2. Frequency matrix F = Let us write the coefficients as a matrix. Each signal is a row, each frequency a column, so A = cos(w) + 2cos(2w) becomes [1, 2, 0, 0]. = 3. Sample the waves = We read the four cosine waves at ten discrete time points. That word "discrete" is the whole difference between this and the continuous transform. = 4. Cosine matrix W = Let us write those samples as a matrix: each frequency a row, each time point a column. = 5. Frequency to time = We multiply F by W. That combines the four cosine waves in the proportions F specifies, and the result T is the three signals as they would look in time. = 6. Transpose = Let us stand each signal up as a column. = 7. Time to frequency = We multiply W by that transpose. Every cell is the dot product of one signal with one cosine wave, which measures how much of that wave the signal contains. Zero means none of it. = 8. Scale = Let us multiply by 2/n, with n = 10. The projections come out five times too large, and this is the correction. = 9. Transpose back = We turn it back around, and it is F again, exactly. That is the check: the transform recovered the coefficients we started from. = 10. Now solve for X = Let us run the same multiplication on the one signal whose recipe we never knew. = 11. Scale = We divide by 5 again. = 12. Transpose back = And X reads [0, 0, 3, 2], which says X = 3cos(3w) + 2cos(4w). Note: I originally drew this to show that the DFT is a special case of a convolution layer, its filters fixed to sine and cosine waves rather than learned. No wonder, then, that a convolution layer free to learn its own filters can be trained to process signals. 💾 Save this post!

Discrete Fourier Transform by hand ✍️ ~ 12 steps walkthrough below Here is a little-known secret about the DFT and the inverse DFT: it is just matrix multiplication in both directions, one the transpose of the other, exactly like the forward pass and backpropagation I drew in other examples. Goal: recover which cosine waves a signal is made of, using nothing but multiplication and addition. = 1. Given = Three signals written as sums of cosines, and a fourth, X, that we do not know yet. = 2. Frequency matrix F = Let us write the coefficients as a matrix. Each signal is a row, each frequency a column, so A = cos(w) + 2cos(2w) becomes [1, 2, 0, 0]. = 3. Sample the waves = We read the four cosine waves at ten discrete time points. That word "discrete" is the whole difference between this and the continuous transform. = 4. Cosine matrix W = Let us write those samples as a matrix: each frequency a row, each time point a column. = 5. Frequency to time = We multiply F by W. That combines the four cosine waves in the proportions F specifies, and the result T is the three signals as they would look in time. = 6. Transpose = Let us stand each signal up as a column. = 7. Time to frequency = We multiply W by that transpose. Every cell is the dot product of one signal with one cosine wave, which measures how much of that wave the signal contains. Zero means none of it. = 8. Scale = Let us multiply by 2/n, with n = 10. The projections come out five times too large, and this is the correction. = 9. Transpose back = We turn it back around, and it is F again, exactly. That is the check: the transform recovered the coefficients we started from. = 10. Now solve for X = Let us run the same multiplication on the one signal whose recipe we never knew. = 11. Scale = We divide by 5 again. = 12. Transpose back = And X reads [0, 0, 3, 2], which says X = 3cos(3w) + 2cos(4w). Note: I originally drew this to show that the DFT is a special case of a convolution layer, its filters fixed to sine and cosine waves rather than learned. No wonder, then, that a convolution layer free to learn its own filters can be trained to process signals. 💾 Save this post!

Tom Yeh

13,435 görüntüleme • 12 gün önce

I wouldn’t DARE skip the Adduction Machine Just hit a lifetime PR on the Matrix version as a matter of fact… Full stack + add ons + gym pin w/ 15lbs And the Matrix one is HEAVY How are you going to skip this exercise and call yourself a man???

I wouldn’t DARE skip the Adduction Machine Just hit a lifetime PR on the Matrix version as a matter of fact… Full stack + add ons + gym pin w/ 15lbs And the Matrix one is HEAVY How are you going to skip this exercise and call yourself a man???

Dean Turner

620,839 görüntüleme • 9 ay önce

K Maru: Master of the Matrix Reality is strange now and he seems to know quite a bit about how it works

K Maru: Master of the Matrix Reality is strange now and he seems to know quite a bit about how it works

Invisidon

20,697 görüntüleme • 6 ay önce

Diastema closure using BRB matrix technique Steps: 1️⃣Take a silicon impression from initial situation 2️⃣ Cut silicone in diastema area creating space for composite 3️⃣ Restore palatal aspects of proximal zones 4️⃣ Use sectional matrix to restore teeth one after one 5️⃣ Finishing and polishing #AboutDent

Diastema closure using BRB matrix technique Steps: 1️⃣Take a silicon impression from initial situation 2️⃣ Cut silicone in diastema area creating space for composite 3️⃣ Restore palatal aspects of proximal zones 4️⃣ Use sectional matrix to restore teeth one after one 5️⃣ Finishing and polishing #AboutDent

عن طب الأسنان | AboutDent

15,206 görüntüleme • 9 ay önce

From the movie the Matrix THE MAN WHO BETRAYED NEO and the REST notice be brings up one number 9 Nines banned from #BEACON FOR a reason

From the movie the Matrix THE MAN WHO BETRAYED NEO and the REST notice be brings up one number 9 Nines banned from #BEACON FOR a reason

Max Prime

67,368 görüntüleme • 2 yıl önce

Deployment is only the first step. You need to learn from it and take the next steps toward positive ROI. Our journey: Step 1. Nine month ago, our robot already assembled a complex real product for our customer, from start to finish. But it wasn’t reliable. Step 2. Our robot performed a complex benchmark task reliably 100 times in a row. Step 3. (Completing) Our robot assembling a complex real product from start to finish 100+ times in a row.

Deployment is only the first step. You need to learn from it and take the next steps toward positive ROI. Our journey: Step 1. Nine month ago, our robot already assembled a complex real product for our customer, from start to finish. But it wasn’t reliable. Step 2. Our robot performed a complex benchmark task reliably 100 times in a row. Step 3. (Completing) Our robot assembling a complex real product from start to finish 100+ times in a row.

Igor Kulakov (MicroFactory)

11,428 görüntüleme • 1 ay önce

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

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

𝚃𝙷𝙺

28,706 görüntüleme • 3 ay önce