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
✦ LIBER ✦
A note on “Methods for constructing distance matrices and the inverse eigenvalue problem”
✍ Scribed by Gašper Jaklič; Jolanda Modic
- Book ID
- 116714160
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 281 KB
- Volume
- 437
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Methods for constructing distance matric
✍
Thomas L. Hayden; Robert Reams; James Wells
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 143 KB
A note on the inverse eigenvalue problem
✍
Maozhong Fang
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 84 KB
A Note on the Symmetric Recursive Invers
✍
Loewy, Raphael; Mehrmann, Volker
📂
Article
📅
2003
🏛
Society for Industrial and Applied Mathematics
🌐
English
⚖ 121 KB
The Cayley Method and the Inverse Eigenv
✍
F. Diele; I. Sgura
📂
Article
📅
2002
🏛
Springer Netherlands
🌐
English
⚖ 222 KB
A new algorithm for an inverse eigenvalu
✍
Ying-hong Xu; Er-xiong Jiang
📂
Article
📅
2008
🏛
Chinese Electronic Periodical Services
🌐
English
⚖ 146 KB
Isospectral flows and the inverse eigenv
✍
Fasma Diele; Ivonne Sgura
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 248 KB
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