Abstract
We consider the following inverse eigenvalue problem: to construct a symmetrical tridiagonal matrix from the minimal and maximal eigenvalues of all its leading principal submatrices. We give a necessary and sufficient condition for the existence of such a matrix and for the existence of a nonnegative symmetrical tridiagonal matrix. Our results are constructive, in the sense that they generate an algorithmic procedure to construct the matrix.
| Original language | English |
|---|---|
| Pages (from-to) | 699-708 |
| Number of pages | 10 |
| Journal | Computers and Mathematics with Applications |
| Volume | 54 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 2007 |
| Externally published | Yes |
Keywords
- Matrix inverse eigenvalue problem
- Symmetrical tridiagonal matrices
Fingerprint
Dive into the research topics of 'An inverse eigenvalue problem for symmetrical tridiagonal matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver