It can easy be shown by induction that the determinant of the $(N-1)\times (N-1)$ matrix
$$\begin{pmatrix} 
2 & -1 & & \\ 
-1 & 2 & \ddots & \\ 
& \ddots & \ddots & -1\\ 
& & -1 & 2 
\end{pmatrix}$$
equals $N$. (Up to a factor) this matrix corresponds to the representing matrix of the discrete Laplacian on an interval with Dirichlet boundary conditions, on an equidistant partition.


Now it the partition is not equidistant, say it is $0 = \tau\_0 < \tau\_1 < \dots < \tau\_N$ with increments $\Delta\_j := \tau\_j - \tau\_{j-1}$, then (up to a factor) we end up with the matrix
$$\begin{pmatrix} 
\Delta\_1 + \Delta\_2 & -\Delta\_2 & & \\ 
-\Delta\_2 & \Delta\_2 + \Delta\_3 & \ddots & \\ 
& \ddots & \ddots & -\Delta\_{N-1}\\ 
& & -\Delta\_{N-1} & \Delta\_{N-1}+\Delta\_N 
\end{pmatrix}.$$
Is the determinant of this matrix still explicitly computable? If not, can we at least compute some (suitably normalized) limit of the determinant as the mesh of the partition goes to zero?


\edit: user35593 answered in the comments that the determinant is equal to
$$ \prod\_{j=1}^N {\Delta\_j}\sum\_{i=1}^N\frac{1}{\Delta\_i},$$
which is indeed easy to check by induction. Thank you very much!



Determinant of discrete Laplacian
You already have the answer and proof, so let me just use this post to advertise some basic graph theory :). Take a cycle graph on $N$ vertices, and weigh each edge by $\Delta\_i$, $i=1,2,\dots N$. Then your matrix is a cofactor of the [Laplacian matrix](https://en.wikipedia.org/wiki/Laplacian_matrix) of this graph. By [Kirchhoff's theorem](https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem), this is the (weighted) count of the spanning trees of your graph. An $N$-cycle has $N$ spanning trees, and their weights are $\frac{\prod\_{i=1}^N \Delta\_i}{\Delta\_j}$, when you omit the $j$th edge. Therefore the cofactor is equal to $\prod\_{i=1}^N \Delta\_i \left(\sum\_{j=1}^N\frac{1}{\Delta\_j}\right)$.


