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.
Rösler et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: