|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 listsHealth and Welfare Research Group Research Group of Centre of Governance and Human Rights Energy Innovation Beyond 2013: A talk by the Global Director of BP Ventures
Other talksThe Living Time Machine: Non-verbal intelligence Simulating realistic disc galaxies with a novel sub-resolution ISM model CGHR Research Group Realising the full potential of single particle cryomicroscopy The turbulent tale of Richard Burton, an armchair, and the Hakluyt Society: a story of nineteenth-century geography and the materialities of exploration The IL-6 cytokine family and CD4+ T cell response during acute and chronic viral infections