Software for computing eigenvalue bounds for iterative subspace matrix methods

Published: 15-07-2005| Version 1 | DOI: 10.17632/3sffbzhwvv.1
Ron Shepard,
Michael Minkoff,
Yunkai Zhou


Abstract This paper describes software for computing eigenvalue bounds to the standard and generalized hermitian eigenvalue problem as described in [Y. Zhou, R. Shepard, M. Minkoff, Computing eigenvalue bounds for iterative subspace matrix methods, Comput. Phys. Comm. 167 (2005) 90–102]. 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... Title of program: SUBROUTINE BOUNDS_OPT Catalogue Id: ADVE_v1_0 Nature of problem The computational solution of eigenvalue problems using iterative subspace methods has widespread applications in the physical sciences and engineering as well as other areas of mathematical modeling (economics, social sciences, etc.). The accuracy of the solution of such problems and the utility of those errors is a fundamental problem that is of importance in order to provide the modeler with information of the reliability of the computational results. Such applications include using these bou ... Versions of this program held in the CPC repository in Mendeley Data ADVE_v1_0; SUBROUTINE BOUNDS_OPT; 10.1016/j.cpc.2005.01.019 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)