Matrices Matrices In mathematics and computer science, the adjacency matrix for a finite graph on n vertices is an n × n matrix where the nondiagonal entry aij is the number of edges joining vertex and vertex , and the diagonal entry aii is either twice the number of loops at vertex or just the number of loops (usages differ; this article follows the former; directed graphs always follow the latter). There exists a unique adjacency matrix for each graph, and it is not the adjacency matrix of any other graph. In the special case of a finite, simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. ...more on Wikipedia about "Adjacency matrix"
In the mathematical field of graph theory the admittance matrix, Kirchhoff matrix, or Laplacian matrix is a matrix representation of a graph. Together with Kirchhoff's theorem it can be used to calculate the number of spanning trees for a given graph. ...more on Wikipedia about "Admittance matrix"
In mathematics, an alternating sign matrix is an square matrix made up of 0s, 1s, and −1s in such a manner than ...more on Wikipedia about "Alternating sign matrix"
In mathematics, an anti-diagonal matrix is a matrix where all the entries are zero except those on the anti-diagonal (the diagonal going from the lower left corner to the upper right corner). ...more on Wikipedia about "Anti-diagonal matrix"
In mathematics, a band matrix is a particular type of sparse matrix, with entries that are non-zero confined by some lines running north-west to south-east. ...more on Wikipedia about "Band matrix"
In mathematics, a Bézout matrix (or Bézoutian) is a special square matrix associated to two polynomials. Such matrices are sometimes used to test the stability of a given polynomial. ...more on Wikipedia about "Bézout matrix"
In mathematics and computer science, the biadjacency matrix for a finite bipartite graph with n black vertices and m white vertices is an n × m matrix where the entry aij is the number of edges joining black vertex and white vertex . In the special case of a finite, undirected simple bipartite graph, the biadjacency matrix is a (0,1)-matrix. ...more on Wikipedia about "Biadjacency matrix" This text is made on www.shortopedia.com Matrices
A bidiagonal matrix is a symmetric tridiagonal matrix, a special type of matrix representation from the LAPACK Fortran package. ...more on Wikipedia about "Bidiagonal matrix"
A binary matrix or (0,1)-matrix is a matrix whose entries are all either zero or one. ...more on Wikipedia about "Binary matrix"
In the mathematical discipline of matrix theory, a block matrix or a partitioned matrix is a partition of a matrix into rectangular smaller matrices called blocks. Looking at it another way, the matrix is written in terms of smaller matrices written side-by-side. A block matrix must conform to a consistent way of splitting up the rows, and the columns: we group the rows into some adjacent 'bunches', and the columns likewise. The partition is into the rectangles described by one bunch of adjacent rows crossing one bunch of adjacent columns. In other words, the matrix is split up by some horizontal and vertical lines that go all the way across. ...more on Wikipedia about "Block matrix"
"A block reflector is an orthogonal, symmetric matrix that reverses a subspace whose dimension may be greater than one." ...more on Wikipedia about "Block reflector"
In mathematics, the term Cartan matrix has two meanings. Both of these are named after Elie Cartan. ...more on Wikipedia about "Cartan matrix"
In linear algebra, a circulant matrix is a special kind of Toeplitz matrix where each row vector is shifted one element to the right relative to the preceding row vector. In other words a circulant matrix is an example of a Latin square. In numerical analysis circulant matrices are important because they can be quickly solved using the discrete Fourier transform. ...more on Wikipedia about "Circulant matrix"
In the standard model of particle physics the Cabibbo Kobayashi Maskawa matrix (CKM matrix, sometimes earlier called KM matrix) is a unitary matrix which contains information on the strength of flavour changing weak decays. Technically, it specifies the mismatch of quantum states of quarks when they propagate freely and when they take part in the weak interactions. It is important in the understanding of CP violations. A precise mathematical definition of this matrix is given in the article on the formulation of the standard model. This matrix was introduced for three generations of quarks by Makoto Kobayashi and Toshihide Maskawa, adding one generation to the matrix previously introduced by Nicola Cabibbo. ...more on Wikipedia about "CKM matrix"
In linear algebra, a column vector is an m × 1 matrix, i.e. a matrix consisting of a single column. ...more on Wikipedia about "Column vector"
In linear algebra, the companion matrix of the monic polynomial ...more on Wikipedia about "Companion matrix"
In statistics, a design matrix is a matrix that is used in certain statistical models, e.g., the general linear model. ...more on Wikipedia about "Design matrix"
The N-point discrete Fourier transform (DFT) can be expressed as a matrix multiplication with an N-by-N matrix, as follows: ...more on Wikipedia about "DFT matrix"
In linear algebra, a diagonal matrix is a square matrix in which the entries outside the main diagonal are all zero. The diagonal entries themselves may or may not be zero. Thus, the matrix D = (di,j) with ...more on Wikipedia about "Diagonal matrix"
In linear algebra, a square matrix A is called diagonalizable if it is similar to a diagonal matrix, i.e. if there exists an invertible matrix P such that P -1AP is a diagonal matrix. If V is a finite- dimensional vector space, then a linear map T : V → V is called diagonalizable if there exists a basis of V with respect to which T is represented by a diagonal matrix. Diagonalization is the process of finding a corresponding diagonal matrix for a diagonalizable matrix or linear map. ...more on Wikipedia about "Diagonalizable matrix"
In mathematics, a distance matrix is a matrix (two-dimensional array) containing the distances, taken pairwise, of a set of points. It is therefore a symmetric N×N matrix containing non-negative reals as elements, given N points in Euclidean space. The number of pairs of points N×(N-1)/2 is the number of independent elements in the distance matrix. ...more on Wikipedia about "Distance matrix" http://www.shortopedia.com Dreamteam.
An elementary reflector is a vector that implements reflection (mathematics). ...more on Wikipedia about "Elementary reflector"
In quantum mechanics, the Fock matrix is a matrix approximating the single-electron energy operator of a given quantum system in a given set of basis vectors. ...more on Wikipedia about "Fock matrix"
The gamma matrices, also known as Dirac matrices, were developed by P.A.M. Dirac in order to serve as coefficients of the Dirac equation. One possible representation of the four contravariant gamma matrices is ...more on Wikipedia about "Gamma matrices"
The Gell-Mann matrices, named for Murray Gell-Mann, are one possible representation of the infinitesimal generators of the special unitary group called SU(3). ...more on Wikipedia about "Gell-Mann matrices"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Matrices".
| MAIN PAGE | MAIN INDEX | CONTACT US |