High-order guaranteed lower bounds for the Schr"odinger eigenvalue problem
math.NA, cs.NA
Submitted: 2026-11-02
Updated: 2026-11-02
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: We compute unconditional guaranteed lower eigenvalue bounds for Schrödinger operators using a modified hybrid high-order method with built-in correction for the potential defect.
Abstract
We compute unconditional guaranteed lower eigenvalue bounds for Schrödinger operators using a modified hybrid high-order method with built-in correction for the potential defect. The method assumes exact numerical integration and allows possibly unbounded potentials in L p for p>n/2 and p at least2 on general polyhedral domains. We prove that the high-order correction preserves optimal a priori convergence orders, and derive reliable and efficient a posteriori error estimators. Numerical experiments provide striking evidence of optimal high-order convergence rates of the adaptive algorithm.
Sources
- The Dirichlet Problem for the Laplacian in Lipschitz Domains Revisited
- Guaranteed stability bounds for second-order PDE problems satisfying a Garding inequality
- Guaranteed Lower Eigenvalue Bounds for Spectral Galerkin Methods with Application to Schr\"odinger Operators
- A Two-Stage Finite Element Approach for High-precision Guaranteed Lower Eigenvalue Bounds
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers