TOPICS
Search

Search Results for ""


411 - 420 of 1447 for Transformation MatrixSearch Results
The operator norm of a linear operator T:V->W is the largest value by which T stretches an element of V, ||T||=sup_(||v||=1)||T(v)||. (1) It is necessary for V and W to be ...
Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)
An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...
A two-sided (doubly infinite) Laplace transform, L_t[f(t)](s)=int_(-infty)^inftyf(t)e^(-st)dt. While some authors use this as the primary definition of "the" Laplace ...
A quaternion with complex coefficients. The algebra of biquaternions is isomorphic to a full matrix ring over the complex number field (van der Waerden 1985).
Each Cartan matrix determines a unique semisimple complex Lie algebra via the Chevalley-Serre, sometimes called simply the "Serre relations." That is, if (A_(ij)) is a k×k ...
A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...
The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...
The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...
Let X={x_1>=x_2>=...>=x_n|x_i in R} (1) and Y={y_1>=y_2>=...>=y_n|y_i in R}. (2) Then there exists an n×n Hermitian matrix with eigenvalues X and diagonal elements Y iff ...
1 ... 39|40|41|42|43|44|45 ... 145 Previous Next

...