Search Results 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 ...

A hypotrochoid is a roulette traced by a point P attached to a circle of radius b rolling around the inside of a fixed circle of radius a, where P is a distance h from the ...

An improper integral is a definite integral that has either or both limits infinite or an integrand that approaches infinity at one or more points in the range of ...

An initial value problem is a problem that has its conditions specified at some time t=t_0. Usually, the problem is an ordinary differential equation or a partial ...

The process of computing or obtaining an integral. A more archaic term for integration is quadrature.

A matrix used in the Jacobi transformation method of diagonalizing matrices. The Jacobi rotation matrix P_(pq) contains 1s along the diagonal, except for the two elements ...

A method of matrix diagonalization using Jacobi rotation matrices P_(pq). It consists of a sequence of orthogonal similarity transformations of the form ...