TOPICS
Search

Search Results for ""


371 - 380 of 1192 for LinearSearch Results
Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...
A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...
A square matrix that is not singular, i.e., one that has a matrix inverse. Nonsingular matrices are sometimes also called regular matrices. A square matrix is nonsingular iff ...
An orthonormal set is a set of normalized orthogonal vectors or functions.
The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...
If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...
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 ...
1 ... 35|36|37|38|39|40|41 ... 120 Previous Next

...