All Questions
6 questions
4
votes
1
answer
496
views
Is there a standard measure for how close a matrix is to being a distance metric ?
Suppose I have a square n*n, symmetric matrix with positive elements and zero diagonal.
For this to be considered a proper distance metric between n points, the triangle inequality needs to be ...
4
votes
2
answers
2k
views
How to efficiently compute the generalized cross product?
It's possible to extend the well known cross product between two vectors in $\mathbb{R}^3$ to $n-1$ vectors in $\mathbb{R}^n$.
Let $\vec{v_1}, \vec{v_2}, \dots, \vec{v}_{n-1} \in \mathbb{R}^n$ and $\...
3
votes
1
answer
1k
views
Given a distance matrix is there an isometric embedding?
I have distance matrix $D$ that was calculated by some distance (non-Euclidean but satisfying distance requirements). Is there a set of points in some Euclidean space such that it generates matrix of ...
3
votes
0
answers
526
views
Cavalieri's principle and inversion of the Vandermonde matrix
There are many examples on the Web of the use of Cavalieri's principle in determining areas and volumes of 2-D and 3-D geometrical figures. The Wikipedia link uses the principle as both a proof and ...
2
votes
3
answers
355
views
Geometric means of matrices beyond the positive definite cone
Recently a lot of work has been done on geometric means of positive definite matrices (see here and here for example). Has anyone extended this concept to larger sets of matrices (copositive, for ...
2
votes
0
answers
233
views
Do you know this formula for the scalar product in barycentric coordinates?
I've found a formula for a scalar product in barycentric coordinates which I think is pretty cool. I hope that it's new. Is it?
Suppose that you have points $x_1,\dots,x_n$ sitting in general position ...