The Jacobi method is one of the oldest numerical algorithms for finding the eigenvalues of a real symmetric matrix. It was proposed by Carl Gustav Jacob Jacobi in 1846, more than a century before the modern QR algorithm.
Its central idea comes from a simple observation: the eigenvalues of a diagonal matrix can be read off at a glance—they are the entries on the diagonal. So if a matrix can be “reduced” step by step to diagonal form by a sequence of similarity transformations that leave the eigenvalues unchanged, the problem is solved.
Recall the spectral theorem of Chapter 9: a real symmetric matrix A is always orthogonally diagonalizable, that is, there exists an orthogonal matrix Q such that
The Jacobi method approximates this Q constructively—at each step it chooses a plane rotation (a Givens rotation) Gij that eliminates one off-diagonal entry aij exactly, while guaranteeing that the overall “off-diagonal energy”
decreases strictly monotonically. Although after one entry is eliminated, other entries in the same row and column may be disturbed and no longer be zero, we will see in the exercise below that each rotation reduces off2 by exactly 2aij2; this “conservation of energy” viewpoint is the key to analyzing the convergence of the algorithm.