Search Results for ""
1141 - 1150 of 2765 for Linear Recurrence EquationSearch Results
![](/common/images/search/spacer.gif)
A matrix A for which A^(H)=A^(T)^_=A, where the conjugate transpose is denoted A^(H), A^(T) is the transpose, and z^_ is the complex conjugate. If a matrix is self-adjoint, ...
The shear matrix e_(ij)^s is obtained from the identity matrix by inserting s at (i,j), e.g., e_(12)^s=[1 s 0; 0 1 0; 0 0 1]. (1) Bolt and Hobbs (1998) define a shear matrix ...
A system is singular if its condition number is infinite and ill-conditioned if it is too large.
A diagonal of a square matrix which is traversed in the "northeast" direction. "The" skew diagonal (or "secondary diagonal") of an n×n square matrix is the skew diagonal from ...
An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.
An n×n array is called a square array. Considered as a matrix, a square array is called a square matrix.
An interspersion array given by 1 2 3 5 8 13 21 34 55 ...; 4 6 10 16 26 42 68 110 178 ...; 7 11 18 29 47 76 123 199 322 ...; 9 15 24 39 63 102 165 267 432 ...; 12 19 31 50 81 ...
A lower triangular matrix having 0s along the diagonal as well as the upper portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for i<=j. Written explicitly, L=[0 0 ... 0; ...
A strictly upper triangular matrix is an upper triangular matrix having 0s along the diagonal as well as the lower portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for ...
Let A_r=a_(ij) be a sequence of N symmetric matrices of increasing order with i,j=1, 2, ..., r and r=1, 2, ..., N. Let lambda_k(A_r) be the kth eigenvalue of A_r for k=1, 2, ...
![](/common/images/search/spacer.gif)
...