TOPICS
Search

Search Results for ""


7751 - 7760 of 13134 for Extremal graph theorySearch Results
Two matrices A and B are said to be equal iff a_(ij)=b_(ij) (1) for all i,j. Therefore, [1 2; 3 4]=[1 2; 3 4], (2) while [1 2; 3 4]!=[0 2; 3 4]. (3)
The process of computing a matrix inverse.
A polynomial with matrix coefficients. An nth order matrix polynomial in a variable t is given by P(t)=A_0+A_1t+A_2t^2+...+A_nt^n, where A_k are p×p square matrices.
The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...
The result of a matrix multiplication.
The rank of a matrix or a linear transformation is the dimension of the image of the matrix or the linear transformation, corresponding to the number of linearly independent ...
A real, nondegenerate n×n symmetric matrix A, and its corresponding symmetric bilinear form Q(v,w)=v^(T)Aw, has signature (p,q) if there is a nondegenerate matrix C such that ...
A matrix each of whose elements is a variate. These variates need not be independent, and if they are not, a correlation is said to exist between them.
A Maurer rose is a plot of a "walk" along an n- (or 2n-) leafed rose curve in steps of a fixed number d degrees, including all cosets.
A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...
1 ... 773|774|775|776|777|778|779 ... 1314 Previous Next

...