TOPICS
Search

Search Results for ""


1171 - 1180 of 2765 for Linear Recurrence EquationSearch Results
A method of matrix diagonalization using Jacobi rotation matrices P_(pq). It consists of a sequence of orthogonal similarity transformations of the form ...
The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...
Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...
The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...
Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...
Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...
A positive semidefinite matrix is a Hermitian matrix all of whose eigenvalues are nonnegative. A matrix m may be tested to determine if it is positive semidefinite in the ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A square matrix A is a special orthogonal matrix if AA^(T)=I, (1) where I is the identity matrix, and the determinant satisfies detA=1. (2) The first condition means that A ...
A square matrix U is a special unitary matrix if UU^*=I, (1) where I is the identity matrix and U^* is the conjugate transpose matrix, and the determinant is detU=1. (2) The ...
1 ... 115|116|117|118|119|120|121 ... 277 Previous Next

...