Resonance computations: are they easy or hard?

Value of the Information & Strength of the Argument

The talk provides valuable insights into the theory and computation of resonances, bridging pure and applied mathematics. Marletta’s argumentation is rigorous, building from concrete examples to formal definitions and then to a detailed case study. He effectively demonstrates the subtleties of resonance computations, such as the need for analytic continuation and the pitfalls of naive truncation. The narrative is compelling, particularly the account of resolving a long-standing controversy through computer-assisted proofs, which showcases the power of rigorous numerical methods. The discussion of AI-assisted computation adds a modern perspective, though it is presented as an anecdote rather than a systematic analysis.

Scientific Rigor, Source Quality, Title Accuracy

The talk demonstrates high scientific rigor, with clear definitions and references to established literature (e.g., Dautray-Lions, Tullio Regge, Hislop-Sigal). However, no specific sources are cited in the description beyond the seminar page. The title accurately reflects the content, which is a critical examination of the ease or difficulty of resonance computations. The talk is well-structured and technically precise, suitable for an expert audience.

The title accurately reflects the content, which explores the computational challenges of resonance problems.

8/10

Talk by a leading spectral theorist at a prestigious institute, presenting rigorous mathematical definitions and results, including computer-assisted proofs. High expertise, but no peer-reviewed sources cited directly in the talk.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 02:00Introduction and motivation for the talk on resonances.
• 05:00Example of wave equation with potential and asymptotic expansion involving resonances.
• 10:00Definition of resonances for potential scattering via analytic continuation of the resolvent.
• 15:00Definition of resonances for obstacle scattering using Dirichlet-to-Neumann maps.
• 20:00Discussion of complex scaling and perfectly matched layers for computing resonances.
• 25:00Case study: resolving a controversy in resonance calculations using computer-assisted proofs.
• 30:00AI-assisted computation of resonances with high precision, surprising the speaker.
• 35:00Conclusion: resonances are hard to compute, especially with dynamic data, but AI shows promise.

• Isaac Newton Institute for Mathematical Sciences — Host institution for the seminar.
• Seminar page: Operator approaches to dynamics: new connections — Event page for the talk.

• Isaac Newton Institute for Mathematical Sciences — The institute's reputation and the seminar series support the credibility of the talk.