Search Results for ""

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The map x_(n+1)=2mux_n, (1) where x is computed modulo 1. A generalized Baker's map can be defined as x_(n+1) = {lambda_ax_n y_n<alpha ; (1-lambda_b)+lambda_bx_n y_n>alpha ...

A check which can be used to verify correct computations in a table of grouped classes. For example, consider the following table with specified class limits and frequencies ...

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

The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...

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

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...

The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...