TOPICS
Search

Search Results for ""


81 - 90 of 420 for Nonlinear ProgrammingSearch Results
The winding number W(theta) of a map f(theta) with initial value theta is defined by W(theta)=lim_(n->infty)(f^n(theta)-theta)/n, which represents the average increase in the ...
A regression giving conditional expectation values of a given variable in terms of two or more other variables.
Given a matrix equation Ax=b, the normal equation is that which minimizes the sum of the square differences between the left and right sides: A^(T)Ax=A^(T)b. It is called a ...
The motion along a phase curve as a function of time (Tabor 1989, p. 14).
For a function with 2 degrees of freedom, the 2-dimensional phase space that is accessible to the function or object is called its phase plane.
The partial differential equation u_(tt)-u_(xx)-u+u^3=0.
The system of partial differential equations u_(xx)-u_(yy)+/-sinucosu+(cosu)/(sin^3u)(v_x^2-v_y^2)=0 (v_xcot^2u)_x=(v_ycot^2u)_y.
D_P(x)=lim_(epsilon->0)(lnmu(B_epsilon(x)))/(lnepsilon), where B_epsilon(x) is an n-dimensional ball of radius epsilon centered at x and mu is the probability measure.
A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...
The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...
1 ... 6|7|8|9|10|11|12 ... 42 Previous Next

...