REVIEW 3 cited by
Computing Scattering Resonances
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
The question of whether it is possible to compute scattering resonances of Schr\"odinger operators - independently of the particular potential - is addressed. A positive answer is given, and it is shown that the only information required to be known a priori is the size of the support of the potential. The potential itself is merely required to be $\mathcal{C}^1$. The proof is constructive, providing a universal algorithm which only needs to access the values of the potential at any requested point.
Forward citations
Cited by 3 Pith papers
-
On the computation of geometric features of spectra of linear operators on Hilbert spaces
First algorithms and solvability-complexity classifications for computing Lebesgue measure, capacity, and fractal dimensions of spectra of infinite-dimensional linear operators.
-
Computing Spectral Measures and Spectral Types
First general algorithms compute spectral measures, point/continuous/singular decompositions, functional calculus, and Radon-Nikodym derivatives for self-adjoint or unitary operators with known column decay, with Solv...
-
The foundations of spectral computations via the Solvability Complexity Index hierarchy
Sharp Solvability Complexity Index classifications are established for spectra of unbounded differential and graph operators, the spectral gap problem, and discrete spectra, with constructive algorithms realizing the ...
Discussion (0). Continue with ORCID to comment.