Circular points at infinity: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>David Eppstein
en>Rgdboer
→‎References: Sommerville
 
(One intermediate revision by one other user not shown)
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
I would like to introduce myself to you, I am Jayson Simcox but I don't like when individuals use my complete name. Office supervising is where my primary income arrives  [http://cpacs.org/index.php?document_srl=90091&mid=board_zTGg26 free psychic] from but I've always wanted my personal company. For a while I've been in Alaska but I will have to move in a year or two. What me and my family members adore is bungee leaping but I've been using  free psychic reading ([http://mybrandcp.com/xe/board_XmDx25/107997 http://mybrandcp.com/xe/board_XmDx25/107997]) on new issues lately.<br><br>My site: free psychic reading ([http://www.zavodpm.ru/blogs/glennmusserrvji/14565-great-hobby-advice-assist-allow-you-get-going www.zavodpm.ru])
 
:<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}}

Latest revision as of 22:55, 12 June 2014

I would like to introduce myself to you, I am Jayson Simcox but I don't like when individuals use my complete name. Office supervising is where my primary income arrives free psychic from but I've always wanted my personal company. For a while I've been in Alaska but I will have to move in a year or two. What me and my family members adore is bungee leaping but I've been using free psychic reading (http://mybrandcp.com/xe/board_XmDx25/107997) on new issues lately.

My site: free psychic reading (www.zavodpm.ru)