Computing the Spectrum in One, Two and Three Limits
- 👤 Speaker: Ben Jennings (CCA)
- 📅 Date & Time: Wednesday 11 February 2015, 16:00 - 17:00
- 📍 Venue: MR14, Centre for Mathematical Sciences
Abstract
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})$.
Series This talk is part of the Cambridge Analysts' Knowledge Exchange series.
Included in Lists
- All CMS events
- bld31
- Cambridge Analysts' Knowledge Exchange
- CMS Events
- DAMTP info aggregator
- Interested Talks
- MR14, Centre for Mathematical Sciences
- My seminars
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Wednesday 11 February 2015, 16:00-17:00