Search Results for ""
121 - 130 of 3570 for Matrix Tree TheoremSearch Results
Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...
A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.
A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).
If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...
A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...
A theorem of fundamental importance in spectroscopy and angular momentum theory which provides both (1) an explicit form for the dependence of all matrix elements of ...
An n×n complex matrix A is called indefinite if nonzero vectors x and y exist such that x^*Ax>0>y^*Ay, where x^* denotes the conjugate transpose. A matrix m may be tested to ...
A square matrix is called centrosymmetric if it is symmetric with respect to the center (Muir 1960, p. 19).
A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...
A theorem which specifies the structure of the generic unitary representation of the Weyl relations and thus establishes the equivalence of Heisenberg's matrix mechanics and ...
...
View search results from all Wolfram sites (23765 matches)

