In this paper
AbstractIntroductionScaling property and the variational formulationScaling propertyA variational (weak) formulationSpectral and spectral-element methodsA Galerkin approximationSpectral methods for simple geometriesSpectral-element methods for complex geometriesAccuracy testAccuracy in 1DAccuracy in 2DNumerical studies on the Robin-to-Neumann (RtN) gapsThe RtN gaps in 1DThe RtN gaps in 2DThe RtN gaps in 3DConclusionAcknowledgmentsReferencesWorksMathematics
A spectral-element method for computing many eigenvalues and their asymptotics of the Schrödinger operator with Robin boundary condition
Abstract
We propose spectral and spectral-element methods for accurately computing many eigenvalues of the Schrödinger operator with Robin boundary condition on simple and complex geometries, respectively. Due to their spectral-type accuracy in approximating those eigenfunctions corresponding to high-index eigenvalues, which are usually highly oscillatory, the proposed approaches have excellent resolution in computing thousands of eigenvalues accurately and efficiently with the resolution property that the number of eigenvalues with reasonable accuracy is proportional to the number of degrees of freedom. Using a standard HPC node with 128 GB of memory, we can obtain numerically more than 5,000 reliable eigenvalues with relative errors below for different complex domains in two dimensions (2D). Based on these computed eigenvalues, we first confirm some theoretical results on the Robin-to-Neumann (RtN) gaps of the Laplacian operator in 2D, which were recently studied by Rudnick et al. [Comm. Math. Phys. 388 (2021)]. Then we systematically study the RtN gaps of the Schrödinger operator and their convergence rates. Based on our extensive numerical results, we formulate a unified conjecture on the cumulative averages of the RtN gaps of the Schrödinger operator.
Introduction
Consider the following eigenvalue problem of the Schrödinger operator with Robin boundary condition, i.e. find and a real-valued function such that
where is the spatial coordinate, is a connected bounded domain with piecewise smooth boundary, is the unit outward normal vector, is a given constant, and is a given real-valued function which models external fields, trapping effects, impurities or material inhomogeneities.
The Schrödinger operator is one of the most fundamental operators in quantum mechanics, spectral theory and mathematical physics [4, 5, 16, 35]. The eigenvalues of the Schrödinger operator represent the admissible energy levels of a quantum system, while the corresponding eigenfunctions describe the associated stationary states or wave modes. When , the boundary condition (2) collapses to the homogeneous Neumann boundary condition; and when , it collapses to the homogeneous Dirichlet boundary condition [7]. In fact, different boundary conditions encode different interactions between eigenfunctions and the boundary: (i) the homogeneous Dirichlet boundary condition corresponds to perfectly confining or impenetrable walls, (ii) the homogeneous Neumann boundary condition describes zero-flux or reflecting boundaries, and (iii) the Robin boundary condition models more general boundary interactions, such as partially reflecting walls, surface potentials and impedance-type effects [13]. The Schrödinger operator (1) with different boundary conditions leads to different spectra and distinct physical interpretations. Thus understanding the eigenvalues of the Schrödinger operator (1) with either homogeneous Dirichlet or homogeneous Neumann or Robin boundary condition is important in quantum confinement, wave propagation, resonant modes, spectral geometry and related problems in mathematical physics.
Without loss of generality, we assume that is non-negative, i.e. for . Since the self-adjoint Schrödinger operator with the Robin boundary condition has compact resolvent, its spectrum is real and discrete [2]. We can rank (or order) all eigenvalues (counting multiplicities) (with the superscript referring to the constant in the Robin boundary condition) of (1)-(2) as
where the number of times that an eigenvalue of (1)-(2) appears in the above sequence (3) is the same as its algebraic multiplicity. Here we adopt and to denote the corresponding eigenvalues of the Schrödinger operator (1) with homogeneous Neumann ( in (2)) and homogeneous Dirichlet ( in (2)) boundary conditions, respectively. Define the Robin-to-Neumann (RtN) gaps of the Schrödinger operator (1)-(2) as
and define the cumulative averages of the RtN gaps as
When in (1), the Schrödinger operator collapses to the Laplacian operator. In this case, under suitable regularity assumptions on the domain , for any fixed , one has [7, 26]
In addition, when the domain is a simple geometry, all the eigenvalues of (1)-(2) can be obtained explicitly. Specifically, in one dimension (1D), e.g. taking , and in (1)-(2), all the eigenvalues are given as [15]
for the Neumann boundary condition, i.e. ,
for the Dirichlet boundary condition, i.e. ,
for the Robin boundary condition, i.e. ,
where, when is odd, is the unique solution in of the nonlinear equation , and; when is even, it is the unique solution in of the nonlinear equation . The first case in (9) is separated because the first Robin eigenvalue bifurcates from the zero Neumann eigenvalue.
Combining (7), (8) and (9), (6) is confirmed immediately in this special case. In addition, for any , we can get
In two dimensions (2D), e.g. taking , and to be a connected bounded domain with piecewise smooth boundary in (1.1)-(1.2), Rudnick et al. [31] studied the RtN gaps and their cumulative averages. Based on analytical and numerical results for rectangles, the hemisphere, and the equilateral triangle [28, 29, 30], for each fixed , they proved the following result [31]
where and denote the area of and the length of , respectively. The above formula (11) reveals an interesting connection between an algebraic spectral quantity, i.e. the cumulative averages of the RtN gaps, and the geometric quantities of the domain , i.e., its area and boundary length.
In general domains, especially for the Schrödinger operator with nontrivial potentials, exact eigenvalues are rarely available, thus efficient and accurate as well as high resolution numerical approximation is necessary and important as well as challenging. In fact, the finite element method provides a mature and geometrically flexible framework, supported by general Galerkin spectral approximation theory [1, 2, 6]. Most concrete algorithms and analyses have been developed for computing the eigenvalues of the Schrödinger operator with homogeneous Dirichlet boundary condition, including adaptive eigensolvers [9, 11, 12, 40], two-grid schemes [21, 39, 41], multilevel correction methods [24], and rigorous error estimates and eigenvalue bounds [10, 22]. For computing the eigenvalues of the Schrödinger operator with homogeneous Neumann condition, finite element error analysis on curved domains was given in [20]. For computing the eigenvalues of the Schrödinger operator with Robin boundary condition, far fewer results are available in the literature [25, 36]. Recently, machine learning methods have also been developed for computing eigenvalues of Schrödinger and fractional Schrödinger operators [17, 18]. Specifically, all these existing works focus mainly on algorithmic and theoretical analysis, or on a relatively small number of low-index eigenpairs.
In order to study the Weyl law on the asymptotics of the eigenvalues of the Schrödinger operator with Robin boundary condition (1.1)-(1.2) and the asymptotics of the Robin-to-Neumann (RtN) gaps in (1.4) and (1.5), one needs to compute numerically thousands of eigenvalues with high accuracy. To achieve this very challenging computational task, under a fixed number of degrees of freedom (DOFs), low-order finite element or finite difference discretizations typically resolve only a limited portion of the spectrum [3, 32, 42], and thus they cannot handle it successfully. When the domain is a simple geometry, e.g. a rectangle or a disc in 2D, and a cube or a ball in 3D, spectral methods can provide a much larger range of accurate high-index eigenvalues with the resolution of the number of computed eigenvalues being proportional to the degrees of freedom of the corresponding discretization [3, 19, 23, 38, 42]. In contrast, when the domain is complicated, spectral methods cannot be extended directly. As we know, spectral-element methods can address this geometric limitation by combining high-order spectral approximation with element-wise decomposition and geometric mappings [14, 27, 34]. Representative applications to eigenvalue problems include the Schrödinger operator with singular potentials and homogeneous Dirichlet boundary condition [23, 37], and the Stokes eigenvalue problems with homogeneous Dirichlet boundary condition [33].
To the best of our knowledge, efficient and accurate numerical methods for computing many eigenvalues of the Schrödinger operator with Robin boundary condition are very limited in the literature. The purpose of this paper is: (i) to develop spectral and spectral-element methods for accurately computing many eigenvalues of the Schrödinger operator with Robin boundary condition on simple and complex geometries, respectively; and (ii) to adopt the proposed numerical method for obtaining numerically more than 5,000 reliable eigenvalues with relative errors below for different complex domains in two dimensions (2D) using a standard HPC node with 128 GB of memory and thus to study numerically the Robin-to-Neumann gaps and their asymptotics. Specifically, based on our extensive numerical results and observations, we speculate the following:
RtN Gap Conjecture (Robin-to-Neumann gaps of the Schrödinger operator (1.1)-(1.2)) Assume that is a connected bounded domain with piecewise smooth boundary and . For any , we have
In addition, when and , we also have
The rest of the paper is organized as follows. In Section 2, we introduce the scaling property and the variational formulation of the Schrödinger eigenvalue problem (1.1)-(1.2). In Section 3, we describe the spectral and spectral-element methods for solving the problem (1.1)-(1.2) on simple and complex geometries, respectively. Section 4 is devoted to accuracy tests and comparisons of different combinations of the number of sub-elements and the polynomial degree of basis functions under fixed numbers of DOFs. In Section 5, we investigate the Robin-to-Neumann gaps in 1D, 2D and three dimensions (3D). Finally, some concluding remarks are given in Section 6.
Scaling property and the variational formulation
In this section, we present a scaling property of the Schrödinger eigenvalue problem (1.1)-(1.2) and its variational (weak) formulation.
Scaling property
Denote
Plugging (2.1) into the Schrödinger eigenvalue problem (1.1)-(1.2), we obtain the following Schrödinger eigenvalue problem defined on a bounded domain with unit diameter, i.e. find and a real-valued function such that
Then it is straightforward to have the following lemma:
Lemma 1. Let be an eigenvalue of (2.2)-(2.3) and be the corresponding eigenfunction, than is an eigenvalue of (1.1)-(1.2) and is the corresponding eigenfunction, and the converse also holds.
From this lemma, we can easily obtain that: assume that are all eigenvalues of (2.2)-(2.3), then are all eigenvalues of (1.1)-(1.2) with and .
A variational (weak) formulation
Multiplying a test function in both sides of (1.1) and then integrating over and using integration by parts, we obtain a variational formulation of the problem (1.1)-(1.2) as: find and a real-valued function such that
where
When , then ; and respectively, when , from the trace inequality [8], , we have
Since can be chosen sufficiently small in (2.6), the negative boundary term in can be controlled by . Assume , then the smallest eigenvalue of (2.4) is bounded below and all eigenvalues of (2.4) are discrete. Specifically, from the Rayleigh quotient [6], the smallest eigenvalue is defined as
For any , assume that being the orthonormal eigenfunctions corresponding to the eigenvalues , and define , then from the Rayleigh quotient [6], the next eigenvalue is defined as
where the dimension of the subspace is . Combining eq:2.5, eq:2.7 and (21), we obtain immediately: (i) when , we have
and respectively, (ii) when , we have
Spectral and spectral-element methods
In this section, we briefly introduce the spectral and spectral-element methods for solving the eigenvalue problem (1)-(2) on simple and complex/irregular geometries, respectively. For a more detailed description of the implementation, we refer the reader to Chapter 4 of [34] and Section 4.5 of [14].
A Galerkin approximation
Let be a conforming finite-dimensional subspace with the degree of freedoms (DOFs) as . Then a Galerkin approximation of eq:2.4 reads: find and a real-valued function such that
Assume
Plugging (25) into (24) and taking for respectively, we obtain the following generalized matrix eigenvalue problem
where and are two matrices given by
Then spectral and spectral-element methods can be designed by properly choosing the basis functions , efficiently and accurately evaluating the integrals and , and properly assembling the two matrices and . Based on different domains , we will present details in the next two subsections.
Spectral methods for simple geometries
When the domain is a simple geometry, e.g. an interval in 1D, a rectangle or a disk in 2D, a cube or a ball or a cylinder in 3D, spectral methods can be easily designed for the Galerkin approximation (3.1).
For simplicity of notation, here we only present the spectral method for in 1D. In this case, we adopt the Legendre polynomials to construct the basis in . Define
where denotes the Legendre polynomial of degree [34], then we can construct a subspace with spectral accuracy. Plugging (3.5) into (3.1), (2.5) and (3.4), we obtain the corresponding generalized matrix eigenvalue problem (3.3) with
In practical computations, the above integrals will be further approximated by numerical quadrature (pseudospectral method) [34].
The above spectral method for discretizing the eigenvalue problems (2.4) can be extended straightforwardly to a rectangle or a disk in 2D, and a cube or a ball or a cylinder in 3D, by adopting the standard spectral basis functions in the literature [34].
Spectral-element methods for complex geometries
For complex/irregular geometries in 2D and 3D, we adapt the spectral-element methods. Again, for simplicity of notations, here we only present the spectral-element method for a planar domain in 2D [14]. Extension to 3D is straightforward and the details are omitted here for brevity [14].
In the case of a planar domain in 2D [14], we first decompose the domain into non-overlapping curvilinear quadrilateral elements [14] as , and introduce smooth element maps (cf. Figure 1)

Figure 1. Sketch of coordinate transformation from physical domain to computational domain .
On the reference square , we can use tensor-product Gauss-Lobatto-Legendre nodes and the associated Lagrange basis with the degree of polynomials in each direction up to . The local trial functions on are obtained by composition with . Let and . The local volume is
where
The local mass is
If an edge of lies on the physical boundary , the Robin term adds
where is the corresponding edge of the reference square and is derivative along the tangent direction. Finally, the assembly procedure is as the following: Each element is mapped to the reference square, high-order spectral matrices are computed locally with the appropriate Jacobian and metric factors, boundary-edge contributions are added only on , and the local matrices are assembled by enforcing continuity across neighboring elements. The final algebraic eigenvalue problem is the same as (16), but with a basis adapted to the geometry by element-wise mappings. For more details, we refer to Section 4.5 of [14].
Accuracy test
In this section, we report accuracy of the spectral and spectral-element methods proposed in the previous section for computing the Schrödinger eigenvalue problem eq:1-(15). Let be the degree of freedoms (DOFs) of an approximation, and () be all the eigenvalues of the numerical approximation (24), satisfying (or ranked as)
We adopt the relative errors which are defined as
if , and otherwise we use the absolute error as if . In the case that the eigenvalues are not given analytically, the numerical ‘exact’ eigenvalues are obtained by choosing a sufficient large .
Accuracy in 1D
We take and in (1)-(2). When , all the eigenvalues are given analytically in (7), (8) and (9) for homogeneous Neumann boundary condition, homogeneous Dirichlet boundary condition and Robin boundary condition, respectively [15]. We adopt the spectral method presented in the previous section to solve this problem numerically for obtaining the corresponding eigenvalues.
Figure 2 displays the relative errors of the eigenvalues when for different and DOFs . Figure 3 plots the relative errors of the eigenvalues when for different and DOFs , while the numerical reference solutions are obtained by taking .

Figure 2. Accuracy test in 1D with and in (1.1)-(1.2) for different and : (a) Neumann (), and (b) Robin ().

Figure 3. Accuracy test in 1D with and in (1.1)-(1.2) for different and : (a) Neumann (), and (b) Robin ().
From Figs. 2&3, we can conclude that, with a given DOFs , the proposed spectral method can compute up to approximately eigenvalues with relative errors below (c.f. Figs. 2&3) for the Schrödinger eigenvalue problem (1.1)-(1.2) in 1D. With this kind of resolution capacity, we can obtain numerically the RtN gaps of the Schrödinger operator and their convergence rates in 1D, which will be reported in the next section.
Accuracy in 2D
We take and a unit square or a unit disk in (1.1)-(1.2). When , all the eigenvalues are given analytically under different boundary conditions [15, 31]. When is taken as a unit square and a unit disk, we adopt the spectral method and the spectral-element method presented in the previous section to solve this problem numerically for obtaining the corresponding eigenvalues, respectively. In the latter case, we also investigate the performance of different combinations of the number of sub-elements and the polynomial degree of basis functions within each sub-element, while keeping the total number of degrees of freedom (DOFs) fixed.
Figure 4 shows the relative errors of the first 5,000 eigenvalues when and in (1.1)-(1.2) for different and DOFs with .

Figure 4. Accuracy test in 2D with and in (1.1)-(1.2) for different and : (a) Neumann (), and (b) Robin ().
Figure 5 plots the relative errors of the first 5,000 eigenvalues when and taken as a unit disk in (1.1)-(1.2) and for different and . In addition, Figure 7 displays the relative errors of the eigenvalues when and taken as a unit disk in (1.1)-(1.2) for different , and such that the total DOFs (c.f. Figure 6). Finally, Figure 8 shows the relative errors of the first 5000 eigenvalues when and in (1.1)-(1.2) when is taken as a unit square and a unit disk to be solved numerically by the spectral method with different and the spectral-element method with different and , respectively.

Figure 5. Accuracy test in 2D with taken as a unit disk and in (1.1)-(1.2) and for different and : (a) Neumann (), and (b) Robin ().
Figure 6. Schematic illustration of two different spectral-element partitions of the unit disk: (left), and (right).

Figure 7. Accuracy test in 2D with taken as a unit disk and in (1)-(2) for different , and : (a) Neumann (), and (b) Robin ().

Figure 8. Accuracy test in 2D with and in (1)-(2) for different : (a) a square with different , and (b) a disk with for different .
From Figs. 4-8, we can draw the following conclusions: (i) With the same number of DOFs, we observe that a larger number of reliable eigenvalues can generally be obtained by increasing the polynomial degree and decreasing the number of elements (c.f. Fig. 7), which demonstrates the significant advantage of high-order spectral methods in computing a large number of eigenvalues with high accuracy. (ii) With a given DOFs , the
proposed spectral method can compute up to approximately eigenvalues with relative errors below (c.f. Figs. 4&8 (left one)) for the Schrödinger eigenvalue problem (1.1)-(1.2) in 2D. (iii) With a given DOFs , the proposed spectral-element method can compute up to approximately eigenvalues with relative errors below (c.f. Figs. 5&8 (right one)) for the Schrödinger eigenvalue problem (1.1)-(1.2) in 2D. (iv) In 2D, with about DOFs at , we can obtain numerically at least 5,000 reliable eigenvalues (with relative error less than ) (c.f. Figs. 4, 5 and 8). Again, with this kind of resolution capacity of the proposed spectral and spectral-element methods, we can obtain numerically the RtN gaps of the Schrödinger operator and their convergence rates in 2D, which will be reported in the next section.

Figure 10. Convergence rates of the RtN gaps of (1.1)-(1.2) in 1D with for different potentials : (a) convergence rate of the cumulative averages , and (b) convergence rate of the RtN gaps .
Numerical studies on the Robin-to-Neumann (RtN) gaps
In this section, we investigate numerically the Robin-to-Neumann (RtN) gaps in 1D, 2D and 3D by using the spectral and spectral-element methods proposed in Section 3. In each case, we take enough large DOFs such that we have enough reliable eigenvalues for obtaining conclusions on the RtN gaps.
The RtN gaps in 1D
We take and in (1.1)–(1.2). The problem is solved numerically by the spectral method. Figure 9 shows the RtN gaps with for different .

Figure 9. The RtN gaps of (1.1)-(1.2) in 1D with for different : (a) , and (b) .

Figure 11. Convergence rates of the RtN gaps of (1.1)–(1.2) in 1D with for different : (a) convergence rate of the cumulative averages , and (b) convergence rate of the RtN gaps .
From Figs. 9–11, and additional results with several other potentials, such as , or , or
which are not shown here for brevity, we can immediately conclude (1.12) when and (1.13).
The RtN gaps in 2D
We take in (1)-(2) with several different domains, such as right triangle with an angle , L-shaped domain, quarter stadium, mushroom (c.f. Figure 12. The spectral-element method is adopted with , and DOFs given below (c.f. Figure 12):
Figure 12. Schematics and partitioning of the different domains in 2D: a right triangle with an angle , an L-shaped domain, a quarter stadium, a mushroom (from left to right).
Triangle: , and the DOF ;
L-shaped domain: , and the DOF ;
Quarter stadium: , and the DOF ;
Mushroom: , and the DOF .
Figure 13 shows the RtN gaps and of (1.1)-(1.2) in 2D with and for different domains . Figure 14 shows convergence rates of the cumulative averages of (1.1)-(1.2) in 2D with and for different domains .

Figure 13. The RtN gaps of (1)-(2) in 2D with and for different domains : (a) the unit square, (b) the annulus with inner and outer radius as 1 and 2, respectively, (c) the right triangle with an angle , (d) the L-shaped domain, (e) the quarter stadium, and (f) the mushroom.

Figure 14. Convergence rate of the cumulative averages of (1.1)-(1.2) in 2D with : (a) with for different domains , and (b) with taken as a quarter-stadium domain for different .

Figure 15. Convergence rate of the cumulative averages of (1.1)-(1.2) in 2D with : (a) with for different domains , and (b) with taken as a quarter-stadium domain for different potentials.
From Figs. 13-15, and additional results not shown here for brevity, we can immediately conclude (1.12) when .
The RtN gaps in 3D
We take and in (1)-(2) with two different domains : one is a cube, i.e. , and another is a unit ball. The eigenvalues can be computed semi-analytically from separated transcendental equations.
Figure 16 shows the RtN gaps and of (1)-(2) in 3D with for two different domains. Figure 17 displays convergence rates of the cumulative averages of (1)-(2) in 3D for different and domains .

Figure 16. The RtN gaps of (1.1)-(1.2) in 3D with and for different domains : (a) the cube , and (b) the unit ball.

Figure 17. Convergence rate of the cumulative averages of (1.1)-(1.2) in 3D with for different and different domains : (a) the cube , and (b) the unit ball.
From Figs. 16-17, and additional results not shown here for brevity, we can immediately conclude (1.12) when .
Conclusion
We proposed and implemented spectral and spectral-element methods for accurately computing many eigenvalues of the Schrödinger operator with Robin boundary condition on simple and complex geometries, respectively. The proposed framework combines the geometric flexibility of finite element partitions with the high accuracy of spectral methods and -version finite element methods, allowing many reliable eigenvalues to be obtained under a fixed number of degrees of freedom. Using thousands of reliable eigenvalues obtained numerically by the proposed numerical methods, we investigated systematically the Robin-to-Neumann (RtN) gaps of Schrödinger operator with the Robin boundary condition in one dimension, two dimensions and three dimensions with different potentials and different geometries. Based on our extensive numerical results, we formulated a unified conjecture on the cumulative averages of the RtN gaps of the Schrödinger operator.
Acknowledgments
The authors would like to thank Professor Zeev Rudnick for his valuable suggestions and comments. This work was partially supported by the Ministry of Education of Singapore under its AcRF Tier 1 funding grant A-8003584-00-00 (W. Bao) and by the National Natural Science Foundation of China Grant No. 12501554 (F. Huang).
References
References
- [1]I. Babuška and J. E. Osborn. Finite element-Galerkin approximation of the eigenvalues and eigenvectors of selfadjoint problems. Math. Comp., 52(186):275–297, 1989.
- [2]I. Babuška and J. E. Osborn. Eigenvalue problems. In P. G. Ciarlet and J.-L. Lions, editors, Handbook of Numerical Analysis, volume 2, pages 641–787. North-Holland, Amsterdam, 1991.
- [3]W. Bao, L. Chen, X. Jiang, and Y. Ma. A Jacobi spectral method for computing eigenvalue gaps and their distribution statistics of the fractional Schrödinger operator. J. Comput. Phys., 421:109733, 2020.DOI
- [4]W. Bao, X. Ruan, J. Shen, and C. Sheng. Fundamental gaps of the fractional Schrödinger operator. Commun. Math. Sci., 17(2):447–471, 2019.
- [5]F. A. Berezin and M. A. Shubin. The Schrödinger Equation, volume 66 of Mathematics and Its Applications. Kluwer Academic Publishers, Dordrecht, 1991.
- [6]D. Boffi. Finite element approximation of eigenvalue problems. Acta Numer., 19:1–120, 2010.DOI
- [7]S. Böglі, J. B. Kennedy, and R. Lang. On the eigenvalues of the Robin Laplacian with a complex parameter. Anal. Math. Phys., 12(1):39, 2022.
- [8]S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods, volume 15 of Texts in Applied Mathematics. Springer, New York, 3 edition, 2008.
- [9]C. Carstensen and J. Gedicke. An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity. SIAM J. Numer. Anal., 50(3):1029–1057, 2012.
- [10]C. Carstensen and J. Gedicke. Guaranteed lower bounds for eigenvalues. Math. Comp., 83(290):2605–2629, 2014.DOI
- [11]H. Chen, L. He, and A. Zhou. Finite element approximations of nonlinear eigenvalue problems in quantum physics. Comput. Methods Appl. Mech. Engrg., 200(21–22):1846–1865, 2011.DOI
- [12]X. Dai, J. Xu, and H. Zhou. Convergence and optimal complexity of adaptive finite element eigenvalue computations. Numer. Math., 110(3):313–355, 2008.DOI
- [13]E. B. Davies. Spectral Theory and Differential Operators, volume 42 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1995.DOI
- [14]M. O. Deville, P. F. Fischer, and E. H. Mund. High-Order Methods for Incompressible Fluid Flow, volume 9 of Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge, 2002.
- [15]K. Gittins and B. Helffer. Courant-sharp Robin eigenvalues for the square: The case with small Robin parameter. Ann. Math. Qué., 44(1):91–123, 2020.
- [16]D. J. Griffiths and D. F. Schroeter. Introduction to Quantum Mechanics. Cambridge University Press, Cambridge, 3 edition, 2018.
- [17]Y. Guo and P. Ming. A deep learning method for computing eigenvalues of the fractional Schrödinger operator. J. Syst. Sci. Complex., 37(2):391–412, 2024.
- [18]Y. Guo, P. Ming, and H. Yu. Generalization error estimates of a machine learning method for solving high-dimensional Schrödinger eigenvalue problems. Sci. China Math., 69(4):1063–1114, 2026.DOI
- [19]B. Hashemi and Y. Nakatsukasa. Least-squares spectral methods for ODE eigenvalue problems. SIAM J. Sci. Comput., 44(5):A3244–A3264, 2022.
- [20]E. Hernández and R. Rodríguez. Finite element approximation of spectral problems with Neumann boundary conditions on curved domains. Math. Comp., 72(243):1099–1115, 2003.DOI
- [21]X. Hu and X. Cheng. Acceleration of a two-grid method for eigenvalue problems. Math. Comp., 80(275):1287–1301, 2011.DOI
- [22]M. G. Larson. A posteriori and a priori error analysis for finite element approximations of self-adjoint elliptic eigenvalue problems. SIAM J. Numer. Anal., 38(2):608–625, 2000.DOI
- [23]H. Li and Z. Zhang. Efficient spectral and spectral element methods for eigenvalue problems of Schrödinger equations with an inverse square potential. SIAM J. Sci. Comput., 39(1):A114–A140, 2017.
- [24]Q. Lin and H. Xie. A multi-level correction scheme for eigenvalue problems. Math. Comp., 84(291):71–88, 2015.
- [25]A. López-Yela and J. M. Pérez-Pardo. Finite element method to solve the spectral problem for arbitrary self-adjoint extensions of the Laplace–Beltrami operator on manifolds with a boundary. J. Comput. Phys., 347:235–260, 2017.
- [26]R. Ognibene. On asymptotics of Robin eigenvalues in the Dirichlet limit. Commun. Partial Differ. Equ., 50(9):1174–1210, 2025.
- [27]A. T. Patera. A spectral element method for fluid dynamics: Laminar flow in a channel expansion. J. Comput. Phys., 54(3):468–488, 1984.DOI
- [28]Z. Rudnick and I. Wigman. The Robin problem on rectangles. J. Math. Phys., 62(11):113503, 2021.DOI
- [29]Z. Rudnick and I. Wigman. On the Robin spectrum for the equilateral triangle. J. Phys. A: Math. Theor., 55(25):254004, 2022.DOI
- [30]Z. Rudnick and I. Wigman. On the Robin spectrum for the hemisphere. Ann. Math. Qué., 46(1):121–137, 2022.arxiv.org/abs/2008.12964
- [31]Z. Rudnick, I. Wigman, and N. Yesha. Differences between Robin and Neumann eigenvalues. Commun. Math. Phys., 388:1603–1635, 2021.DOI
- [32]S. A. Sauter. Finite elements for elliptic eigenvalue problems: Error estimates which are explicit with respect to λ, h, and p. SIAM J. Numer. Anal., 48(1):95–108, 2010.DOI
- [33]W. Shan and H. Li. The triangular spectral element method for Stokes eigenvalues. Math. Comp., 86(308):2579–2611, 2017.DOI
- [34]J. Shen, T. Tang, and L.-L. Wang. Spectral Methods: Algorithms, Analysis and Applications, volume 41 of Springer Series in Computational Mathematics. Springer, Berlin, Heidelberg, 2011.DOI
- [35]G. Teschl. Mathematical Methods in Quantum Mechanics: With Applications to Schrödinger Operators, volume 157 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2 edition, 2014.
- [36]M. Vanmaele and R. Van Keer. An operator method for a numerical quadrature finite element approximation for a class of second-order elliptic eigenvalue problems in composite structures. ESAIM Math. Model. Numer. Anal., 29(3):339–365, 1995.DOI
- [37]W. Wang and Z. Zhang. Spectral element methods for eigenvalue problems based on domain decomposition. SIAM J. Sci. Comput., 44(2):A689–A719, 2022.DOI
- [38]J. A. C. Weideman and L. N. Trefethen. The eigenvalues of second-order spectral differentiation matrices. SIAM J. Numer. Anal., 25(6):1279–1298, 1988.DOI
- [39]J. Xu and A. Zhou. A two-grid discretization scheme for eigenvalue problems. Math. Comp., 70(233):17–25, 2001.
- [40]B. Yang and A. Zhou. Eigenfunction behavior and adaptive finite element approximations of nonlinear eigenvalue problems in quantum physics. ESAIM Math. Model. Numer. Anal., 55(1):209–227, 2021.
- [41]Y. Yang and H. Bi. Two-grid finite element discretization schemes based on shifted-inverse power method for elliptic eigenvalue problems. SIAM J. Numer. Anal., 49(4):1602–1624, 2011.DOI
- [42]Z. Zhang. How many numerical eigenvalues can we trust? J. Sci. Comput., 65(2):455–466, 2015.

