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
The Cayley Method and the Inverse Eigenvalue Problem for Toeplitz Matrices
โ Scribed by F. Diele; I. Sgura
- Book ID
- 110413319
- Publisher
- Springer Netherlands
- Year
- 2002
- Tongue
- English
- Weight
- 222 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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