A fast iterative algorithm for near-diagonal eigenvalue problems

by   Maseim Kenmoe, et al.

We introduce a novel iterative eigenvalue algorithm for near-diagonal matrices termed iterative perturbative theory (IPT). Built upon a "perturbative" partitioning of the matrix into diagonal and off-diagonal parts, IPT has the complexity of one matrix-vector (when one eigenpair is requested) or one matrix-matrix multiplication (when all eigenpairs are requested) per iteration. Thanks to the high parallelism of these basic linear algebra operations, we obtain excellent performance on multi-core processors and GPUs, with large speed-ups over standard methods (up to ∼50x with respect to LAPACK and ARPACK, ∼5x with respect to Davidson). When off-diagonal elements are comparable to eigengaps, IPT diverges like the quadratic map outside the Mandelbrot set; for such general matrices IPT can nevertheless be used to refine low-precision eigenvectors obtained by other methods. We give sufficient conditions for linear convergence and demonstrate performance on dense and sparse test matrices.



page 21


A sparse approximate inverse for triangular matrices based on Jacobi iteration

In this paper, we propose a sparse approximate inverse for triangular ma...

Fast computation of optimal damping parameters for linear vibrational systems

We formulate the quadratic eigenvalue problem underlying the mathematica...

Dynamical perturbation theory for eigenvalue problems

Many problems in physics, chemistry and other fields are perturbative in...

Diagonal Preconditioning: Theory and Algorithms

Diagonal preconditioning has been a staple technique in optimization and...

An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units

Large-scale sparse precision matrix estimation has attracted wide intere...

Constructing the Field of Values of Decomposable and General Matrices

This paper describes and develops a fast and accurate algorithm that com...

Simple exponential acceleration of the power iteration algorithm

Many real-world problems rely on finding eigenvalues and eigenvectors of...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.