|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 listsMARLEN KHUTSIEV IN CAMBRIDGE AND LONDON DAMTP info aggregator Graduate Women's Network
Other talksCan we make people value IT security? 'British Imperial Rule in China during the First Opium War (1840-1842)' Towards an evidence base for best practice in mathematics education Postgraduate Diploma in Entrepreneurship webinar A synthetic biology approach to harness the regulatory potential of miRNAs in the green alga Chlamydomonas reinhardtii Nature & Frequency of antimicrobial resistance plasmid transfer in E. coli