Search Results for ""

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...

Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...

The imaginary number i=sqrt(-1), i.e., the square root of -1. The imaginary unit is denoted and commonly referred to as "i." Although there are two possible square roots of ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

If g(x) is differentiable at the point x and f(x) is differentiable at the point g(x), then f degreesg is differentiable at x. Furthermore, let y=f(g(x)) and u=g(x), then ...

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...