University of Cambridge > Talks.cam > Cambridge Analysts' Knowledge Exchange (C.A.K.E.) > The Solvability Complexity Index and Approximations of Spectra of Operators

The Solvability Complexity Index and Approximations of Spectra of Operators

Add to your list(s) Download to your calendar using vCal

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2014 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity