An improved parallel Jacobi method for diagonalizing a symmetric matrix
A parallel variant of the Jacobi algorithm for the computation of eigenvalues of a symmetric matrix is described. It involves a simplified search for a large pivot element, and is faster than both the classical (maximum pivot) and cyclical variants. Still it is not in any case faster than the QR method, so as the authors rightly state, it is mainly of interest to the little group of Jacobi afficionados, of which the present reviewer is one.
scientific article; zbMATH DE number 4026667