On the least squares distance between affine subspaces (Q1914233)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the least squares distance between affine subspaces |
scientific article; zbMATH DE number 885072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the least squares distance between affine subspaces |
scientific article; zbMATH DE number 885072 |
Statements
On the least squares distance between affine subspaces (English)
0 references
4 December 1996
0 references
Suppose that two affine subspaces \(L_1, L_2\) of \(\mathbb{R}^n\) are given by consistent systems of linear equations \(Ax=a\) and \(By=b\), respectively. In contrast to an earlier paper [\textit{A. M. DuPré} and \textit{S. Kass}, Linear Algebra Appl. 171, 99-107 (1992; Zbl 0781.51003)] no assumptions are made on the rank of \(A\) or \(B\). Loosely speaking the authors establish a formula for the Euclidean distance of \(L_1, L_2\) in terms of the given vectors \(a,b\), the given matrices \(A,B\), generalized inverses of these matrices (not necessarily the Moore-Penrose inverses) and some extra matrix which is subject to a certain condition involving \(A\) and \(B\). Moreover, the set of feet of the perpendicular bisectors of \(L_1\) and \(L_2\) are described in a similar manner.
0 references
distance of flats
0 references
affine subspaces
0 references
systems of linear equations
0 references
Euclidean distance
0 references
generalized inverses
0 references
Moore-Penrose inverses
0 references
0 references