I have a claim I’ve been conjecturing. Not sure if it’s true or not. Context: I’m doing some calculations with finite difference schemes.
Say I have the following real $n \times n$ tridiagonal matrix $A$:
$$ \begin{bmatrix} \;\;\;2 & -1 & & &\\ -1 & \;\;\;2 & -1 & &\\ & \ddots & \ddots & \ddots\\ & & -1 & \;\;\;2 & -1 \\ & & & -1 & \;\;\;2 \end{bmatrix} $$
Does the following system have a unique solution?
$A\mathbf{U}=\mathbf{F}$ where $\mathbf{U} = \begin{bmatrix} U_{1}\\ U_{2}\\ \vdots\\ \\ U_{n} \end{bmatrix}$ and $\mathbf{F}$ is just a real vector of dimension $n$.
Observations:
Other than the fact it’s tridiagonal, I noticed that it is diagonally dominant. I also think I can compute an $LU$ factorization, but I’m not sure how that would help. Any directions?
Rodrigo is perfectly right, but we may prove that $A_n$ (the $n\times n$ matrix with such a structure) is invertible by simply computing its determinant through a recursive approach. An expansion along the last row gives: $$\det A_n = 2\cdot\det A_{n-1}-\det A_{n-2} \tag{1}$$ hence: $$ \det A_n = Cn +D \tag{2}$$ and since $\det A_1=2$ and $\det A_2=3$, $\color{red}{\det A_n = n+1\neq 0}$ and $A_n$ is invertible.
$(2)$ follows from the fact that the characteristic polynomial of the sequence $\{\det A_n\}_{n\geq 1}$ is $p(x)=(x-1)^2$ by $(1)$.