Search Results for ""

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

Let f:R->R, then the negative part of f is the function f^-:R->R defined by f^-(x)=max(-f(x),0). Note that the negative part is itself a nonnegative function. The negative ...

The angular position of a quantity. For example, the phase of a function cos(omegat+phi_0) as a function of time is phi(t)=omegat+phi_0. The complex argument of a complex ...

Given a function f specified by parametric variables u_1, ..., u_n, a reparameterization f^^ of f over domain U is a change of variables u_i in U->v_i->V via a function phi ...

For a given bounded function f(x) over a partition of a given interval, the upper sum is the sum of box areas M^*Deltax_k using the supremum M of the function f(x) in each ...

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...

If f is a function on an open set U, then the zero set of f is the set Z={z in U:f(z)=0}. A subset of a topological space X is called a zero set if it is equal to f^(-1)(0) ...

The integral phi(t,u)=int(e^(piitx^2+2piiux))/(e^(2piix)-1)dx which is related to the Jacobi theta functions, mock theta functions, Riemann zeta function, and Siegel theta ...

The hyperfactorial (Sloane and Plouffe 1995) is the function defined by H(n) = K(n+1) (1) = product_(k=1)^(n)k^k, (2) where K(n) is the K-function. The hyperfactorial is ...

A map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...