Search Results for ""

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

Let k>=0 and n>=2 be integers. A SOMA, or more specifically a SOMA(k,n), is an n×n array A, whose entries are k-subsets of a kn-set Omega, such that each element of Omega ...

A sample is a subset of a population that is obtained through some process, possibly random selection or selection based on a certain set of criteria, for the purposes of ...

When computing the sample variance s numerically, the mean must be computed before s^2 can be determined. This requires storing the set of sample values. However, it is ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

A conformal mapping from the upper half-plane to a polygon.

A polyhedron constructed by ruling 2n equally spaced vertical lines along the surface of a cylinder together with 2n^3 circles around the cylinder at equally spaced heights. ...

The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...