Search Results for ""

Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...

The integral transform (Kf)(x)=int_0^inftysqrt(xt)K_nu(xt)f(t)dt, where K_nu(x) is a modified Bessel function of the second kind. Note the lower limit of 0, not -infty as ...

The integral transform defined by (Kphi)(x)=int_0^inftyG_(pq)^(mn)(xt|(a_p); (b_q))phi(t)dt, where G_(pq)^(mn) is a Meijer G-function. Note the lower limit of 0, not -infty ...

Two functions f(x) and g(x) are orthogonal over the interval a<=x<=b with weighting function w(x) if <f(x)|g(x)>=int_a^bf(x)g(x)w(x)dx=0. (1) If, in addition, ...

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

P(Z)=Z/(sigma^2)exp(-(Z^2+|V|^2)/(2sigma^2))I_0((Z|V|)/(sigma^2)), where I_0(z) is a modified Bessel function of the first kind and Z>0. For a derivation, see Papoulis ...

Let f:D(z_0,r)\{z_0}->C be analytic and bounded on a punctured open disk D(z_0,r), then lim_(z->z_0)f(z) exists, and the function defined by f^~:D(z_0,r)->C f^~(z)={f(z) for ...

The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...