University of Cambridge > Talks.cam > Applied and Computational Analysis > Computing eigenvalues of the Laplacian on rough domains

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Computing eigenvalues of the Laplacian on rough domains

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Colbrook .

In this talk, I shall present a joint work with Frank Rösler in which we consider the computability of eigenvalues of the Dirichlet Laplacian on bounded domains with rough, possibly fractal, boundaries. We work within the framework of Solvability Complexity Indices, which allows us to formulate the problem rigorously. On one hand, we construct an algorithm that provably converges for any domain satisfying a collection of mild topological hypotheses, on the other, we prove that there does not exist an algorithm of the same type which converges for an arbitrary bounded domain. Along the way, we develop new spectral convergence results for the Dirichlet Laplacian on rough domains, as well as a novel Poincaré-type inequality.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

LR6, Engineering, Department of Hauser Forum, 3 Charles Babbage Road Average on weekdays: 8919.19607843 kWh

Other talks

Tea and Coffee Break In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Title to be confirmed Loke CTR Annual Meeting 2026 - Epigenetics of embryogenesis and placentation Wolfson Tool Factory Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us?
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity