A Jacobi-Type Eigensolver for Diagonally Dominant Symmetric Matrices

This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix.

For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the matrix is significantly dominated.

The cost per iteration is generally quadratic.

Therefore, the proposed procedure can compute an approximation of the desired eigenpair in quadratic time.