Suppose I have the symmetric tridiagonal matrix:


$ \begin{pmatrix}
a & b\_{1} & 0 & ... & 0 \\\ 
b\_{1} & a & b\_{2} & & ... \\\
0 & b\_{2} & a & ... & 0 \\\ 
... & & ... & & b\_{n-1} \\\ 
0 & ... & 0 & b\_{n-1} & a
\end{pmatrix} $


All of the entries can be taken to be positive real numbers and all of the $a\_{i}$ are equal. I know that when the $b\_{i}$'s are equal (the matrix is uniform), there are closed-form expressions for the eigenvalues and eigenvectors in terms of cosine and sine functions. Additionally, I know of the recurrence relation:


$det(A\_{n}) = a\cdot det(A\_{n-1}) - b\_{n-1}^{2}\cdot det(A\_{n-2})$


Additionally, since my matrix is real-symmetric, I know that its eigenvalues are real.


Is there anything else I can determine about the eigenvalues? Furthermore, is there a closed-form expression for them?



Eigenvalues of Symmetric Tridiagonal Matrices
The type of matrix you have written down is called Jacobi matrix and people are still discovering new things about them basically their properties fill entire bookcases at a mathematics library. One of the reasons is the connection to orthogonal polynomials. Basically, if $\{p\_n(x)\}\_{n\geq 0}$ is a family of orthogonal polynomials, then they obey a recursion relation of the form
$$
 b\_n p\_{n+1}(x) + (a\_n- x) p\_n(x) + b\_{n-1} p\_{n-1}(x) = 0.
$$
You should be able to recognize the form of your matrix from this.


As far as general properties of the eigenvalues, let me mention two:


1. The eigenvalues are simple. In fact one has $\lambda\_j - \lambda\_{j-1} \geq e^{-c n}$, where $c$ is some constant that depends on the $b\_j$.
2. The eigenvalues of $A$ and $A\_{n-1}$ interlace.


