Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
en.wikipedia.org
Chapter 1
List of matrices
This page lists some important classes of matrices used in mathematics, science and engineering. A matrix (plural
matrices, or less commonly matrixes) is a rectangular array of numbers called entries. Matrices have a long history
of both study and application, leading to diverse ways of classifying matrices. A rst group is matrices satisfying
concrete conditions of the entries, including constant matrices. An important example is the identity matrix given by
1 0 0
0 1 0
In = . . .. .. .
.. .. . .
0 0 1
Further ways of classifying matrices are according to their eigenvalues or by imposing conditions on the product of
the matrix with other matrices. Finally, many domains, both in mathematics and other sciences including physics and
chemistry have particular matrices that are applied chiey in these areas.
2
1.1. MATRICES WITH EXPLICITLY CONSTRAINED ENTRIES 3
n
(C)i,j = Ai,r Br,j .
r=1
This matrix product is denoted AB. Unlike the product of numbers, matrix products are not commutative, that is
to say AB need not be equal to BA. A number of notions are concerned with the failure of this commutativity. An
inverse of square matrix A is a matrix B (necessarily of the same dimension as A) such that AB = I. Equivalently, BA
= I. An inverse need not exist. If it exists, B is uniquely determined, and is also called the inverse of A, denoted A1 .
Bernoulli matrix a square matrix with entries +1, 1, with equal probability of each.
Centering matrix a matrix which, when multiplied with a vector, has the same eect as subtracting the mean
of the components of the vector from every component.
Correlation matrix a symmetric nn matrix, formed by the pairwise correlation coecients of several
random variables.
Covariance matrix a symmetric nn matrix, formed by the pairwise covariances of several random variables.
Sometimes called a dispersion matrix.
Dispersion matrix another name for a covariance matrix.
Doubly stochastic matrix a non-negative matrix such that each row and each column sums to 1 (thus the
matrix is both left stochastic and right stochastic)
Fisher information matrix a matrix representing the variance of the partial derivative, with respect to a
parameter, of the log of the likelihood function of a random variable.
Hat matrix - a square matrix used in statistics to relate tted values to observed values.
4 CHAPTER 1. LIST OF MATRICES
Precision matrix a symmetric nn matrix, formed by inverting the covariance matrix. Also called the
information matrix.
Stochastic matrix a non-negative matrix describing a stochastic process. The sum of entries of any row is
one.
Transition matrix a matrix representing the probabilities of conditions changing from one state to another
in a Markov chain
Adjacency matrix a square matrix representing a graph, with aij non-zero if vertex i and vertex j are adjacent.
Biadjacency matrix a special class of adjacency matrix that describes adjacency in bipartite graphs.
Degree matrix a diagonal matrix dening the degree of each vertex in a graph.
Edmonds matrix a square matrix of a bipartite graph.
Incidence matrix a matrix representing a relationship between two classes of objects (usually vertices and
edges in the context of graph theory).
Laplacian matrix a matrix equal to the degree matrix minus the adjacency matrix for a graph, used to nd
the number of spanning trees in the graph.
Seidel adjacency matrix a matrix similar to the usual adjacency matrix but with 1 for adjacency; +1 for
nonadjacency; 0 on the diagonal.
Skew-adjacency matrix an adjacency matrix in which each non-zero aij is 1 or 1, accordingly as the direc-
tion i j matches or opposes that of an initially specied orientation.
Tutte matrix a generalisation of the Edmonds matrix for a balanced bipartite graph.
Substitution matrix a matrix from bioinformatics, which describes mutation rates of amino acid or DNA
sequences.
Z-matrix a matrix in chemistry, representing a molecule in terms of its relative atomic geometry.
Linear independence two or more vectors are linearly independent if there is no way to construct one from
linear combinations of the others.
Row echelon form a matrix in this form is the result of applying the forward elimination procedure to a
matrix (as used in Gaussian elimination).
Wronskian the determinant of a matrix of functions and their derivatives such that row n is the (n-1)th
derivative of row one.
1.10 Notes
[1] Hogben 2006, Ch. 31.3
1.11 References
Hogben, Leslie (2006), Handbook of Linear Algebra (Discrete Mathematics and Its Applications), Boca Raton:
Chapman & Hall/CRC, ISBN 978-1-58488-510-8
Chapter 2
Z-matrix (mathematics)
For the chemistry related meaning of this term see Z-matrix (chemistry).
In mathematics, the class of Z-matrices are those matrices whose o-diagonal entries are less than or equal to zero;
that is, a Z-matrix Z satises
Z = (zij ); zij 0, i = j.
Note that this denition coincides precisely with that of a negated Metzler matrix or quasipositive matrix, thus the
term quasinegative matrix appears from time to time in the literature, though this is rare and usually only in contexts
where references to quasipositive matrices are made.
The Jacobian of a competitive dynamical system is a Z-matrix by denition. Likewise, if the Jacobian of a cooper-
ative dynamical system is J, then (J) is a Z-matrix.
Related classes are L-matrices, M-matrices, P-matrices, Hurwitz matrices and Metzler matrices. L-matrices have the
additional property that all diagonal entries are greater than zero. M-matrices have several equivalent denitions, one
of which is as follows: a Z-matrix is an M-matrix if it is nonsingular and its inverse is nonnegative. All matrices that
are both Z-matrices and P-matrices are nonsingular M-matrices.
Hurwitz matrix
Metzler matrix
2.2 References
Huan T.; Cheng G.; Cheng X. (1 April 2006). Modied SOR-type iterative method for Z-matrices. Applied
Mathematics and Computation. 175 (1): 258268. doi:10.1016/j.amc.2005.07.050.
Saad, Y. Iterative methods for sparse linear systems (2nd ed.). Philadelphia, PA.: Society for Industrial and
Applied Mathematics. p. 28. ISBN 0-534-94776-X.
Berman, Abraham; Plemmons, Robert J. (2014). Nonnegative Matrices in the Mathematical Sciences. Aca-
demic Press. ISBN 9781483260860.
6
2.3. TEXT AND IMAGE SOURCES, CONTRIBUTORS, AND LICENSES 7
2.3.2 Images
File:Nuvola_apps_edu_mathematics_blue-p.svg Source: https://upload.wikimedia.org/wikipedia/commons/3/3e/Nuvola_apps_edu_
mathematics_blue-p.svg License: GPL Contributors: Derivative work from Image:Nuvola apps edu mathematics.png and Image:Nuvola
apps edu mathematics-p.svg Original artist: David Vignoni (original icon); Flamurai (SVG convertion); bayo (color)
File:Rubik{}s_cube_v3.svg Source: https://upload.wikimedia.org/wikipedia/commons/b/b6/Rubik%27s_cube_v3.svg License: CC-
BY-SA-3.0 Contributors: Image:Rubik{}s cube v2.svg Original artist: User:Booyabazooka, User:Meph666 modied by User:Niabot
File:Taxonomy_of_Complex_Matrices.svg Source: https://upload.wikimedia.org/wikipedia/commons/d/d1/Taxonomy_of_Complex_
Matrices.svg License: CC BY-SA 3.0 Contributors: {own} Original artist: Jrme