Strassen’s Matrix Multiplication | GATECSE | DAA
HTML-код
- Опубликовано: 13 фев 2022
- strassen matrix multiplication algorithm || matrix multiplication using divide and conquer || strassens matrix multiplication using divide and conquer || strassens matrix multiplication || strassen's matrix multiplication time complexity || strassen's matrix multiplication algorithm || strassen's matrix multiplication recurrence relation || strassen's algorithm recurrence relation || strassen's matrix multiplication formula
This video explores the efficiency of matrix multiplication using Strassen's Matrix Multiplication algorithm, a groundbreaking technique in linear algebra. The video delves into the intricacies of the algorithm, revealing its step-by-step process for multiplying matrices, reducing required multiplications and enhancing computational speed. It is a game-changer in linear algebra, providing a comprehensive understanding of matrix multiplication.
📊 Key Highlights:
1️⃣ Introduction to Strassen’s Matrix Multiplication
2️⃣ Understanding the Divide and Conquer Strategy
3️⃣ Recursive Formulas for Matrix Multiplication
4️⃣ Analyzing the Time Complexity
5️⃣ Practical Implementation Tips
6️⃣ Comparisons with Traditional Matrix Multiplication
7️⃣ Applications in Real-World Problems
Contact Details (You can follow me at)
Instagram: / thegatehub
LinkedIn: / thegatehub
Twitter: / thegatehub
...................................................................................................................
Email: thegatehub2020@gmail.com
Website: thegatehub.com/
...................................................................................................................
📚 Subject Wise Playlist 📚
▶️Data Structures: tinyurl.com/bwptf6f7
▶️Theory of Computation: tinyurl.com/5bhtzhtd
▶️Compiler Design: tinyurl.com/2p9wtykf
▶️Design and Analysis of Algorithms: tinyurl.com/ywk8uuzc
▶️Graph Theory: tinyurl.com/3e8mynaw
▶️Discrete Mathematics: tinyurl.com/y82r977y
#strassenmatrixmultiplicationalgorithm
#matrixmultiplicationusingdivideandconquer
#strassensmatrixmultiplicationusingdivideandconquer
#strassensmatrixmultiplication
#strassen'smatrixmultiplicationtimecomplexity
#strassen'smatrixmultiplicationalgorithm
#strassen'smatrixmultiplicationrecurrencerelation
#strassen'salgorithmrecurrencerelation
#strassen'smatrixmultiplicationdivideandconquer
#strassen'smatrixmultiplicationformula
Pseudocode for matrix multiplication at 3:27 is wrong, should be a[i,k] * b[k,i], not a[i,k] + b[i,k].
should be a[i,k]*b[k,j] ,anyways
Since when did dino james startes teaching, lol
😂😂😂😂
He is everywhere. From tv ads to rap industry
@@Paynefull848 even in CID 🫣
Bahut hi Acha Samjhaya aapne...
Thank You Sir
quality delivered may god bless you
in algorithm when we are multiplying a11 and b11 what the need to take n/2 in each matrix multiplication ??
Great Explanation
Good explanation ❤
Thankyou sir ❤️
Simple and clearly good explanation
💯💯💯🙏🙏🙏
wow
Nice sir 👍
Thank you sir
good explanation sir tq
Mast sir tq sir
If.. it is 5x5 then.. how we can perform.. devide and conquer..?
pad with zeros
sir please also provide program code
Thanks!
😅
8 🙏
using only the divide and conquer method the recurrence relation comes 8T(n/2) and you said this 8 is for 8 times recursive calls, then how does using strassen's method, recursive call reduces to 7?
Strassens Method is not the same as Divide and Conquer. We do some more manipulations in Divide and Conquer method to further reduce the time complexity. And these further manipulations are Strassens method.
Wah kya samjya hai 😂
Ab iska ratta kaise maaru? 🥲
pta chle to mere ko bhi btana bhy..🙄🙂
12:30
3*3 ka kaise krenge divide
With the help of formula
just waist my 16:33 min
Not worthy
Thanks you sir