Methods for constructing distance matrices and the inverse eigenvalue problem
โ Scribed by Thomas L. Hayden; Robert Reams; James Wells
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 143 KB
- Volume
- 295
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
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 distance matrix. We also give necessary and sucient conditions for two principal distance matrix blocks h 1 and h 2 be used to form a distance matrix as above, where Z is a scalar multiple of a rank one matrix, formed from their Perron eigenvectors. Finally, we solve the inverse eigenvalue problem for distance matrices in certain special cases, including n 3Y 4Y 5Y 6, any n for which there exists a Hadamard matrix, and some other cases.
๐ SIMILAR VOLUMES
The inverse eigenvalue problem for Toeplitz matrices (ITEP), concerning the reconstruction of a symmetric Toeplitz matrix from prescribed spectral data, is considered. To numerically construct such a matrix the approach introduced by Chu in (SIAM Rev. 40(1) (1998) 1-39) is followed. He proposed to s
For a positive integer n and for a real number s, let s n denote the set of all n ร n real matrices whose rows and columns have sum s. In this note, by an explicit constructive method, we prove the following. (i) Given any real n-tuple = (ฮป 1 , ฮป 2 , . . . , ฮป n ) T , there exists a symmetric matri