
This article lists some important classes ofmatrices used inmathematics,science andengineering. Amatrix (plural matrices, or less commonly matrixes) is a rectangulararray ofnumbers calledentries. Matrices have a long history of both study and application, leading to diverse ways of classifying matrices. A first group is matrices satisfying concrete conditions of the entries, including constant matrices. Important examples include theidentity matrix given by
and thezero matrix of dimension. For example:
Further ways of classifying matrices are according to theireigenvalues, or by imposing conditions on theproduct of the matrix with other matrices. Finally, many domains, both in mathematics and other sciences includingphysics andchemistry, have particular matrices that are applied chiefly in these areas.
The list below comprises matrices whose elements are constant for any given dimension (size) of matrix. The matrix entries will be denotedaij. The table below uses theKronecker delta δij for two integersi andj which is 1 ifi =j and 0 else.
| Name | Explanation | Symbolic description of the entries | Notes |
|---|---|---|---|
| Commutation matrix | The matrix of thelinear map that maps a matrix to its transpose | SeeVectorization | |
| Duplication matrix | The matrix of the linear map mapping the vector of the distinct entries of asymmetric matrix to the vector of all entries of the matrix | SeeVectorization | |
| Elimination matrix | The matrix of the linear map mapping the vector of the entries of a matrix to the vector of a part of the entries (for example the vector of the entries that are not below the main diagonal) | Seevectorization | |
| Exchange matrix | Thebinary matrix with ones on the anti-diagonal, and zeroes everywhere else. | aij = δn+1−i,j | Apermutation matrix. |
| Hilbert matrix | A structured grid of rational values formed by the sum of polynominal denominators, modulated symmetrically and positively as approximation behavior | aij = (i + j − 1)−1. | AHankel matrix. |
| Identity matrix | A square diagonal matrix, with all entries on the main diagonal equal to 1, and the rest 0. | aij = δij | |
| Lehmer matrix | aij = min(i,j) ÷ max(i,j). | Apositivesymmetric matrix. | |
| Matrix of ones | A matrix with all entries equal to one. | aij = 1. | |
| Pascal matrix | A matrix containing the entries ofPascal's triangle. | ||
| Pauli matrices | A set of three 2 × 2 complex Hermitian and unitary matrices. When combined with theI2 identity matrix, they form an orthogonal basis for the 2 × 2 complex Hermitian matrices. | ||
| Redheffer matrix | Encodes aDirichlet convolution. Matrix entries are given by thedivisor function; entries of the inverse are given by theMöbius function. | aij are 1 ifi dividesj or ifj = 1; otherwise,aij = 0. | A (0, 1)-matrix. |
| Shift matrix | A matrix with ones on the superdiagonal or subdiagonal and zeroes elsewhere. | aij = δi+1,j oraij = δi−1,j | Multiplication by it shifts matrix elements by one position. |
| Zero matrix | A matrix with all entries equal to zero. | aij = 0. |
The following lists matrices whose entries are subject to certain conditions. Many of them apply tosquare matrices only, that is matrices with the same number of columns and rows. Themain diagonal of a square matrix is thediagonal joining the upper left corner and the lower right one or equivalently the entriesai,i. The other diagonal is called anti-diagonal (or counter-diagonal).
| Name | Explanation | Notes, references |
|---|---|---|
| (0,1)-matrix | A matrix with all elements either 0 or 1. | Synonym forbinary matrix orlogical matrix. |
| Alternant matrix | A matrix in which successive columns have a particular function applied to their entries. | |
| Alternating sign matrix | A square matrix with entries 0, 1 and −1 such that the sum of each row and column is 1 and the nonzero entries in each row and column alternate in sign. | |
| Anti-diagonal matrix | A square matrix with all entries off the anti-diagonal equal to zero. | |
| Anti-Hermitian matrix | Synonym forskew-Hermitian matrix. | |
| Anti-symmetric matrix | Synonym forskew-symmetric matrix. | |
| Arrowhead matrix | A square matrix containing zeros in all entries except for the first row, first column, and main diagonal. | |
| Band matrix | A square matrix whose non-zero entries are confined to a diagonalband. | |
| Bidiagonal matrix | A matrix with elements only on the main diagonal and either the superdiagonal or subdiagonal. | Sometimes defined differently, see article. |
| Binary matrix | A matrix whose entries are all either 0 or 1. | Synonym for(0,1)-matrix orlogical matrix.[1] |
| Bisymmetric matrix | A square matrix that is symmetric with respect to its main diagonal and its main cross-diagonal. | |
| Block-diagonal matrix | Ablock matrix with entries only on the diagonal. | |
| Block matrix | A matrix partitioned in sub-matrices called blocks. | |
| Block tridiagonal matrix | A block matrix which is essentially a tridiagonal matrix but with submatrices in place of scalar elements. | |
| Boolean matrix | A matrix whose entries are taken from aBoolean algebra. | |
| Cauchy matrix | A matrix whose elements are of the form 1/(xi +yj) for (xi), (yj) injective sequences (i.e., taking every value only once). | |
| Centrosymmetric matrix | A matrix symmetric about its center; i.e.,aij = an−i+1,n−j+1. | |
| Circulant matrix | A matrix where each row is a circular shift of its predecessor. | |
| Conference matrix | A square matrix with zero diagonal and +1 and −1 off the diagonal, such that CTC is a multiple of the identity matrix. | |
| Complex Hadamard matrix | A matrix with all rows and columns mutually orthogonal, whose entries are unimodular. | |
| Compound matrix | A matrix whose entries are generated by the determinants of all minors of a matrix. | |
| Copositive matrix | A square matrixA with real coefficients, such that is nonnegative for every nonnegative vectorx | |
| Diagonally dominant matrix | A matrix whose entries satisfy. | |
| Diagonal matrix | A square matrix with all entries outside themain diagonal equal to zero. | |
| Discrete Fourier-transform matrix | Multiplying by a vector gives the DFT of the vector as result. | |
| Elementary matrix | A square matrix derived by applying an elementary row operation to the identity matrix. | |
| Equivalent matrix | A matrix that can be derived from another matrix through a sequence of elementary row or column operations. | |
| Frobenius matrix | A square matrix in the form of an identity matrix but with arbitrary entries in one column below the main diagonal. | |
| GCD matrix | The matrix having the greatest common divisor as its entry, where. | |
| Generalized permutation matrix | A square matrix with precisely one nonzero element in each row and column. | |
| Hadamard matrix | A square matrix with entries +1, −1 whose rows are mutually orthogonal. | |
| Hankel matrix | A matrix with constant skew-diagonals; also an upside down Toeplitz matrix. | A square Hankel matrix is symmetric. |
| Hermitian matrix | A square matrix which is equal to itsconjugate transpose,A =A*. | |
| Hessenberg matrix | An "almost" triangular matrix, for example, an upper Hessenberg matrix has zero entries below the first subdiagonal. | |
| Hollow matrix | A square matrix whose main diagonal comprises only zero elements. | |
| Integer matrix | A matrix whose entries are all integers. | |
| Logical matrix | A matrix with all entries either 0 or 1. | Synonym for(0,1)-matrix,binary matrix orBoolean matrix. Can be used to represent ak-adicrelation. |
| Markov matrix | A matrix of non-negative real numbers, such that the entries in each row sum to 1. | |
| Metzler matrix | A matrix whose off-diagonal entries are non-negative. | |
| Monomial matrix | A square matrix with exactly one non-zero entry in each row and column. | Synonym forgeneralized permutation matrix. |
| Moore matrix | A row consists ofa,aq,aq², etc., and each row uses a different variable. | |
| Nonnegative matrix | A matrix with all nonnegative entries. | |
| Null-symmetric matrix | A square matrix whose null space (orkernel) is equal to itstranspose, N(A) = N(AT) or ker(A) = ker(AT). | Synonym for kernel-symmetric matrices. Examples include (but not limited to) symmetric, skew-symmetric, and normal matrices. |
| Null-Hermitian matrix | A square matrix whose null space (orkernel) is equal to itsconjugate transpose, N(A)=N(A*) or ker(A)=ker(A*). | Synonym for kernel-Hermitian matrices. Examples include (but not limited) to Hermitian, skew-Hermitian matrices, and normal matrices. |
| Partitioned matrix | A matrix partitioned into sub-matrices, or equivalently, a matrix whose entries are themselves matrices rather than scalars. | Synonym forblock matrix. |
| Parisi matrix | A block-hierarchical matrix. It consist of growing blocks placed along the diagonal, each block is itself a Parisi matrix of a smaller size. | In theory of spin-glasses is also known as a replica matrix. |
| Pentadiagonal matrix | A matrix with the only nonzero entries on the main diagonal and the two diagonals just above and below the main one. | |
| Permutation matrix | A matrix representation of apermutation, a square matrix with exactly one 1 in each row and column, and all other elements 0. | |
| Persymmetric matrix | A matrix that is symmetric about its northeast–southwest diagonal, i.e.,aij = an−j+1,n−i+1. | |
| Polynomial matrix | A matrix whose entries arepolynomials. | |
| Positive matrix | A matrix with all positive entries. | |
| Quaternionic matrix | A matrix whose entries arequaternions. | |
| Random matrix | A matrix whose entries arerandom variables | |
| Sign matrix | A matrix whose entries are either +1, 0, or −1. | |
| Signature matrix | A diagonal matrix where the diagonal elements are either +1 or −1. | |
| Single-entry matrix | A matrix where a single element is one and the rest of the elements are zero. | |
| Skew-Hermitian matrix | A square matrix which is equal to the negative of itsconjugate transpose,A* = −A. | |
| Skew-symmetric matrix | A matrix which is equal to the negative of itstranspose,AT = −A. | |
| Skyline matrix | A rearrangement of the entries of a banded matrix which requires less space. | |
| Sparse matrix | A matrix with relatively few non-zero elements. | Sparse matrix algorithms can tackle huge sparse matrices that are utterly impractical for dense matrix algorithms. |
| Symmetric matrix | A square matrix which is equal to itstranspose,A =AT (ai,j =aj,i). | |
| Toeplitz matrix | A matrix with constant diagonals. | |
| Totally positive matrix | A matrix withdeterminants of all its square submatrices positive. | |
| Triangular matrix | A matrix with all entries above the main diagonal equal to zero (lower triangular) or with all entries below the main diagonal equal to zero (upper triangular). | |
| Tridiagonal matrix | A matrix with the only nonzero entries on the main diagonal and the diagonals just above and below the main one. | |
| X–Y–Z matrix | A generalization to three dimensions of the concept oftwo-dimensional array | |
| Vandermonde matrix | A row consists of 1,a,a2,a3, etc., and each row uses a different variable. | |
| Walsh matrix | A square matrix, with dimensions a power of 2, the entries of which are +1 or −1, and the property that the dot product of any two distinct rows (or columns) is zero. | |
| Z-matrix | A matrix with all off-diagonal entries less than zero. |
A number of matrix-related notions is about properties of products or inverses of the given matrix. Thematrix product of am-by-n matrixA and an-by-k matrixB is them-by-k matrixC given by
This matrix product is denotedAB. Unlike the product of numbers, matrix products are notcommutative, that is to sayAB need not be equal toBA.[2] A number of notions are concerned with the failure of this commutativity. Aninverse of square matrixA is a matrixB (necessarily of the same dimension asA) such thatAB =I. Equivalently,BA =I. An inverse need not exist. If it exists,B is uniquely determined, and is also calledthe inverse ofA, denotedA−1.
| Name | Explanation | Notes |
|---|---|---|
| Circular matrix orConinvolutory matrix | A matrix whose inverse is equal to its entrywise complex conjugate:A−1 =A. | Compare with unitary matrices. |
| Congruent matrix | Two matricesA andB are congruent if there exists an invertible matrixP such thatPTAP =B. | Compare with similar matrices. |
| EP matrix or Range-Hermitian matrix | A square matrix that commutes with itsMoore–Penrose inverse:AA+ =A+A. | |
| Idempotent matrix or Projection Matrix | A matrix that has the propertyA² =AA =A. | The name projection matrix inspires from the observation of projection of a point multiple times onto a subspace(plane or a line) giving the same result asone projection. |
| Invertible matrix | A square matrix having a multiplicativeinverse, that is, a matrixB such thatAB =BA =I. | Invertible matrices form thegeneral linear group. |
| Involutory matrix | A square matrix which is its own inverse, i.e.,AA =I. | Signature matrices,Householder matrices (Also known as 'reflection matrices' to reflect a point about a plane or line) have this property. |
| Isometric matrix | A matrix that preserves distances, i.e., a matrix that satisfiesA*A =I whereA* denotes theconjugate transpose ofA. | |
| Nilpotent matrix | A square matrix satisfyingAq = 0 for some positive integerq. | Equivalently, the only eigenvalue ofA is 0. |
| Normal matrix | A square matrix that commutes with itsconjugate transpose:AA∗ =A∗A | They are the matrices to which thespectral theorem applies. |
| Orthogonal matrix | A matrix whose inverse is equal to itstranspose,A−1 =AT. | They form theorthogonal group. |
| Orthonormal matrix | A matrix whose columns areorthonormal vectors. | |
| Partially Isometric matrix | A matrix that is anisometry on theorthogonal complement of itskernel. Equivalently, a matrix that satisfiesAA*A =A. | Equivalently, a matrix withsingular values that are either 0 or 1. |
| Singular matrix | A square matrix that is not invertible. | |
| Unimodular matrix | An invertible matrix with entries in the integers (integer matrix) | Necessarily the determinant is +1 or −1. |
| Unipotent matrix | A square matrix with all eigenvalues equal to 1. | Equivalently,A −I is nilpotent. See alsounipotent group. |
| Unitary matrix | A square matrix whose inverse is equal to itsconjugate transpose,A−1 =A*. | |
| Totally unimodular matrix | A matrix for which every non-singular square submatrix isunimodular. This has some implications in thelinear programmingrelaxation of aninteger program. | |
| Weighing matrix | A square matrix the entries of which are in{0, 1, −1}, such thatAAT =wI for some positive integerw. |
| Name | Explanation | Notes |
|---|---|---|
| Convergent matrix | A square matrix whose successive powers approach thezero matrix. | Itseigenvalues have magnitude less than one. |
| Defective matrix | A square matrix that does not have a complete basis ofeigenvectors, and is thus notdiagonalizable. | |
| Derogatory matrix | A square matrix whoseminimal polynomial is of order less thann. Equivalently, at least one of its eigenvalues has at least twoJordan blocks.[3] | |
| Diagonalizable matrix | A square matrixsimilar to a diagonal matrix. | It has aneigenbasis, that is, a complete set oflinearly independent eigenvectors. |
| Hurwitz matrix | A matrix whose eigenvalues have strictly negative real part. A stable system of differential equations may be represented by a Hurwitz matrix. | |
| M-matrix | A Z-matrix with eigenvalues whose real parts are nonnegative. | |
| Positive-definite matrix | A Hermitian matrix with every eigenvalue positive. | |
| Stability matrix | Synonym forHurwitz matrix. | |
| Stieltjes matrix | A real symmetric positive definite matrix with nonpositive off-diagonal entries. | Special case of anM-matrix. |
| Name | Definition | Comments |
|---|---|---|
| Adjugate matrix | Transpose of thecofactor matrix | Theinverse of a matrix is its adjugate matrix divided by itsdeterminant |
| Augmented matrix | Matrix whose rows are concatenations of the rows of two smaller matrices | Used for performing the samerow operations on two matrices |
| Bézout matrix | Square matrix whosedeterminant is theresultant of two polynomials | See alsoSylvester matrix |
| Jabotinsky matrix | Infinite matrix of theTaylor coefficients of ananalytic function and its integer powers | The composition of two functions can be expressed as the product of their Jabotinsky matrices |
| Cartan matrix | A matrix associated with either a finite-dimensionalassociative algebra, or asemisimple Lie algebra | |
| Cofactor matrix | Formed by thecofactors of a square matrix, that is, the signedminors, of the matrix | Transpose of theAdjugate matrix |
| Companion matrix | A matrix having the coefficients of a polynomial as last column, and having the polynomial as itscharacteristic polynomial | |
| Coxeter matrix | A matrix which describes the relations between theinvolutions that generate aCoxeter group | |
| Distance matrix | The square matrix formed by the pairwise distances of a set ofpoints | Euclidean distance matrix is a special case |
| Euclidean distance matrix | A matrix that describes the pairwise distances betweenpoints inEuclidean space | See alsodistance matrix |
| Fundamental matrix | The matrix formed from the fundamental solutions of asystem of linear differential equations | |
| Generator matrix | InCoding theory, a matrix whose rowsspan alinear code | |
| Gramian matrix | The symmetric matrix of the pairwiseinner products of a set of vectors in aninner product space | |
| Hessian matrix | The square matrix ofsecond partial derivatives of afunction of several variables | |
| Householder matrix | The matrix of areflection with respect to ahyperplane passing through the origin | |
| Jacobian matrix | The matrix of the partial derivatives of afunction of several variables | |
| Moment matrix | Used instatistics andSum-of-squares optimization | |
| Payoff matrix | A matrix ingame theory andeconomics, that represents the payoffs in anormal form game where players move simultaneously | |
| Pick matrix | A matrix that occurs in the study of analytical interpolation problems | |
| Rotation matrix | A matrix representing arotation | |
| Seifert matrix | A matrix inknot theory, primarily for the algebraic analysis of topological properties of knots and links. | Alexander polynomial |
| Shear matrix | The matrix of ashear transformation | |
| Similarity matrix | A matrix of scores which express the similarity between two data points | Sequence alignment |
| Sylvester matrix | A square matrix whose entries come from the coefficients of twopolynomials | The Sylvester matrix is nonsingular if and only if the two polynomials arecoprime to each other |
| Symplectic matrix | The real matrix of asymplectic transformation | |
| Transformation matrix | The matrix of alinear transformation or ageometric transformation | |
| Wedderburn matrix | A matrix of the form, used for rank-reduction & biconjugate decompositions | Analysis of matrix decompositions |
The following matrices find their main application instatistics andprobability theory.
The following matrices find their main application ingraph andnetwork theory.