Search Results for ""

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

Consider the differential equation satisfied by w=z^(-1/2)W_(k,-1/4)(1/2z^2), (1) where W is a Whittaker function, which is given by ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), .... Then Weddle's rule approximating the integral of ...

The Weibull distribution is given by P(x) = alphabeta^(-alpha)x^(alpha-1)e^(-(x/beta)^alpha) (1) D(x) = 1-e^(-(x/beta)^alpha) (2) for x in [0,infty), and is implemented in ...

Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...

The Weierstrass substitution is the trigonometric substitution t=tan(theta/2) which transforms an integral of the form intf(costheta,sintheta)dtheta into one of the form ...

Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

A statistic w on the symmetric group S_n is called a weighted inversion statistic if there exists an upper triangular matrix W=(w_(ij)) such that ...