COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Applied and Computational Analysis > Computing eigenvalues of the Laplacian on rough domains
Computing eigenvalues of the Laplacian on rough domainsAdd to your list(s) 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 listsDr. Mira Phailbus talks about the education system in Pakistan Faculty of History events Meeting the Challenge of Healthy Ageing in the 21st CenturyOther talksRandom Fields: Modeling and Identification Next Steps and Wrap Up Complete and submit project choice forms Calibration of stochastic parametrizations for geophysical fluid dynamic models. An Introduction to Hidden Markov Models |