Search Results for ""

The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...

Given a Poisson distribution with rate of change lambda, the distribution of waiting times between successive changes (with k=0) is D(x) = P(X<=x) (1) = 1-P(X>x) (2) = ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

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.

The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

The matrix direct sum of n matrices constructs a block diagonal matrix from a set of square matrices, i.e., direct sum _(i=1)^nA_i = diag(A_1,A_2,...,A_n) (1) = [A_1 ; A_2 ; ...

A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...

A copositive matrix is a real n×n square matrix A=(a_(ij)) that makes the corresponding quadratic form f(x)=x^(T)Ax nonnegative for all nonnegative n-vectors x. Copositive ...

The trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...