Search Results for ""

An integral equation of the form phi(x)=f(x)+lambdaint_(-infty)^inftyK(x,t)phi(t)dt (1) phi(x)=1/(sqrt(2pi))int_(-infty)^infty(F(t)e^(-ixt)dt)/(1-sqrt(2pi)lambdaK(t)). (2) ...

The tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...

Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

Gaussian brackets are notation published by Gauss in Disquisitiones Arithmeticae and defined by [ ]=1 (1) [a_1]=a_1 (2) [a_1,a_2]=[a_1]a_2+[ ] (3) ...

At rational arguments p/q, the digamma function psi_0(p/q) is given by psi_0(p/q)=-gamma-ln(2q)-1/2picot(p/qpi) +2sum_(k=1)^([q/2]-1)cos((2pipk)/q)ln[sin((pik)/q)] (1) for ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...

A Hessenberg matrix is a matrix of the form [a_(11) a_(12) a_(13) ... a_(1(n-1)) a_(1n); a_(21) a_(22) a_(23) ... a_(2(n-1)) a_(2n); 0 a_(32) a_(33) ... a_(3(n-1)) a_(3n); 0 ...