Category
page 1Matrix theory
determinant
In mathematics, the determinant is a scalar-valued function of the entries of a square matrix. The determinant of a matrix is commonly denoted , , or . Its value characterizes some properties of the matrix and the linear map represented, on a given basis, by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the corresponding linear map is an isomorphism. However, if the determinant is zero, the matrix is referred to as singular, meaning it does not have an inverse.

eigenvectors and eigenvalues
vectors that map to their scalar multiples, and the associated scalars
trace
sum of the elements of the main diagonal of a square matrix
invertible matrix
square matrix with non-zero determinant
matrix multiplication
mathematical operation in linear algebra
minor
subclass of determinant
Cayley–Hamilton theorem
theorem that a square matrix satisfies its own characteristic equation
Kronecker product
binary operation on matrices
Rouché–Capelli theorem
theorem in linear algebra that a system of linear equations with n variables has solution(s) iff the rk(A) = rk([A|b]), and that if there are solutions, they form an affine space of dimension n−rk(A)
adjugate matrix
for a square matrix, the transpose of the cofactor matrix
singular value decomposition
matrix decomposition
change of basis
change of coordinates for a vector space
Laplace expansion
n×n determinant as sum of n minors weighted by cofactor from row and column not in minor
Jordan normal form
form of a matrix indicating its eigenvalues and their algebraic multiplicities
minimal polynomial
minimal polynomial of a matrix
Sylvester's law of inertia
theorem of matrix algebra of invariance properties under basis transformations
matrix exponential
matrix operation generalizing exponentiation of scalar numbers
matrix decomposition
representation of a matrix as a product
Hadamard product
matrix operation
spectral theorem
theorem
Gershgorin circle theorem
mathematical theorem about eigenvalues
square root of a matrix
mathematical operation
Schur decomposition
matrix decomposition
polar decomposition
representation of invertible matrices as unitaries multiplying a Hermitian operator
companion matrix
matrix with a specific relation to its characteristic polynomial p
Perron–Frobenius theorem
theorem
permanent
polynomial of the elements of a matrix
eigendecomposition of a matrix
matrix decomposition
matrix function
function that maps matrices to matrices
logarithm of a matrix
mathematical operation on invertible matrices
spectrum of a matrix
the set of the matrix's eigenvalues
Moore–Penrose inverse
given a matrix A, the unique matrix B such that ABA = A, BAB = B, and that AB and BA are both Hermitian
Jordan matrix
block diagonal matrix of Jordan blocks
Sylvester's criterion
criterion of positive definiteness of a Hermitian matrix
generalized eigenvector
vector satisfying some of the criteria of an eigenvector
matrix calculus
specialized notation for multivariable calculus
matrix ring
ring of all matrices of fixed size
non-negative matrix factorization
algorithms for matrix decomposition
Cuthill–McKee algorithm
algorithm
Woodbury matrix identity
theorem

unipotent element
In mathematics, a unipotent element r of a ring R is one such that r − 1 is a nilpotent element; in other words, (r − 1)n is zero for some n.
Jacobi's formula
formula for the derivative of the determinant of a matrix
Smith normal form
matrix normal form
P-matrix
In mathematics, a -matrix is a complex square matrix with every principal minor is positive. A closely related class is that of P_0-matrices, which are the closure of the class of -matrices, with every principal minor \geq 0.
totally positive matrix
square matrix such that the determinant of any square submatrix, including the minors, is positive
Golden–Thompson inequality
trace inequality between traces of exponential of symmetric matrices
Lie product formula
formula of matrix exponentials
matrix multiplication algorithm
algorithm to multiply matrices

Frobenius inner product
Binary operation, takes two matrices and returns a scalar

Sherman–Morrison formula
formula computing the inverse of the sum of a matrix with the outer product of two vectors
State-transition matrix
Tool in control theory
Schur–Horn theorem
characterizes the diagonal of a Hermitian matrix with given eigenvalues
Weinstein–Aronszajn identity
For two suitable matrices, A and B, I+AB and I+BA have the same determinate
Freivalds' algorithm
Randomized algorithm for verfiying matrix multiplication
matrix polynomial
a polynomial with square matrices as variables
Khatri-Rao product
type of product of matrices
Immanant of a matrix
In mathematics, the immanant of a matrix was defined by Dudley E. Littlewood and Archibald Read Richardson as a generalisation of the concepts of determinant and permanent.
commuting matrices
sets of matrices whose products do not depend on the order of multiplication