Search Results for ""

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...

A nonparametric alternative to the two-sample t-test.

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A differential-algebraic equation (DAE) is a type of differential equation in which the derivatives are not (in general) expressed explicitly, and typically derivatives of ...

In geometry, the term "enlargement" is a synonym for expansion. In nonstandard analysis, let X be a set of urelements, and let V(X) be the superstructure with individuals in ...

Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...

An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

(1) for p in [0,1], where delta is the central difference and E_(2n) = G_(2n)-G_(2n+1) (2) = B_(2n)-B_(2n+1) (3) F_(2n) = G_(2n+1) (4) = B_(2n)+B_(2n+1), (5) where G_k are ...