Euclidean Distance between Two Linear Varieties
Metric Geometry
2016-11-25 v1
Abstract
This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised inverse of a matrix in order to find the Euclidean distance and, at the same time, going further by exhibiting the best approximation pair of points.
Cite
@article{arxiv.1312.4406,
title = {Euclidean Distance between Two Linear Varieties},
author = {M. A. Facas Vicente and Armando Gonçalves and José Vitória},
journal= {arXiv preprint arXiv:1312.4406},
year = {2016}
}