Search Results for ""
361 - 370 of 1484 for Small Angle ApproximationSearch Results
A bicubic spline is a special case of bicubic interpolation which uses an interpolation function of the form y(x_1,x_2) = sum_(i=1)^(4)sum_(j=1)^(4)c_(ij)t^(i-1)u^(j-1) (1) ...
Let X and Y be CW-complexes and let X_n (respectively Y_n) denote the n-skeleton of X (respectively Y). Then a continuous map f:X->Y is said to be cellular if it takes ...
A wavelet used for filtering signals. Daubechies (1988, p. 980) has tabulated the numerical values up to order p=10.
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 ...
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.
A spectrum formed by the Lagrange numbers. The only ones less than three are the Lagrange numbers, but the last gaps end at Freiman's constant. Real numbers larger than ...
Coefficients which appear in Lagrange interpolating polynomials where the points are equally spaced along the abscissa.
Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...
A nonuniform rational B-spline curve defined by C(t)=(sum_(i=0)^(n)N_(i,p)(t)w_iP_i)/(sum_(i=0)^(n)N_(i,p)(t)w_i), where p is the order, N_(i,p) are the B-spline basis ...
Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...
...
View search results from all Wolfram sites (21796 matches)

