ConceptEngineering
Matrix inversion
A square matrix P is the inverse of a square matrix Q if multiplying them in either order yields the identity matrix.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Bernhard Boser & Gireeja Ranade
Lectures that assume it
40The first 12 are shown.
- Matrix Multiplication and Inverse Matrices
- Divide & Conquer: FFT
- Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- Surrogate Modeling and Bayesian Optimization
- Diagonalization and Powers of A
- The VC Dimension
- Applications of Least-Squares Estimation: System Identification & Filtering
- Training Neural Networks II
- Regularization
- Control Bootcamp: Laplace Transforms and the Transfer Function
- Linear Algebra: Least Squares and Data Fitting
- Projection Matrices and Least Squares
Connections
51The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Gaussian elimination
- Identity matrix
- Linear equation
- Matrix multiplication
- Block elimination
- Derivative of a matrix inverse
Show 3 moreShow fewer
Lectures42
- Introduction to Circuit Elements and KCL/KVL
- Nodal Analysis and Resistive Networks
- Matrix Multiplication and Inverse Matrices
- Divide & Conquer: FFT
- Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- Surrogate Modeling and Bayesian Optimization
Show 36 moreShow fewer
- Diagonalization and Powers of A
- The VC Dimension
- Applications of Least-Squares Estimation: System Identification & Filtering
- Training Neural Networks II
- Regularization
- Control Bootcamp: Laplace Transforms and the Transfer Function
- Linear Algebra: Least Squares and Data Fitting
- Projection Matrices and Least Squares
- Applications of Singular Value Decomposition in LDS and Electrical Engineering
- Structured Iterative Approximations in Numerical (Multi-)Linear Algebra
- Convex Optimization II: Primal and Dual Decomposition Methods
- Control Bootcamp: Sensitivity and Complementary Sensitivity
- Linear Algebra: Finding the Eigenvalues of a Matrix
- Four Ways to Solve Least Squares Problems
- Matrices A(t) Depending on t, Derivative = dA/dt
- The Geodesic Equation
- Multiplication via the Discrete Fourier Transform
- Fast Fourier Transform (FFT) and Integer Multiplication
- Rapidly Decreasing Singular Values
- Equality Constrained Minimization Continued
- Survey of Difficulties with Ax = b
- Low Rank Changes in A and Its Inverse
- Saddle Points Continued, Maxmin Principle
- Least-Norm Solutions of Underdetermined Equations
- Autonomous Linear Dynamical Systems
- Autonomous Linear Dynamical Systems in Electrical Engineering
- Applications of Jordan Canonical Form in LDS and Electrical Engineering
- Observability and State Estimation
- Tensor Analysis and Notation in General Relativity
- Time Series Analysis II
- Factor Modeling
- Control
- Instantaneous Kinematics, Linear/Angular Velocity & The Jacobian Matrix
- Numerical Linear Algebra Background
- Kinematic Singularity and the Jacobian
- Linear Algebra