𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rank distance problem for pairs of matrices

✍ Scribed by Dodig, Marija

Book ID
118051794
Publisher
Taylor and Francis Group
Year
2012
Tongue
English
Weight
142 KB
Volume
61
Category
Article
ISSN
0308-1087

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the nonnegative rank of Euclidean dis
On the nonnegative rank of Euclidean distance matrices
✍ Matthew M. Lin; Moody T. Chu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 167 KB

The Euclidean distance matrix for distinct points in ℝ is generically of rank + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case = 1 is generically .

Orthogonality of matrices and some dista
Orthogonality of matrices and some distance problems
✍ Rajendra Bhatia; Peter Ε emrl πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 348 KB

If A and B are matrices such that IIA + zBII ~ IIA II for all complex numbers z, then A is said to be orthogonal to B. We find necessary and sufficient conditions for this to be the case. Some applications and generalisations are also discussed.

Methods for constructing distance matric
Methods for constructing distance matrices and the inverse eigenvalue problem
✍ Thomas L. Hayden; Robert Reams; James Wells πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 143 KB

Let h 1 P R kΓ‚k and h 2 P R lΓ‚l be two distance matrices. We provide necessary conditions on P R kΓ‚l in order that be a distance matrix. We then show that it is always possible to border an n Γ‚ n distance matrix, with certain scalar multiples of its Perron eigenvector, to construct an n 1 Γ‚ n 1 dis

Inertia theorems for pairs of matrices
Inertia theorems for pairs of matrices
✍ Cristina Ferreira; Fernando C. Silva πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 251 KB