BOUNDS_OPT

Software for computing eigenvalue bounds for iterative subspace matrix methods. This paper describes software for computing eigenvalue bounds to the standard and generalized hermitian eigenvalue problem as described by {it Y. Zhou, R. Shepard} and {it 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.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element


References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Shepard, Ron; Minkoff, Michael; Zhou, Yunkai: Software for computing eigenvalue bounds for iterative subspace matrix methods (2005)