I have the following matrix arising when I tried to discretize the Green function， now to show the convergence of my algorithm I need to find the eigenvalues of the matrix $G$ and show it has absolute value less than 1 for certain choices of $N$.

Note that the explicit formula for entry $(i,j)$ is $-i(N+1-j)$ when $i\le j$ and it is symmetric, so we can get the formulas for $i>j$ by interchanging $i$ and $j$ in the $i\le j$ case.

Any one has any ideas about how to find the analytical representation of eigenvalues of the matrix $G$, i,e, the eigenvalues represented by $N$? Thank you so much for any help!

$\begin{pmatrix} - N & - N + 1 & -N+2 & -N+3 &\ldots & 1(-2) & 1(-1) \\ - N + 1 & 2( - N + 1) & 2(-N+2) & 2(-N+3) &\ddots & 2(-2) & 2(-1) \\ - N + 2 & 2( - N + 2) & 3(-N+2) & 3(-N+3) &\ddots & 3(-2) & 3(-1) \\ - N + 3 & 2( - N + 3) & 3(-N+3) & 4(-N+3) &\ddots & 4(-2) & 4(-1) \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ - 2 & 2(-2) & 3(-2) & 4(-2) &\ddots & ( - 1 + N)( - 2) & ( - 1 + N)( - 1) \\ - 1 & 2(-1) & 3(-1) & 4(-1) &\ldots & ( - 1 + N)( - 1) & N( - 1) \\ \end{pmatrix}$