An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations

Abstract

An a posteriori verification method is proposed for the generalized real-symmetric eigenvalue problem and is applied to densely clustered eigenvalue problems in large-scale electronic state calculations. The proposed method is realized by a two-stage process in which the approximate solution is computed by existing numerical libraries and is then verified in a moderate computational time. The procedure returns intervals containing one exact eigenvalue in each interval. Test calculations were carried out for organic device materials, and the verification method confirms that all exact eigenvalues are well separated in the obtained intervals. This verification method will be integrated into EigenKernel (https://github.com/eigenkernel/), which is middleware for various parallel solvers for the generalized eigenvalue problem. Such an a posteriori verification method will be important in future computational science. (c)

The Essentials of verified numerical computations, rounding error analyses, interval arithmetic, and error-free transformations

“…If x 1 and x 2 are approximate eigenvalues of a matrix and the circles do not overlap, then the two eigenvalues are not multiple. Guaranteeing that there are no multiple eigenvalues is important for large-scale electronic state calculations [5].…”

Fast verification for the Perron pair of an irreducible nonnegative matrix

“…There are many verification methods for eigenvalues and eigenvectors. For all eigenvalues, see [9,10,11,12,13,14,15]. For all eigenpairs, see [16,17,18].…”