TOPICS
Search

Search Results for ""


901 - 910 of 1889 for vector spaceSearch Results
The Peano-Gosper curve is a plane-filling function originally called a "flowsnake" by R. W. Gosper and M. Gardner. Mandelbrot (1977) subsequently coined the name Peano-Gosper ...
An operator which describes the time evolution of densities in phase space. The operator can be defined by rho_(n+1)=L^~rho_n, where rho_n are the natural invariants after ...
A closed three-dimensional figure (which may, according to some terminology conventions, be self-intersecting). Kern and Bland (1948, p. 18) define a solid as any limited ...
If X is any compact space, let A be a subalgebra of the algebra C(X) over the reals R with binary operations + and ×. Then, if A contains the constant functions and separates ...
The Cayley-Menger determinant is a determinant that gives the volume of a simplex in j dimensions. If S is a j-simplex in R^n with vertices v_1,...,v_(j+1) and B=(beta_(ik)) ...
An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...
There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...
A quadratic form involving n real variables x_1, x_2, ..., x_n associated with the n×n matrix A=a_(ij) is given by Q(x_1,x_2,...,x_n)=a_(ij)x_ix_j, (1) where Einstein ...
The Riemann theta function is a complex function of g complex variables that occurs in the construction of quasi-periodic solutions of various equations in mathematical ...
The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...
1 ... 88|89|90|91|92|93|94 ... 189 Previous Next

...