TOPICS
Search

Search Results for ""


6381 - 6390 of 13135 for Computational GeometrySearch Results
A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...
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 negative real axis is the portion of the real axis with x<0.
A negative semidefinite matrix is a Hermitian matrix all of whose eigenvalues are nonpositive. A matrix m may be tested to determine if it is negative semidefinite in the ...
Let V be a complete normal variety, and write G(V) for the group of divisors, G_n(V) for the group of divisors numerically equal to 0, and G_a(V) the group of divisors ...
A composition of a function f degreesf with itself gives a nested function f(f(x)), f degreesf degreesf which gives f(f(f(x)), etc. Function nesting is implemented in the ...
Let S be the set of all possibilities that satisfy hypothesis H, and let S^' be the set of all possibilities that satisfy hypothesis H^'. Then H^' is a nested hypothesis ...
Partial differential equation boundary conditions which give the normal derivative on a surface.
The second-order ordinary differential equation satisfied by the Neumann polynomials O_n(x).
An analytic refinement of results from complex analysis such as those codified by Picard's little theorem, Picard's great theorem, and the Weierstrass-Casorati theorem.
1 ... 636|637|638|639|640|641|642 ... 1314 Previous Next

...