Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646202 | Applied Numerical Mathematics | 2007 | 5 Pages |
Abstract
Given an m×n matrix A, n Euclidean distances, those from each column to the space spanned by the remaining columns of A, are considered. An elegant relationship between A, these Euclidean distances, and the solutions of n simple linear least squares problems arising from A is derived. When A has full column rank, from this a useful expression for these Euclidean distances is immediately obtained. The theory is then used to greatly improve the efficiency of an algorithm used in communications.
Related Topics
Physical Sciences and Engineering
Mathematics
Computational Mathematics