文摘
We present an hp-adaptive continuous Galerkin (hp-CG) method for approximating eigenvalues of elliptic operators, and demonstrate its utility on a collection of benchmark problems having features seen in many important practical applications—for example, high-contrast discontinuous coefficients giving rise to eigenfunctions with reduced regularity. In this continuation of our benchmark study, we concentrate on providing reliability estimates for assessing eigenfunction/invariant subspace error. In particular, we use these estimates to justify the observed robustness of eigenvalue error estimates in the presence of repeated or clustered eigenvalues. We also indicate a means for obtaining efficiency estimates from the available efficiency estimates for the associated boundary value (source) problem. As in the first part of the paper we provide extensive numerical tests for comparison with other high-order methods and also extend the list of analyzed benchmark problems.