Search Results for ""

Tetradics transform dyadics in much the same way that dyadics transform vectors. They are represented using Hebrew characters and have 81 components (Morse and Feshbach 1953, ...

The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

An ordered vector basisv_1,...,v_n for a finite-dimensional vector space V defines an orientation. Another basis w_i=Av_i gives the same orientation if the matrix A has a ...

Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...

Let A=a_(ij) be an n×n matrix with complex (or real) entries and eigenvalues lambda_1, lambda_2, ..., lambda_n, then sum_(i=1)^n|lambda_i|^2<=sum_(i,j=1)^n|a_(ij)|^2 (1) ...

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

Let V be a real symmetric matrix of large order N having random elements v_(ij) that for i<=j are independently distributed with equal densities, equal second moments m^2, ...