Circular points at infinity: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>David Eppstein
en>Magioladitis
m fixed tag
Line 1: Line 1:
In [[mathematics]], a '''Euclidean distance matrix''' is an ''n×n'' [[matrix (mathematics)|matrix]] representing the spacing of a set of ''n'' [[point (geometry)|points]] in [[Euclidean space]]. If ''A'' is a Euclidean distance matrix and the points <math>x_1,x_2,\ldots,x_n</math> are defined on ''m''-dimensional space, then the elements of ''A'' are given by
Ed is what individuals contact me and my wife doesn't like it at all. Mississippi is the only place I've been residing in but I will have to move in a yr or two. Office supervising is my occupation. To play domino is something I really appreciate doing.<br><br>Take a look at my homepage: real psychics; [http://koreanyelp.com/index.php?document_srl=1798&mid=SchoolNews koreanyelp.com],
 
:<math>\begin{array}{rll}
A & = & (a_{ij});
\\
a_{ij} & = & ||x_i - x_j||_2^2
\end{array}
</math>
 
where ||.||<sub>2</sub> denotes the [[2-norm]] on '''R'''<sup>m</sup>.
 
==Properties==
 
Simply put, the element ''a<sub>ij</sub>'' describes the square of the distance between the ''i''<sup> th</sup> and ''j''<sup> th</sup> points in the set. By the properties of the 2-norm (or indeed, Euclidean distance in general), the matrix ''A'' has the following properties.
 
* All elements on the [[diagonal of a matrix|diagonal]] of ''A'' are zero (i.e. it is a [[hollow matrix]]).
* The [[trace of a matrix|trace]] of ''A'' is zero (by the above property).
* ''A'' is [[symmetric matrix|symmetric]] (i.e. ''a<sub>ij</sub>'' = ''a<sub>ji</sub>'').
* ''a<sub>ij</sub>''<sup>1/2</sup> <math>\le</math> ''a<sub>ik</sub>''<sup>1/2</sup> + ''a<sub>kj</sub>''<sup>1/2</sup> (by the [[triangle inequality]])
* <math> a_{ij}\ge 0</math>
* The number of unique (distinct) non-zero values within an ''N''-by-''N'' Euclidean distance matrix is bounded (above) by [''N''*(''N''-1)] / 2 due to the matrix being symmetric and hollow.
* In dimension ''m'', a Euclidean distance matrix  has [[Rank (linear algebra)|rank]] less than or equal to ''m+2''. If the points <math>x_1,x_2,\ldots,x_n</math> are in [[General_position| general position]], the rank is exactly ''m+2''.
 
==See also==
* [[Adjacency matrix]]
* [[Distance matrix]]
* [[Euclidean random matrix]]
 
==References==
* {{cite book | author=James E. Gentle | title=Matrix Algebra: Theory, Computations, and Applications in Statistics | publisher=[[Springer-Verlag]] | date=2007 | isbn=0-387-70872-3 | page=299 }}
 
[[Category:Matrices]]
 
{{geometry-stub}}

Revision as of 23:00, 27 February 2014

Ed is what individuals contact me and my wife doesn't like it at all. Mississippi is the only place I've been residing in but I will have to move in a yr or two. Office supervising is my occupation. To play domino is something I really appreciate doing.

Take a look at my homepage: real psychics; koreanyelp.com,