Mesh independence of the generalized Davidson algorithm

Abstract We give conditions under which the generalized Davidson algorithm for eigenvalue computations is mesh-independent. In this case mesh-independence means that the iteration statistics (residual norms, convergence rates, for example) of a sequence of discretizations of a problem in a Banach space converge the statistics for the infinite-dimensional problem. We illustrate the result with several numerical examples.