Search Results for ""
941 - 950 of 2765 for Linear Recurrence EquationSearch Results

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 group in which the elements are square matrices, the group multiplication law is matrix multiplication, and the group inverse is simply the matrix inverse. Every matrix ...
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.
A negative semidefinite matrix is a Hermitian matrix all of whose eigenvalues are nonpositive. A matrix m may be tested to determine if it is negative semidefinite in the ...
A nonpositive matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonpositive number, i.e., a_(ij)<=0 for all i, j. Nonpositive matrices are ...
The subdiagonal of a square matrix is the set of elements directly under the elements comprising the diagonal. For example, in the following matrix, the diagonal elements are ...
The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.
A bilinear basis is a basis, which satisfies the conditions (ax+by)·z=a(x·z)+b(y·z) z·(ax+by)=a(z·x)+b(z·y).
A matrix whose eigenvectors are not complete.
A square matrix which is not reducible is said to be irreducible.

...