|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 listsClare Hall Talks IfM Buns Talk Visual Rhetoric and modern South Asian history (2014)
Other talksWhat is to be done about community violence? The 2015 Annual Risk Summit Converting temporal information into spatial information in an early vertebrate embryo “Standing up” for young children’s health: How sedentary are young children, what factors may influence sedentariness and what can be done to reduce it? Why fracking works and why not well enough The solution of the Kadison-Singer Problem