Search Results for ""

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The approximating polynomial which has the smallest maximum deviation from the true function. It is closely approximated by the Chebyshev polynomials of the first kind.

Regge calculus is a finite element method utilized in numerical relativity in attempts of describing spacetimes with few or no symmetries by way of producing numerical ...

Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...

The function defined by y_+^alpha={y^alpha for y>0; 0 for y<=0. (1)

To each epsilon>0, there corresponds a delta such that ||f-g||<epsilon whenever ||f||=||g||=1 and ||(f+g)/2||>1-delta. This is a geometric property of the unit sphere of ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Given a set of n+1 control points P_0, P_1, ..., P_n, the corresponding Bézier curve (or Bernstein-Bézier curve) is given by C(t)=sum_(i=0)^nP_iB_(i,n)(t), where B_(i,n)(t) ...

A cubic spline is a spline constructed of piecewise third-order polynomials which pass through a set of m control points. The second derivative of each polynomial is commonly ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...