Invert and diagonalise matrices: finding an inverse by row reduction, the rules inverses obey, symmetric matrices, and diagonalisation of matrices.
No account needed to read a lesson · 30-day money-back guarantee
See the full learning path4
lessons
40
practice questions
52
prerequisite lessons
1 of the 4 lessons here is free to preview - the whole explanation and worked example, with no account and no email.
Live, not a screenshot
Lesson 03 · Symmetric matrices
The blue and red lines show the eigenvector directions of the symmetric matrix
This is the diagram from the lesson itself, running here. Drag it - the lesson is built round the thing it shows, not round a picture of it.
The 4 lessons in this unit. Expand any one to see what it covers. Each unlocks when its own prerequisites are passed.
01
Inverse of a matrix via row reduction
10 questions
Learn how to determine whether a matrix is invertible and, if so, find its inverse using row reduction, connecting these concepts to solving systems of linear equations in machine learning.
Covers
What is the inverse of a matrix?
Finding the inverse of a matrix via row reduction
When does a matrix not have an inverse?
02
Key properties and rules of matrix inverses
9 questions
Learn the core rules for finding inverses of matrix products, transposes, scalar multiples, and diagonal matrices, enabling efficient simplification and manipulation of matrix equations.
Covers
Inverse of a matrix product
Inverse of a transpose and scalar multiple
Inverse of a diagonal matrix
03
Symmetric matrices
9 questions
Understand how symmetric matrices can always be diagonalised using an orthogonal basis of eigenvectors, leading to real eigenvalues and mutually orthogonal principal directions - crucial properties for applications such as principal component analysis and covariance matrices in machine learning.
Covers
What is a symmetric matrix?
Orthogonal eigenvectors of symmetric matrices
Orthogonal diagonalisation of symmetric matrices
04
Diagonalisation of matrices
12 questions
Learn how to determine whether a matrix is diagonalisable by finding its eigenvalues and eigenvectors, construct its diagonalisation if possible, and use this to efficiently compute powers of the matrix.
Covers
What does it mean to diagonalise?
When is a matrix diagonalisable?
How to diagonalise a matrix
Using diagonalisation
This unit is part of our Essential Linear Algebra for ML learning path, which contains 61 lessons. Every one of them is drawn below.
The diagnostic test lets you skip any lesson you already know, including the ones in this unit.
Hover any dot to name its lesson.
4 lessons in this unit
52 prerequisite lessons across the unit, counting every step back to the start
5 other lessons in the learning path - after this unit, or alongside it
One subscription covers every learning path, and you can test out of anything you already know.
One subscription covers every learning path · 30-day money-back guarantee
More in Linear algebra: Vectors in Euclidean space, Matrices, Matrices and linear systems, Eigenvalues, eigenvectors and singular value decomposition