Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Matrix Chain Multiplication
Graph Chatbot
Related lectures (28)
Previous
Page 2 of 3
Next
Matrix Computations: Low Rank Approximation
Explores the complexity of matrix computations, focusing on low rank approximation algorithms and their applications.
Matrix Multiplication and Heaps: Efficient Algorithms
Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication, algorithms, and complexity of matrix multiplication.
Decoupling Zeros: Smith Form
Covers decoupling zeros and the Smith Form algorithm for system poles identification.
Dynamic Programming: Financial Adviser's Prediction
Covers a dynamic programming algorithm for a financial adviser to maximize the probability of impressing her clients.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
Diagonalizability of Matrices
Covers the concept of diagonalizability of matrices and explores eigenvalues and eigenvectors.
Numerical Analysis: Direct Methods for Linear Systems
Covers direct methods for solving linear systems in numerical analysis.
Longest Common Subsequence: Dynamic Programming Algorithm
Explores the Longest Common Subsequence concept and its dynamic programming algorithm, emphasizing optimal substructure and efficient problem-solving.
Recursion Trees and Matrix Multiplication
Covers recursion trees, the maximum subarray problem, and matrix multiplication approaches.
