arXiv · 1312.4406
Euclidean Distance between Two Linear Varieties
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.
Explore related subjects
Keep this discovery
M. A. Facas Vicente, Armando Gonçalves, José Vitória. 2013-12-16. Euclidean Distance between Two Linear Varieties. https://arxiv.org/abs/1312.4406
Cite the original work for its findings. Save a collection to share your selection of sources.