DeepAI AI Chat
Log In Sign Up

Computing Klein-Gordon Spectra

by   Frank Rösler, et al.

We study the computational complexity of the eigenvalue problem for the Klein-Gordon equation in the framework of the Solvability Complexity Index Hierarchy. We prove that the eigenvalue of the Klein-Gordon equation with linearly decaying potential can be computed in a single limit with guaranteed error bounds from above. The proof is constructive, i.e. we obtain a numerical algorithm that can be implemented on a computer. Moreover, we prove abstract enclosures for the point spectrum of the Klein-Gordon equation and we compare our numerical results to these enclosures. Finally, we apply both the implemented algorithm and our abstract enclosures to several physically relevant potentials such as Sauter and cusp potentials and we provide a convergence and error analysis.


page 1

page 2

page 3

page 4


Weak Galerkin methods for the Stokes eigenvalue problem

In this paper, we rewrite the Stokes eigenvalue problem as an Elliptic e...

Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates

Guaranteed lower Dirichlet eigenvalue bounds (GLB) can be computed for t...

Localization and delocalization of ground states of Bose-Einstein condensates under disorder

This paper studies the localization behaviour of Bose-Einstein condensat...

Efficient method for calculating the eigenvalue of the Zakharov-Shabat system

In this paper, a direct method is proposed to calculate the eigenvalue o...

Numerical integrators for continuous disordered nonlinear Schrödinger equation

In this paper, we consider the numerical solution of the continuous diso...

An Eigenvalue-Free Implementation of the Log-Conformation Formulation

The log-conformation formulation, although highly successful, was from t...