|
2 | added 18 characters in body | ||
|
Let $T\in \mathbb{R}^{n\times n}$ be a symmetric tridiagonal matrix having the off--diagonal entries equal to -1. The diagonal entries are all positive, $a_i>0$, $i=\overline{1,n}$, and there exist $j$ and $k$, $j\neq k$ such that $a_j=a_k\leq 1$. $a_j$ and $a_k$ are the smallest diagonal entries. I'm interested under what supplemental conditions can such a matrix have the smallest eigenvalue equal to 0? |
||||
|
|
1 |
|
||
0 eigenvalue for a symmetric tridiagonal matrixLet $T\in \mathbb{R}^{n\times n}$ be a symmetric tridiagonal matrix having the off--diagonal entries equal to -1. The diagonal entries are all positive, $a_i>0$, $i=\overline{1,n}$, and there exist $j$ and $k$, $j\neq k$ such that $a_j=a_k\leq 1$. $a_j$ and $a_k$ are the smallest diagonal entries. I'm interested under what supplemental conditions can such a matrix have the eigenvalue 0?
|
||||
