TOPICS
Search

Search Results for ""


7511 - 7520 of 13135 for Computational GeometrySearch Results
The partial differential equation del ^2A=-del xE, where del ^2 is the vector Laplacian.
A function A such that B=del xA. The most common use of a vector potential is the representation of a magnetic field. If a vector field has zero divergence, it may be ...
The span of subspace generated by vectors v_1 and v_2 in V is Span(v_1,v_2)={rv_1+sv_2:r,s in R}. A set of vectors m={v_1,...,v_n} can be tested to see if they span ...
A vector sum is the result of adding two or more vectors together via vector addition. It is denoted using the normal plus sign, i.e., the vector sum of vectors A, B, and C ...
The set of n quantities v_j are components of an n-dimensional vector v iff, under rotation, v_i^'=a_(ij)v_j (1) for i=1, 2, ..., n. The direction cosines between x_i^' and ...
The vercosine, written vercos(z) and also known as the "versed cosine," is a little-used trigonometric function defined by vercos(z) = 2cos^2(1/2z) (1) = 1+cosz, (2) where ...
A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...
The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...
The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...
The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...
1 ... 749|750|751|752|753|754|755 ... 1314 Previous Next

...