A Jacobi-Type Eigensolver for Diagonally Dominant Symmetric Matrices
classification
🧮 math.NA
cs.NA
keywords
diagonallydominanteigenpairiterationjacobi-typematricesmatrixprocedure
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.