Search Results for ""

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...

The quantum of a finite floating-point representation is the value of a unit in the last position of its significand. In general, the quantum is equal to the radix raised to ...

Let n>=0 and alpha_1, alpha_2, ...be the positive roots of J_n(x)=0, where J_n(z) is a Bessel function of the first kind. An expansion of a function in the interval (0,1) in ...

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

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

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

A two-dimensional piecewise linear map defined by x_(n+1) = 1-y_n+|x_n| (1) y_(n+1) = x_n. (2) The map is chaotic in the filled region above and stable in the six hexagonal ...

If A is a graded module and there exists a degree-preserving linear map phi:A tensor A->A, then (A,phi) is called a graded algebra. Cohomology is a graded algebra. In ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

The great snub dodecicosidodecahedron is the uniform polyhedron with Maeder index 64 (Maeder 1997), Wenninger index 115 (Wenninger 1989), Coxeter index 80 (Coxeter et al. ...