Search Results for ""

Delta_hf(x)=(f(x+h)-f(x))/h=(Deltaf)/h. It gives the slope of the secant line passing through f(x) and f(x+h). In the limit h->0, the difference quotient becomes the partial ...

A Padé approximant perturbed with a Chebyshev polynomial of the first kind to reduce the leading coefficient in the error.

Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...

Let C_(L,M) be a Padé approximant. Then C_((L+1)/M)S_((L-1)/M)-C_(L/(M+1))S_(L/(M+1)) = C_(L/M)S_(L/M) (1) C_(L/(M+1))S_((L+1)/M)-C_((L+1)/M)S_(L/(M+1)) = ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

f(x) approx t_n(x)=sum_(k=0)^(2n)f_kzeta_k(x), where t_n(x) is a trigonometric polynomial of degree n such that t_n(x_k)=f_k for k=0, ..., 2n, and ...

The indefinite summation operator Delta^(-1) for discrete variables, is the equivalent of integration for continuous variables. If DeltaY(x)=y(x), then Delta^(-1)y(x)=Y(x).

One of the "knots" t_(p+1), ..., t_(m-p-1) of a B-spline with control points P_0, ..., P_n and knot vector T={t_0,t_1,...,t_m}, where p=m-n-1.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

The substitution of re^(itheta) for z in a polynomial p(z). p(z) is then plotted as a function of theta for a given r in the complex plane. By varying r so that the curve ...