Search Results for ""

A method for finding roots which defines P_j(x)=(P(x))/((x-x_1)...(x-x_j)), (1) so the derivative is (2) One step of Newton's method can then be written as ...

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

The parabolic cylinder functions are a class of functions sometimes called Weber functions. There are a number of slightly different definitions in use by various authors. ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

The Bessel functions of the first kind J_n(x) are defined as the solutions to the Bessel differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0 (1) which are ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

Denoted zn(u,k) or Z(u). Z(phi|m)=E(phi|m)-(E(m)F(phi|m))/(K(m)), where phi is the Jacobi amplitude, m is the parameter, and F(phi|m) and K(m) are elliptic integrals of the ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

Odd values of Q(n) are 1, 1, 3, 5, 27, 89, 165, 585, ... (OEIS A051044), and occur with ever decreasing frequency as n becomes large (unlike P(n), for which the fraction of ...

d_n=p_(n+1)-p_n. (1) The first few values are 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, ... (OEIS A001223). Rankin has shown that d_n>(clnnlnlnnlnlnlnlnn)/((lnlnlnn)^2) ...