TOPICS
Search

Search Results for ""


431 - 440 of 1223 for Matrix SimilaritySearch Results
The cotangent bundle of a manifold is similar to the tangent bundle, except that it is the set (x,f) where x in M and f is a dual vector in the tangent space to x in M. The ...
A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.
The asymptotic series of the Airy function Ai(z) (and other similar functions) has a different form in different sectors of the complex plane.
Given a set y=f(x) of n equations in n variables x_1, ..., x_n, written explicitly as y=[f_1(x); f_2(x); |; f_n(x)], (1) or more explicitly as {y_1=f_1(x_1,...,x_n); |; ...
The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...
An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...
The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...
The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...
For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...
The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...
1 ... 41|42|43|44|45|46|47 ... 123 Previous Next

...