Software for computing eigenvalue bounds for iterative subspace matrix methods. (English) Zbl 1196.15007

Summary: This paper describes software for computing eigenvalue bounds to the standard and generalized hermitian eigenvalue problem as described by Y. Zhou, R. Shepard and M. Minkoff [Comput. Phys. Comm. 167, 90–102 (2005; Zbl 1196.15017)]. The software discussed in this manuscript applies to any subspace method, including Lanczos, Davidson, SPAM, Generalized Davidson Inverse Iteration, Jacobi-Davidson, and the Generalized Jacobi-Davidson methods, and it is applicable to either outer or inner eigenvalues. This software can be applied during the subspace iterations in order to truncate the iterative process and to avoid unnecessary effort when converging specific eigenvalues to a required target accuracy, and it can be applied to the final set of Ritz values to assess the accuracy of the converged results.


15-04 Software, source code, etc. for problems pertaining to linear algebra
15A42 Inequalities involving eigenvalues and eigenvectors


Zbl 1196.15017


Full Text: DOI


[1] Zhou, Y.; Shepard, R.; Minkoff, M., Computing eigenvalue bounds for iterative subspace matrix methods, Comput. Phys. Comm., 167, 90-102 (2005) · Zbl 1196.15017
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.