Computing the Spectrum in One, Two and Three Limits

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

• Ben Jennings (CCA)
• Wednesday 11 February 2015, 16:00-17:00
• MR14, Centre for Mathematical Sciences.

If you have a question about this talk, please contact Davide Piazzoli.

Computing the eigenvalues of a matrix is a classic computational problem with obvious practical relevance. While calculating the eigenvalues of matrices has long had a solution, it is not without its complexities. We take these complexities as our starting point. Generalizing, we consider the Finite Section (Ritz) method for calculating the spectrum of an operator defined on Hilbert space. While this can provide a practical method for bounded self-adjoint operators, the computation introduces spectral pollution for some operators of physical significance. After introducing the notions of the Solvability Complexity Index (SCI) and Towers of Algorithms, we construct an algorithm that recovers the spectrum for any bounded operator on $l^2(\mathbb{N})$.

This talk is part of the Cambridge Analysts' Knowledge Exchange series.

This talk is included in these lists:

• All CMS events
• CMS Events
• Cambridge Analysts' Knowledge Exchange
• DAMTP info aggregator
• Interested Talks
• MR14, Centre for Mathematical Sciences
• My seminars
• bld31

Note that ex-directory lists are not shown.