On the solvability complexity index for unbounded selfadjoint and Schrödinger operators

DOI10.1007/S00020-019-2555-XzbMATH Open1435.35269arXiv1902.11087OpenAlexW2990264034MaRDI QIDQ2284356FDOQ2284356

Authors: Frank Rösler 

Publication date: 14 January 2020

Published in: Integral Equations and Operator Theory (Search for Journal in Brave)

Abstract: We study the solvability complexity index (SCI) for unbounded selfadjoint operators on separable Hilbert spaces and perturbations thereof. In particular, we show that if the extended essential spectrum of a selfadjoint operator is convex, then the SCI for computing its spectrum is equal to 1. This result is then extended to relatively compact perturbations of such operators and applied to Schr"{o}dinger operators with compactly supported (complex valued) potentials to obtain SCI=1 in this case, as well.

Full work available at URL: https://arxiv.org/abs/1902.11087

Recommendations

• On the solvability complexity index, the \(n\)-pseudospectrum and approximations of spectra of operators
• Computability of the spectrum of self-adjoint operators
• Generalization of Lax equivalence theorem on unbounded self-adjoint operators with applications to Schrödinger operators
• Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
• On the spectrum of non-selfadjoint Schrödinger operators with compact resolvent

zbMATH Keywords

computational complexityspectral approximationSchrödinger operators

Mathematics Subject Classification ID

PDEs in connection with quantum mechanics (35Q40) Spectral theory and eigenvalue problems for partial differential equations (35P99)

Cites Work

• Title not available (Why is that?)
• Remarks on the convergence of pseudospectra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Growth conitions and the numerical range in a Banach algebra
• On the solvability complexity index, the \(n\)-pseudospectrum and approximations of spectra of operators
• New barriers in complexity theory: on the solvability complexity index and the towers of algorithms
• Solving the quintic by iteration
• Generalized Weyl theorems and spectral pollution in the Galerkin method
• Convergence of sequences of linear operators and their spectra
• Local convergence of spectra and pseudospectra
• The essential numerical range for unbounded linear operators

Cited In (9)

• On the computation of geometric features of spectra of linear operators on Hilbert spaces
• Computing scattering resonances
• Universal algorithms for computing spectra of periodic operators
• On the complexity of the inverse Sturm-Liouville problem
• Computing eigenvalues of the Laplacian on rough domains
• Computing the sound of the sea in a seashell
• On the solvability complexity index, the \(n\)-pseudospectrum and approximations of spectra of operators
• Generalization of Lax equivalence theorem on unbounded self-adjoint operators with applications to Schrödinger operators
• On the convergence of numerical integration as a finite matrix approximation to multiplication operator

This page was built for publication: On the solvability complexity index for unbounded selfadjoint and Schrödinger operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284356)