• Corpus ID: 219401589

Computing Scattering Resonances

@article{BenArtzi2020ComputingSR,
  title={Computing Scattering Resonances},
  author={Jonathan Ben-Artzi and Marco Marletta and Frank Rosler},
  journal={arXiv: Spectral Theory},
  year={2020}
}
The question of whether it is possible to compute scattering resonances of Schrodinger 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… 

Figures from this paper

Computing the Sound of the Sea in a Seashell
The question of whether there exists an approximation procedure to compute the resonances of any Helmholtz resonator, regardless of its particular shape, is addressed. A positive answer is given, and
Universal algorithms for computing spectra of periodic operators
TLDR
It is shown that for periodic banded matrices this can be done, as well as for Schrödinger operators with periodic potentials that are sufficiently smooth, and implementable algorithms are provided, along with examples.
The foundations of spectral computations via the Solvability Complexity Index hierarchy: Part II
TLDR
It is shown that for large classes of partial differential operators on unbounded domains, spectra can be computed with error control from point sampling operator coefficients, and some of the first results in this infinite classification theory are provided.
Universal algorithms for solving inverse spectral problems
. This paper explores the complexity associated with solving the inverse Sturm-Liouville problem with Robin boundary conditions: given a sequence of eigenvalues and a se- quence of norming constants,
ON THE COMPUTATION OF GEOMETRIC FEATURES OF SPECTRA OF LINEAR OPERATORS ON HILBERT SPACES
TLDR
The computation of geometric features of spectra in the SCI hierarchy is classified, allowing us to precisely determine the boundaries of what computers can achieve and prove that the authors' algorithms are optimal.
Computing Spectral Measures and Spectral Types
Spectral measures arise in numerous applications such as quantum mechanics, signal processing, resonance phenomena, and fluid stability analysis. Similarly, spectral decompositions (pure point,
Computing eigenvalues of the Laplacian on rough domains
TLDR
A general Mosco convergence theorem for bounded Euclidean domains satisfying a set of mild geometric hypotheses is proved, which implies norm-resolvent convergence for the Dirichlet Laplacian which in turn ensures spectral convergence.
Computing spectral properties of topological insulators without artificial truncation or supercell approximation
TLDR
These tools completely avoid such artificial restrictions and allow one to probe the spectral properties of the infinitedimensional operator directly, even in the presence of material defects and disorder.
Can stable and accurate neural networks be computed? - On the barriers of deep learning and Smale's 18th problem
TLDR
Fast Iterative REstarted NETworks (FIRENETs), which are both prove and numerically verify are stable, are introduced and it is proved that only O ( | log( (cid:15) ) | ) layers are needed for an ( cid: 15) -accurate solution to the inverse problem.

References

SHOWING 1-10 OF 28 REFERENCES
On the Solvability Complexity Index for Unbounded Selfadjoint and Schrödinger Operators
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
RESONANCES IN PHYSICS AND GEOMETRY
R esonances are most readily associated with musical instruments or with the Tacoma bridge disaster. The latter is described in many physics and ODE books, and at the Ontario Science Center one can
On the Solvability Complexity Index Hierarchy and Towers of Algorithms
TLDR
The Solvability Complexity Index (SCI) hierarchy is established, yielding a classification hierarchy for all types of problems in computational mathematics that determines the boundaries of what computers can achieve in scientific computing.
Solving the quintic by iteration
Equations that can be solved using iterated rational maps are characterized: an equation is ‘computable’ if and only if its Galois group is within A5 of solvable. We give explicitly a new solution to
Energies and widths of quasibound levels (orbiting resonances) for spherical potentials
Various methods for calculating the energies and widths of quasibound levels (orbiting or shape resonances) for spherical potentials are critically compared. A derivation for the previously‐proposed
Guaranteed resonance enclosures and exclosures for atoms and molecules
TLDR
This paper confirms, with absolute certainty, a conjecture on a certain oscillatory behaviour of higher auto-ionizing resonances of atoms and molecules beyond a threshold, and allows one, for the first time, to enclose and to exclude resonances with guaranteed certainty.
Scattering Theory
Quantum Theory of Scattering Processes.(International Encyclopedia of Physical Chemistry and Chemical Physics.) By J. E. G. Farina. Pp. xi + 152. (Pergamon: Oxford and New York, February 1973.) £4.50.
Lifetime Matrix in Collision Theory
The duration of a collision is usually a rather ill-defined concept, depending on a more or less arbitrary choice of a collision distance. If the collision lifetime is defined as the limit, as
Fourier Series
AT the thirty-second session of the Indian Science Congress, held at Nagpur in 1945, Dr. B. N. Prasad, president of the Section of Mathematics and Statistics, delivered an address on the summability
...
...