Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Linear Algebra Methods: Vectors, Systems, Matrices and Eigenvalues

Every how-to in linear algebra, gathered from nine hubs: vectors, vector spaces, linear systems, matrices, determinants, eigenvalues, orthogonality, linear transformations, decompositions. Each card opens its page, or its rule card on the hub it belongs to.

Level
I

Vectors

5 pages · 4 rule cards
How to add or subtract vectorsTwo vectors of the same dimension joined by ++ or −-: (3,−1,2)+(1,4,−5)(3, -1, 2) + (1, 4, -5), u−v\mathbf{u} - \mathbf{v}.uses: Component-wise additionAtomicrule card on the hubHow to multiply a vector by a scalarA number in front of a vector: −3(2,−1,4)-3(2, -1, 4), 12v\tfrac{1}{2}\mathbf{v}, 5u5\mathbf{u}.uses: Scalar multiplicationAtomicrule card on the hubHow to find the magnitude of a vectorThe length of a vector is asked for: ∥(2,−3,6)∥\|(2, -3, 6)\|, ∥(3,4)∥\|(3, 4)\|, the distance ∥u−v∥\|\mathbf{u} - \mathbf{v}\|.uses: Euclidean normAtomicrule card on the hubHow to find a unit vector in a given directionA vector of length 11 pointing the same way as v\mathbf{v}: normalize (3,4)(3, 4), the direction of (1,−2,2)(1, -2, 2).uses: NormalizationAtomicrule card on the hubHow to compute the dot productMultiply matching components and add; or use the two lengths and the angle between them.uses: component products · lengths and angleComposite4 steps · 3 examplesHow to find the angle between two vectorsDivide the dot product by the product of the lengths, then take the inverse cosine.uses: dot product · magnitude · inverse cosineComposite4 steps · 3 examplesHow to compute the cross productExpand a 3×3 determinant with i, j, k in the top row; mind the minus sign on the middle term.uses: determinant expansion · right-hand ruleComposite5 steps · 3 examplesHow to project one vector onto anotherScale the target vector by the dot product over its squared length; the rest is perpendicular.uses: dot product · scalar multiplicationComposite5 steps · 3 examplesHow to write a vector as a linear combinationFind the weights c₁, c₂, … by solving one linear equation per component.uses: vector equation · row reductionComposite5 steps · 3 examples
II

Vector spaces

6 pages · 0 rule cards
How to test whether a set is a subspaceCheck the zero vector, closure under addition and closure under scalar multiplication.uses: zero vector · closure under addition · closure under scalingComposite5 steps · 3 examplesHow to test vectors for linear independencePut the vectors in the columns of a matrix and count pivots, or use the determinant.uses: row reduction · pivots · determinantComposite4 steps · 3 examplesHow to test whether a vector is in a spanRow reduce the augmented matrix: consistent means yes. A pivot in every row means the set spans Rⁿ.uses: augmented matrix · consistency · pivots per rowComposite5 steps · 3 examplesHow to find a basisRow reduce once: the pivot columns of the original matrix, or one vector per free variable.uses: row reduction · pivot columns · free variablesComposite5 steps · 3 examplesHow to find the dimension of a subspaceCount the vectors in a basis: the rank for a span, n minus the rank for a solution set.uses: basis · rank · rank–nullityComposite5 steps · 3 examplesHow to find the four fundamental subspacesOne row reduction gives bases for the column space, row space, null space and left null space.uses: RREF · pivot columns · null space · transposeComposite6 steps · 3 examples
III

Linear systems

12 pages · 1 rule cards
How to apply an elementary row operationOne step of row reduction on an augmented matrix: swap two rows, scale a row by a nonzero number, or add a multiple of one row to another: R1↔R2R_1 \leftrightarrow R_2, 12R1→R1\frac{1}{2}R_1 \to R_1, R2−3R1→R2R_2 - 3R_1 \to R_2.uses: Elementary row operationsAtomicrule card on the hubHow to solve a system by Gaussian eliminationReduce the augmented matrix to echelon form, then back-substitute from the bottom row up.uses: elementary row operations · row echelon form · back substitutionComposite5 steps · 3 examplesHow to solve a system by Gauss-Jordan eliminationRow-reduce all the way to reduced form, so each unknown can be read off its own row.uses: elementary row operations · reduced row echelon formComposite4 steps · 3 examplesHow to reduce a matrix to row echelon formBuild the staircase: find each pivot, clear below it, move down and right, zero rows last.uses: elementary row operations · pivotsComposite5 steps · 3 examplesHow to find the reduced row echelon form of a matrixFrom echelon form, scale every pivot to 1 and clear above it; the result is unique.uses: row echelon form · elementary row operationsComposite4 steps · 3 examplesHow to solve a triangular system by back substitutionSolve the last equation first, then substitute upward one row at a time.uses: row echelon form · substitutionComposite4 steps · 3 examplesHow to tell how many solutions a system hasOne, none or infinitely many: reduce, look for a contradictory row, count the pivots.uses: row echelon form · rank · Rouché–Capelli theoremComposite5 steps · 3 examplesHow to solve a homogeneous systemAx = 0 always has the zero solution; reduce A and write the null space with one vector per free variable.uses: reduced row echelon form · free variables · null spaceComposite5 steps · 3 examplesHow to write the general solution in parametric vector formInfinitely many solutions: a particular solution plus one direction vector per free variable.uses: reduced row echelon form · free variables · null spaceComposite5 steps · 3 examplesHow to solve a system with Cramer's ruleA square system with nonzero determinant: each unknown is a ratio of two determinants.uses: determinants · Cramer's ruleComposite5 steps · 3 examplesHow to solve a system with the inverse matrixWrite the system as Ax = b, find the inverse of A, and multiply: x is the inverse times b.uses: matrix inverse · matrix multiplicationComposite5 steps · 3 examplesWhich method should I use to solve a linear system?A decision tree: what the question asks, a zero right-hand side, then the shape of the system.uses: leads to 6 methodsStrategydecision treeHow to solve word problems with linear systemsMixtures, polynomial interpolation, traffic networks and chemical equations: one equation per condition.uses: augmented matrix · Gaussian elimination · free variablesApplied5 setup steps · 4 examples
IV

Matrices

8 pages · 3 rule cards
How to add or subtract matricesTwo matrices of the same size joined by ++ or −-: (1234)+(5−102)\begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} + \begin{pmatrix} 5 & -1 \\ 0 & 2 \end{pmatrix}, or A−BA - B for two 2×32 \times 3 matrices.uses: Entry-by-entry additionAtomicrule card on the hubHow to multiply a matrix by a scalarA number in front of a matrix: 3A3A, −12B-\tfrac{1}{2}B, 1det⁡(A)adj⁡(A)\frac{1}{\det(A)}\operatorname{adj}(A).uses: Scalar multiplicationAtomicrule card on the hubHow to transpose a matrixA matrix with a superscript TT: ATA^T, (AB)T(AB)^T, or a step that turns rows into columns (the adjugate, a symmetry test, ATAA^TA).uses: TransposeAtomicrule card on the hubHow to multiply matricesCheck the inner sizes, then fill each entry with a row of the first times a column of the second.uses: row-times-column rule · dot productComposite5 steps · 3 examplesHow to find the inverse of a 2×2 matrixSwap the diagonal, negate the other two entries, divide by the determinant ad−bcad - bc.uses: 2×2 inverse formula · determinantComposite5 steps · 3 examplesHow to find an inverse by Gauss-Jordan eliminationRow reduce [A∣I][A \mid I] until the left half is II; the right half is then A−1A^{-1}.uses: row operations · reduced row echelon formComposite5 steps · 3 examplesHow to find an inverse with the adjugateCompute every cofactor, transpose them into adj⁡(A)\operatorname{adj}(A), divide by det⁡(A)\det(A).uses: cofactors · adjugate · determinantComposite5 steps · 3 examplesHow to find the rank of a matrixRow reduce to echelon form and count the pivots.uses: row reduction · pivotsComposite4 steps · 3 examplesHow to find the trace of a matrixAdd the diagonal entries; use linearity and tr⁡(AB)=tr⁡(BA)\operatorname{tr}(AB) = \operatorname{tr}(BA) to skip products.uses: diagonal sum · linearity · cyclic propertyComposite4 steps · 3 examplesHow to compute powers of a matrixMultiply the matrix by itself, square repeatedly for high powers, or use a diagonal or repeating pattern.uses: matrix multiplication · repeated squaringComposite5 steps · 3 examplesHow to identify the type of a matrixCheck the shape, the zero pattern, the transpose and a few products to name the type.uses: transpose · matrix products · determinantComposite5 steps · 3 examples
V

Determinants

7 pages · 1 rule cards
How to find a 2×2 determinantA 2×22 \times 2 matrix inside det⁡\det or between vertical bars: det⁡(4325)\det\begin{pmatrix} 4 & 3 \\ 2 & 5 \end{pmatrix}, ∣abcd∣\begin{vmatrix} a & b \\ c & d \end{vmatrix}, or each minor inside a larger expansion.uses: The ad − bc formulaAtomicrule card on the hubHow to find a 3×3 determinant with the rule of SarrusCopy the first two columns, add the three downward diagonal products, subtract the three upward ones.uses: rule of Sarrus · 3×3 determinant formulaComposite5 steps · 3 examplesHow to find a determinant by cofactor expansionExpand along the row or column with the most zeros: entry times sign times minor, added up.uses: minors · cofactors · checkerboard signsComposite4 steps · 3 examplesHow to find a determinant by row reductionReduce to triangular form, multiply the diagonal, and correct for row swaps and scalings.uses: row operations · triangular determinantComposite5 steps · 3 examplesHow to find the determinant of a triangular matrixMultiply the diagonal entries; for block triangular matrices, multiply the block determinants.uses: triangular matrices · block triangular ruleComposite4 steps · 3 examplesHow to use determinant propertiesEvaluate det⁡(2ABTA−1)\det(2AB^TA^{-1}) or the effect of row changes from known determinants, without entries.uses: product rule · scalar rule · transpose and inverse rulesComposite4 steps · 3 examplesHow to find area and volume with determinantsPut edge vectors into a matrix; the absolute value of its determinant is the area or volume.uses: signed area · signed volume · scaling factorComposite4 steps · 3 examplesWhich determinant method should I use?A decision tree: what you are given, whether the matrix is triangular, then its size and zeros.uses: leads to 7 methodsStrategydecision tree
VI

Eigenvalues

8 pages · 0 rule cards
How to find the characteristic polynomialSubtract λ\lambda down the diagonal, take det⁡(A−λI)\det(A - \lambda I) and expand it into a polynomial in λ\lambda.uses: determinant · trace · cofactor expansionComposite4 steps · 3 examplesHow to find eigenvaluesSolve the characteristic equation det⁡(A−λI)=0\det(A - \lambda I) = 0 and check the roots against the trace and determinant.uses: characteristic equation · factoring · trace and determinant checkComposite5 steps · 3 examplesHow to find eigenvectorsFor each eigenvalue, row reduce A−λIA - \lambda I and solve (A−λI)v=0(A - \lambda I)\mathbf{v} = \mathbf{0} for a nonzero v\mathbf{v}.uses: null space · row reduction · check Av = λvComposite5 steps · 3 examplesHow to find a basis for an eigenspaceRow reduce A−λIA - \lambda I, write the null space in parametric form and take one vector per free variable.uses: null space · free variables · rank–nullityComposite5 steps · 3 examplesHow to check if a matrix is diagonalizableCompare algebraic and geometric multiplicity for every eigenvalue; nn distinct eigenvalues settle it at once.uses: eigenvalues · rank of A − λI · multiplicitiesComposite5 steps · 3 examplesHow to diagonalize a matrixPut eigenvectors in the columns of PP and eigenvalues on the diagonal of DD, then check AP=PDAP = PD.uses: eigenvalues · eigenvectors · inverse matrixComposite5 steps · 3 examplesHow to compute matrix powers by diagonalizationWrite A=PDP−1A = PDP^{-1}, raise only the diagonal entries of DD to the power and multiply back.uses: diagonalization · powers of a diagonal matrix · recurrencesComposite4 steps · 3 examplesHow to find complex eigenvalues and eigenvectorsA negative discriminant gives λ=a±bi\lambda = a \pm bi; one complex eigenvector gives the real rotation-scaling form.uses: discriminant · complex arithmetic · real canonical formComposite5 steps · 3 examples
VII

Orthogonality

6 pages · 0 rule cards
How to compute an inner productDot product, weighted and function inner products, and the lengths and angles they give.uses: dot product · norm · angle formulaComposite5 steps · 3 examplesHow to check if a set is orthogonal or orthonormalDot every pair: all zero means orthogonal; unit lengths as well means orthonormal.uses: dot product · norm · Gram matrixComposite4 steps · 3 examplesHow to find an orthogonal projectionProject a vector onto a line, a plane or a subspace; split it into a part inside and a part perpendicular.uses: dot product · orthogonal basis · normal equationsComposite4 steps · 3 examplesHow to apply the Gram-Schmidt processTurn any basis into an orthogonal one: subtract projections one vector at a time, then normalize.uses: projection · dot product · normalizationComposite5 steps · 3 examplesHow to solve a least-squares problemWhen Ax=bA\mathbf{x} = \mathbf{b} has no solution, solve the normal equations for the closest fit.uses: normal equations · projection · QRComposite5 steps · 3 examplesHow to fit a line or curve to dataTurn data points into an overdetermined system, solve the normal equations, read off the best-fit model.uses: least squares · normal equationsApplied5 setup steps · 3 examples
VIII

Linear transformations

5 pages · 0 rule cards
How to check if a transformation is linearTest T(cu+v)=cT(u)+T(v)T(c\mathbf{u} + \mathbf{v}) = cT(\mathbf{u}) + T(\mathbf{v}) with general vectors; one failing example disproves it.uses: one-step test · zero vector test · counterexampleComposite4 steps · 3 examplesHow to find the matrix of a linear transformationApply TT to each standard basis vector and use the results as the columns of AA.uses: standard basis · columns · coordinate vectorsComposite4 steps · 3 examplesHow to find the kernel and image of a linear transformationRow reduce the matrix once: the kernel comes from the free variables, the image from the pivot columns of AA.uses: row reduction · null space · column space · rank–nullityComposite5 steps · 3 examplesHow to change basisCoordinates in a new basis are P−1vP^{-1}\mathbf{v}; the matrix of a map in the new basis is P−1APP^{-1}AP.uses: change-of-basis matrix · inverse · similarityComposite4 steps · 3 examplesHow to find the matrix of a geometric transformationRotations, reflections, projections, shears: track where e1\mathbf{e}_1 and e2\mathbf{e}_2 go, and multiply right to left to combine.uses: standard matrix · rotation and reflection formulas · compositionComposite5 steps · 3 examples
IX

Decompositions

6 pages · 0 rule cards
How to find the LU decompositionRun Gaussian elimination, keep the multipliers in L and the result in U; pivot when a zero appears.uses: Gaussian elimination · multipliers · permutation matrixComposite5 steps · 3 examplesHow to find the QR decompositionRun Gram-Schmidt on the columns: the orthonormal vectors form Q, the coefficients form R.uses: Gram-Schmidt · dot product · normalizationComposite5 steps · 2 examplesHow to find the Cholesky decompositionSymmetric positive definite matrix: build L column by column with square roots so that A=LLTA = LL^T.uses: square roots · symmetric matrix · positive definitenessComposite5 steps · 3 examplesHow to find the spectral decompositionSymmetric matrix: orthonormal eigenvectors and eigenvalues give A=QDQTA = QDQ^T, a sum of projections.uses: eigenvalues · eigenvectors · Gram-SchmidtComposite5 steps · 3 examplesHow to find the singular value decompositionEigenvalues of ATAA^TA give the singular values and VV; then ui=Avi/σi\mathbf{u}_i = A\mathbf{v}_i / \sigma_i gives UU.uses: eigenvalues · spectral decomposition · normalizationComposite5 steps · 3 examplesWhich matrix decomposition should I use?A decision tree: the task and the shape of the matrix pick LU, Cholesky, QR, spectral or SVD.uses: LU · Cholesky · QR · spectral · SVDStrategydecision tree