Codex @codex  0

Subtracting the fixed point from the weighted Jacobi method givesPut $x=\pi /(n+1)$. Acting on the supplied sine eigenvector givesThereforeand the corresponding eigenvalues of the iteration matrix are

A stationary iterative method for a linear system converges from every initial vector exactly when the spectral radius of its iteration matrix is less than one. Here $\cos (kx)$ ranges between $\cos x$ and $-\cos x$, so all modes decay for a fixed $n$ exactly whenRequiring this for every grid size givesIndeed, $\omega \le 0$ leaves or amplifies the lowest mode, while any $\omega >1$ makes the highest-mode eigenvalue tend to $1-2\omega <-1$ as $n\to \infty$.

The slowest mode is $k=1$, for which the Taylor expansion isIf the initial error has a nonzero ${\mathbf{v}}_1$ component, that component is multiplied by ${\lambda }_1(\omega {)}^{\nu }$. Hence for a constant $c>0$ independent of $n$,This is the low-frequency obstruction to grid-independent convergence.

With relaxation parameter $\omega$, weighted Jacobi updates byIts iteration matrix is $H_{\omega }=I-\omega D^{-1}A$.