ConceptEngineering
Gaussian elimination
An algorithm for solving systems of linear equations through a sequence of row operations.
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.
Linear equation3Matrices3Systems of linear equations3Elementary row operations2Algebraic circuit1Augmented matrix1Linear system1Linear systems of equations1
Opens up
Concepts that name this one as a prerequisite.
LU factorization3Back substitution2Free variable2Augmented matrix for matrix inversion1Block elimination1Cholesky decomposition1Completing the square1Computational complexity of elimination1Eigenvalue 1 and nullspace1Elementary matrix1Gauss-Jordan elimination for matrix inversion1Gaussian elimination in a graph context1
Lecturers
5Each in their own terms, from the easiest level.
Bernhard Boser & Gireeja Ranade
Ryan O'Donnell
A classical linear algebra algorithm that solves systems of linear equations in steps.Erik Demaine & Srini Devadas
An algorithm for solving systems of linear equations by transforming the matrix into row-echelon form.Bernhard Boser
An algorithm used to solve systems of linear equations by transforming an augmented matrix into upper triangular form through systematic row operations.Yael Tauman Kalai & Daniele Micciancio
An algorithm used to solve systems of linear equations, yielding an arbitrary solution.
Lectures that assume it
16The first 12 are shown.
- Matrix Multiplication and Inverse Matrices
- Solving Ax = 0 — Pivot Variables, Free Variables & Rank
- Stream Ciphers and Linear Feedback Shift Registers
- Geometric Problems Continued
- Positive Definite Matrices and Minima
- Factorization into A = LU
- Positive Definite and Semidefinite Matrices
- Elimination with Matrices
- Nondeterministic Parallel Programming
- Introduction to Circuit Elements and KCL/KVL
- Solving the Max-Cut SDP
- Multiplying and Factoring Matrices
Connections
32The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Linear equation
- Elementary row operations
- Algebraic circuit
- LU factorization
- Back substitution
- Free variable
Show 2 moreShow fewer
Lectures24
- Divide & Conquer: FFT
- Gaussian Elimination and Tomographic Imaging
- Simon's Algorithm
- Introduction to Information Devices and Linear Modeling
- Matrix Multiplication and State-Transition Systems
- Linear Independence, Span, and Null Spaces
Show 18 moreShow fewer
- Algebraic Circuit Complexity
- Cryptographic Proofs, Lattices & Hardness Assumptions: A Polylogue
- Matrix Multiplication and Inverse Matrices
- Solving Ax = 0 — Pivot Variables, Free Variables & Rank
- Stream Ciphers and Linear Feedback Shift Registers
- Geometric Problems Continued
- Positive Definite Matrices and Minima
- Factorization into A = LU
- Positive Definite and Semidefinite Matrices
- Elimination with Matrices
- Nondeterministic Parallel Programming
- Introduction to Circuit Elements and KCL/KVL
- Solving the Max-Cut SDP
- Multiplying and Factoring Matrices
- Counting Parameters in SVD, LU, QR, Saddle Points
- Voltage Dividers, Equivalent Resistance, and Touchscreens
- Nodal Analysis and Resistive Networks
- Numerical Linear Algebra Background