Eigenvalues — Topic Summaries
AI-powered summaries of 22 videos about Eigenvalues.
22 summaries
Eigenvectors and eigenvalues | Chapter 14, Essence of linear algebra
Eigenvectors are the vectors that stay on their own span under a linear transformation—meaning the transformation only stretches or squishes them,...
Essence of linear algebra preview
Linear algebra often gets taught as a toolbox of computations—matrix multiplication, determinants, eigenvalues—without the geometric meaning that...
A quick trick for computing eigenvalues | Chapter 15, Essence of linear algebra
For 2×2 matrices, eigenvalues can be computed almost instantly by reading two numbers off the matrix—its trace and determinant—then using a...
Linear Algebra 61 | Similar Matrices
Similar matrices are the algebraic way to say two matrices represent the same linear map in different coordinate systems: if there exists an...
Linear Algebra 59 | Adjoint
Adjoint matrices are introduced as the complex-number counterpart to the transpose, and they’re pinned down by how they interact with the inner...
Linear Algebra 54 | Characteristic Polynomial
Eigenvalues can be found by turning a matrix problem into a single-variable polynomial: the characteristic polynomial. For a square matrix A, an...
Linear Algebra 58 | Complex Vectors and Complex Matrices
Complex linear algebra starts by extending vectors and matrices from real entries to complex entries, mainly to make eigenvalue (spectrum) theory...
Linear Algebra 53 | Eigenvalues and Eigenvectors
Eigenvalues and eigenvectors identify the special directions a linear transformation preserves—up to scaling—when a matrix acts on space. For a...
Linear Algebra 55 | Algebraic Multiplicity
Algebraic multiplicity measures how many times a particular eigenvalue shows up as a repeated root of the characteristic polynomial, and that...
Linear Algebra 57 | Spectrum of Triangular Matrices
Eigenvalues of triangular and certain block matrices can be read off directly—often without computing determinants or solving characteristic...
Multivariable Calculus 19 | Examples for Local Extrema
Local extrema in multivariable calculus hinge on two tests: the gradient must vanish at a critical point, and the Hessian matrix must have the right...
Abstract Linear Algebra 46 | Example of Schur Decomposition
Schur decomposition turns any complex square matrix into an upper triangular “Schur normal form” using only unitary similarity transformations. In...
Abstract Linear Algebra 45 | Schur Decomposition
Schur decomposition guarantees that every complex square matrix can be turned—using a unitary change of basis—into an upper triangular matrix. That...
Linear Algebra 53 | Eigenvalues and Eigenvectors [dark version]
Eigenvalues and eigenvectors identify directions that a linear transformation preserves up to scaling—turning a complicated matrix action into a...
Functional Analysis 33 | Spectrum of Compact Operators [dark version]
Compact operators behave like “infinite-dimensional matrices”: they take bounded sets to sets whose closure is compact, and that finiteness-like...
Ordinary Differential Equations 24 | Characteristic Polynomial
For linear, homogeneous, autonomous differential equations of order n, the path to the general solution runs through the characteristic...
Linear Algebra 54 | Characteristic Polynomial [dark version]
Eigenvalues can be found by turning a matrix problem into a single polynomial equation: for a square matrix A, the eigenvalues are exactly the zeros...
Ordinary Differential Equations 23 | Example for Matrix Exponential
A 2×2 homogeneous, autonomous linear system can be solved cleanly by converting it into a matrix exponential—then making that exponential computable...
Linear Algebra 59 | Adjoint [dark version]
Adjoint matrices are the complex-matrix counterpart of transposes, and they’re built to make the inner product work correctly in n. In real vector...
Linear Algebra 55 | Algebraic Multiplicity [dark version]
Algebraic multiplicity measures how many times a given eigenvalue shows up as a repeated root of the characteristic polynomial—so it’s the “counting...
Linear Algebra 65 | Diagonalizable Matrices [dark version]
Diagonalizable matrices are exactly the square matrices that admit a full set of eigenvectors—enough to rebuild every vector in the space—so the...
Abstract Linear Algebra 34 | Eigenvalues and Eigenvectors for Linear Maps
Eigenvectors and eigenvalues for a linear map are defined by a simple “scaling” condition: a nonzero vector X is an eigenvector of L if L(X) lands in...