TOPICS
Search

Search Results for ""


1111 - 1120 of 2765 for Linear Recurrence EquationSearch Results
The process of computing a matrix inverse.
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.
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 ...
The eigenvalues of a matrix A are called its spectrum, and are denoted lambda(A). If lambda(A)={lambda_1,...,lambda_n}, then the determinant of A is given by ...
The natural norm induced by the L-infty-norm is called the maximum absolute row sum norm and is defined by ||A||_infty=max_(i)sum_(j=1)^n|a_(ij)| for a matrix A. This matrix ...
If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...
A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...
A nonempty finite set of n×n integer matrices for which there exists some product of the matrices in the set which is equal to the zero matrix.
For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.
1 ... 109|110|111|112|113|114|115 ... 277 Previous Next

...