Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

List of named matrices

From Wikipedia, the free encyclopedia
(Redirected fromList of matrices)

Several important classes of matrices are subsets of each other.

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

In=[100010001].{\displaystyle I_{n}={\begin{bmatrix}1&0&\cdots &0\\0&1&\cdots &0\\\vdots &\vdots &\ddots &\vdots \\0&0&\cdots &1\end{bmatrix}}.}

and thezero matrix of dimensionm×n{\displaystyle m\times n}. For example:

O2×3=(000000){\displaystyle O_{2\times 3}={\begin{pmatrix}0&0&0\\0&0&0\end{pmatrix}}}.

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.

Constant matrices

[edit]

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.

NameExplanationSymbolic description of the entriesNotes
Commutation matrixThe matrix of thelinear map that maps a matrix to its transposeSeeVectorization
Duplication matrixThe matrix of the linear map mapping the vector of the distinct entries of asymmetric matrix to the vector of all entries of the matrixSeeVectorization
Elimination matrixThe 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 matrixThebinary matrix with ones on the anti-diagonal, and zeroes everywhere else.aij = δn+1−i,jApermutation matrix.
Hilbert matrixA structured grid of rational values formed by the sum of polynominal denominators, modulated symmetrically and positively as approximation behavioraij = (i + j − 1)−1.AHankel matrix.
Identity matrixA square diagonal matrix, with all entries on the main diagonal equal to 1, and the rest 0.aij = δij
Lehmer matrixaij = min(i,j) ÷ max(i,j).Apositivesymmetric matrix.
Matrix of onesA matrix with all entries equal to one.aij = 1.
Pascal matrixA matrix containing the entries ofPascal's triangle.
Pauli matricesA 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 matrixEncodes 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 matrixA matrix with ones on the superdiagonal or subdiagonal and zeroes elsewhere.aij = δi+1,j oraij = δi−1,jMultiplication by it shifts matrix elements by one position.
Zero matrixA matrix with all entries equal to zero.aij = 0.

Specific patterns for entries

[edit]

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).

NameExplanationNotes, references
(0,1)-matrixA matrix with all elements either 0 or 1.Synonym forbinary matrix orlogical matrix.
Alternant matrixA matrix in which successive columns have a particular function applied to their entries.
Alternating sign matrixA 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 matrixA square matrix with all entries off the anti-diagonal equal to zero.
Anti-Hermitian matrixSynonym forskew-Hermitian matrix.
Anti-symmetric matrixSynonym forskew-symmetric matrix.
Arrowhead matrixA square matrix containing zeros in all entries except for the first row, first column, and main diagonal.
Band matrixA square matrix whose non-zero entries are confined to a diagonalband.
Bidiagonal matrixA matrix with elements only on the main diagonal and either the superdiagonal or subdiagonal.Sometimes defined differently, see article.
Binary matrixA matrix whose entries are all either 0 or 1.Synonym for(0,1)-matrix orlogical matrix.[1]
Bisymmetric matrixA square matrix that is symmetric with respect to its main diagonal and its main cross-diagonal.
Block-diagonal matrixAblock matrix with entries only on the diagonal.
Block matrixA matrix partitioned in sub-matrices called blocks.
Block tridiagonal matrixA block matrix which is essentially a tridiagonal matrix but with submatrices in place of scalar elements.
Boolean matrixA matrix whose entries are taken from aBoolean algebra.
Cauchy matrixA matrix whose elements are of the form 1/(xi +yj) for (xi), (yj) injective sequences (i.e., taking every value only once).
Centrosymmetric matrixA matrix symmetric about its center; i.e.,aij = ani+1,nj+1.
Circulant matrixA matrix where each row is a circular shift of its predecessor.
Conference matrixA square matrix with zero diagonal and +1 and −1 off the diagonal, such that CTC is a multiple of the identity matrix.
Complex Hadamard matrixA matrix with all rows and columns mutually orthogonal, whose entries are unimodular.
Compound matrixA matrix whose entries are generated by the determinants of all minors of a matrix.
Copositive matrixA square matrixA with real coefficients, such thatf(x)=xTAx{\displaystyle f(x)=x^{T}Ax} is nonnegative for every nonnegative vectorx
Diagonally dominant matrixA matrix whose entries satisfy|aii|>ji|aij|{\displaystyle |a_{ii}|>\sum _{j\neq i}|a_{ij}|}.
Diagonal matrixA square matrix with all entries outside themain diagonal equal to zero.
Discrete Fourier-transform matrixMultiplying by a vector gives the DFT of the vector as result.
Elementary matrixA square matrix derived by applying an elementary row operation to the identity matrix.
Equivalent matrixA matrix that can be derived from another matrix through a sequence of elementary row or column operations.
Frobenius matrixA square matrix in the form of an identity matrix but with arbitrary entries in one column below the main diagonal.
GCD matrixThen×n{\displaystyle n\times n} matrix(S){\displaystyle (S)} having the greatest common divisor(xi,xj){\displaystyle (x_{i},x_{j})} as itsij{\displaystyle ij} entry, wherexi,xjS{\displaystyle x_{i},x_{j}\in S}.
Generalized permutation matrixA square matrix with precisely one nonzero element in each row and column.
Hadamard matrixA square matrix with entries +1, −1 whose rows are mutually orthogonal.
Hankel matrixA matrix with constant skew-diagonals; also an upside down Toeplitz matrix.A square Hankel matrix is symmetric.
Hermitian matrixA square matrix which is equal to itsconjugate transpose,A =A*.
Hessenberg matrixAn "almost" triangular matrix, for example, an upper Hessenberg matrix has zero entries below the first subdiagonal.
Hollow matrixA square matrix whose main diagonal comprises only zero elements.
Integer matrixA matrix whose entries are all integers.
Logical matrixA 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 matrixA matrix of non-negative real numbers, such that the entries in each row sum to 1.
Metzler matrixA matrix whose off-diagonal entries are non-negative.
Monomial matrixA square matrix with exactly one non-zero entry in each row and column.Synonym forgeneralized permutation matrix.
Moore matrixA row consists ofa,aq,aq², etc., and each row uses a different variable.
Nonnegative matrixA matrix with all nonnegative entries.
Null-symmetric matrixA 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 matrixA 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 matrixA matrix partitioned into sub-matrices, or equivalently, a matrix whose entries are themselves matrices rather than scalars.Synonym forblock matrix.
Parisi matrixA 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 matrixA matrix with the only nonzero entries on the main diagonal and the two diagonals just above and below the main one.
Permutation matrixA matrix representation of apermutation, a square matrix with exactly one 1 in each row and column, and all other elements 0.
Persymmetric matrixA matrix that is symmetric about its northeast–southwest diagonal, i.e.,aij = anj+1,ni+1.
Polynomial matrixA matrix whose entries arepolynomials.
Positive matrixA matrix with all positive entries.
Quaternionic matrixA matrix whose entries arequaternions.
Random matrixA matrix whose entries arerandom variables
Sign matrixA matrix whose entries are either +1, 0, or −1.
Signature matrixA diagonal matrix where the diagonal elements are either +1 or −1.
Single-entry matrixA matrix where a single element is one and the rest of the elements are zero.
Skew-Hermitian matrixA square matrix which is equal to the negative of itsconjugate transpose,A* = −A.
Skew-symmetric matrixA matrix which is equal to the negative of itstranspose,AT = −A.
Skyline matrixA rearrangement of the entries of a banded matrix which requires less space.
Sparse matrixA matrix with relatively few non-zero elements.Sparse matrix algorithms can tackle huge sparse matrices that are utterly impractical for dense matrix algorithms.
Symmetric matrixA square matrix which is equal to itstranspose,A =AT (ai,j =aj,i).
Toeplitz matrixA matrix with constant diagonals.
Totally positive matrixA matrix withdeterminants of all its square submatrices positive.
Triangular matrixA 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 matrixA matrix with the only nonzero entries on the main diagonal and the diagonals just above and below the main one.
X–Y–Z matrixA generalization to three dimensions of the concept oftwo-dimensional array
Vandermonde matrixA row consists of 1,a,a2,a3, etc., and each row uses a different variable.
Walsh matrixA 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-matrixA matrix with all off-diagonal entries less than zero.

Matrices satisfying some equations

[edit]

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

(C)i,j=r=1nAi,rBr,j.{\displaystyle (C)_{i,j}=\sum _{r=1}^{n}A_{i,r}B_{r,j}.}[2]

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.

NameExplanationNotes
Circular matrix orConinvolutory matrixA matrix whose inverse is equal to its entrywise complex conjugate:A−1 =A.Compare with unitary matrices.
Congruent matrixTwo matricesA andB are congruent if there exists an invertible matrixP such thatPTAP =B.Compare with similar matrices.
EP matrix or Range-Hermitian matrixA 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 matrixA square matrix having a multiplicativeinverse, that is, a matrixB such thatAB =BA =I.Invertible matrices form thegeneral linear group.
Involutory matrixA 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 matrixA matrix that preserves distances, i.e., a matrix that satisfiesA*A =I whereA* denotes theconjugate transpose ofA.
Nilpotent matrixA square matrix satisfyingAq = 0 for some positive integerq.Equivalently, the only eigenvalue ofA is 0.
Normal matrixA square matrix that commutes with itsconjugate transpose:AA =AAThey are the matrices to which thespectral theorem applies.
Orthogonal matrixA matrix whose inverse is equal to itstranspose,A−1 =AT.They form theorthogonal group.
Orthonormal matrixA matrix whose columns areorthonormal vectors.
Partially Isometric matrixA 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 matrixA square matrix that is not invertible.
Unimodular matrixAn invertible matrix with entries in the integers (integer matrix)Necessarily the determinant is +1 or −1.
Unipotent matrixA square matrix with all eigenvalues equal to 1.Equivalently,AI is nilpotent. See alsounipotent group.
Unitary matrixA square matrix whose inverse is equal to itsconjugate transpose,A−1 =A*.
Totally unimodular matrixA matrix for which every non-singular square submatrix isunimodular. This has some implications in thelinear programmingrelaxation of aninteger program.
Weighing matrixA square matrix the entries of which are in{0, 1, −1}, such thatAAT =wI for some positive integerw.

Matrices with conditions on eigenvalues or eigenvectors

[edit]
NameExplanationNotes
Convergent matrixA square matrix whose successive powers approach thezero matrix.Itseigenvalues have magnitude less than one.
Defective matrixA square matrix that does not have a complete basis ofeigenvectors, and is thus notdiagonalizable.
Derogatory matrixA square matrix whoseminimal polynomial is of order less thann. Equivalently, at least one of its eigenvalues has at least twoJordan blocks.[3]
Diagonalizable matrixA square matrixsimilar to a diagonal matrix.It has aneigenbasis, that is, a complete set oflinearly independent eigenvectors.
Hurwitz matrixA matrix whose eigenvalues have strictly negative real part. A stable system of differential equations may be represented by a Hurwitz matrix.
M-matrixA Z-matrix with eigenvalues whose real parts are nonnegative.
Positive-definite matrixA Hermitian matrix with every eigenvalue positive.
Stability matrixSynonym forHurwitz matrix.
Stieltjes matrixA real symmetric positive definite matrix with nonpositive off-diagonal entries.Special case of anM-matrix.

Matrices generated by specific data

[edit]
NameDefinitionComments
Adjugate matrixTranspose of thecofactor matrixTheinverse of a matrix is its adjugate matrix divided by itsdeterminant
Augmented matrixMatrix whose rows are concatenations of the rows of two smaller matricesUsed for performing the samerow operations on two matrices
Bézout matrixSquare matrix whosedeterminant is theresultant of two polynomialsSee alsoSylvester matrix
Jabotinsky matrixInfinite matrix of theTaylor coefficients of ananalytic function and its integer powersThe composition of two functions can be expressed as the product of their Jabotinsky matrices
Cartan matrixA matrix associated with either a finite-dimensionalassociative algebra, or asemisimple Lie algebra
Cofactor matrixFormed by thecofactors of a square matrix, that is, the signedminors, of the matrixTranspose of theAdjugate matrix
Companion matrixA matrix having the coefficients of a polynomial as last column, and having the polynomial as itscharacteristic polynomial
Coxeter matrixA matrix which describes the relations between theinvolutions that generate aCoxeter group
Distance matrixThe square matrix formed by the pairwise distances of a set ofpointsEuclidean distance matrix is a special case
Euclidean distance matrixA matrix that describes the pairwise distances betweenpoints inEuclidean spaceSee alsodistance matrix
Fundamental matrixThe matrix formed from the fundamental solutions of asystem of linear differential equations
Generator matrixInCoding theory, a matrix whose rowsspan alinear code
Gramian matrixThe symmetric matrix of the pairwiseinner products of a set of vectors in aninner product space
Hessian matrixThe square matrix ofsecond partial derivatives of afunction of several variables
Householder matrixThe matrix of areflection with respect to ahyperplane passing through the origin
Jacobian matrixThe matrix of the partial derivatives of afunction of several variables
Moment matrixUsed instatistics andSum-of-squares optimization
Payoff matrixA matrix ingame theory andeconomics, that represents the payoffs in anormal form game where players move simultaneously
Pick matrixA matrix that occurs in the study of analytical interpolation problems
Rotation matrixA matrix representing arotation
Seifert matrixA matrix inknot theory, primarily for the algebraic analysis of topological properties of knots and links.Alexander polynomial
Shear matrixThe matrix of ashear transformation
Similarity matrixA matrix of scores which express the similarity between two data pointsSequence alignment
Sylvester matrixA square matrix whose entries come from the coefficients of twopolynomialsThe Sylvester matrix is nonsingular if and only if the two polynomials arecoprime to each other
Symplectic matrixThe real matrix of asymplectic transformation
Transformation matrixThe matrix of alinear transformation or ageometric transformation
Wedderburn matrixA matrix of the formA(yTAx)1AxyTA{\displaystyle A-(y^{T}Ax)^{-1}Axy^{T}A}, used for rank-reduction & biconjugate decompositionsAnalysis of matrix decompositions

Matrices used in statistics

[edit]

The following matrices find their main application instatistics andprobability theory.

Matrices used in graph theory

[edit]

The following matrices find their main application ingraph andnetwork theory.

Matrices used in science and engineering

[edit]

Specific matrices

[edit]

Other matrix-related terms and definitions

[edit]

See also

[edit]

Notes

[edit]
  1. ^Hogben 2006, Ch. 31.3.
  2. ^abWeisstein, Eric W."Matrix Multiplication".mathworld.wolfram.com. Retrieved2020-09-07.
  3. ^"Non-derogatory matrix - Encyclopedia of Mathematics".encyclopediaofmath.org. Retrieved2020-09-07.

References

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=List_of_named_matrices&oldid=1320543848"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp