Search Results for ""

Moving medians are implemented in the Wolfram Language as MovingMedian[data, n].

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 ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...

A B-spline is a generalization of the Bézier curve. Let a vector known as the knot vector be defined T={t_0,t_1,...,t_m}, (1) where T is a nondecreasing sequence with t_i in ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

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 ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Let g:R->R be a function and let h>0, and define the cardinal series of g with respect to the interval h as the formal series sum_(k=-infty)^inftyg(kh)sinc((x-kh)/h), where ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...