In this study, we investigate the upper- and lower-bound approximations of numerical eigenvalues derived by weak Galerkin spectral element methods on arbitrary convex quadrilateral meshes for the Laplace eigenvalue problem. Firstly, the Piola transformation is employed to construct the approximation space for weak gradients on each convex quadrilateral element, while a one-to-one mapping is used to establish the approximation space for weak functions. Subsequently, based on the weak Galerkin spectral element approximation space defined on convex quadrilateral meshes, a Galerkin approximation scheme is formulated, and its well-posedness is then analyzed. Furthermore, numerical experiments are performed on arbitrary convex quadrilateral meshes of the square and L-shaped domains to explore the upper- and lower-bound approximations of numerical eigenvalues. Numerical findings indicate that the presented method not only obtains optimal orders of convergence with respect to both the mesh size and the polynomial degree, but also provides upper- and lower-bound approximations for the reference eigenvalues by proper choices of polynomial degrees in approximation spaces and parameters of the approximation scheme in both h-version and p-version weak Galerkin spectral element methods. This study offers new perspectives and methodologies for the high-precision numerical solution of eigenvalue problems in elliptic equations.
Xu et al. (Fri,) studied this question.