|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
The Solvability Complexity Index and Approximations of Spectra of Operators
If you have a question about this talk, please contact Edward Mottram.
In this talk we will discuss the following long standing and fundamental problem: Given an operator on a separable Hilbert space (with an orthonormal basis), can one compute/construct its spectrum from its matrix elements. As we want such a construction to be useful in application (i.e. implementable on a computer), we restrict ourselves to only allowing the use of arithmetic operations and radicals of the matrix elements and taking limits. We will give an affirmative answer to the question, and also introduce a classification tool for the complexity of different computational spectral problems, namely, the Solvability Complexity Index.
This talk is part of the Cambridge Analysts' Knowledge Exchange (C.A.K.E.) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsMartin Centre Research Seminar Series - 43rd Annual Series of Lunchtime Lectures Computer Laboratory Research Students' Lectures 2014 Cambridge Networks and Communications meeting
Other talksLarge-scale brain networks in cognition and consciousness: focus on the default mode network Workshop introduction, context, and review of previous workshops Landing on a Comet The Future of Microprocessors Monitoring and Modelling Cast Iron Tunnel Linings Hungry black holes - tidal disruption of stars in the nuclei of galaxies in OGLE and Gaia surveys.