Computational tools for the continuous spectrum of self-adjoint operators

Ever since Joseph Fourier used sines and cosines to diagonalize the Laplacian and solve the heat equation in 1822, spectral decompositions of linear operators have empowered scientists to disentangle complex physical phenomena. However, the spectrum of a self-adjoint operator can be more sophisticated than its familiar matrix counterpart; it may contain a continuum and the operator may not be diagonalized by eigenvectors alone. Until now, computational techniques for operators with continuous spectrum have typically focused on narrow classes with known analytical structure. Algorithms that achieve generality and rigor have been scarce.   In this talk, we present a tool kit of algorithms for computing spectral properties associated with the continuous spectrum of self-adjoint operators. These algorithms use the resolvent to construct high-order accurate approximations of inherently infinite-dimensional spectral properties, including smooth spectral measures, projections onto absolutely continuous subspaces, and non-normalizable modes. The algorithms are embarrassingly parallelizable and capable of leveraging state-of-the-art software for the resolvent of differential, integral, and lattice operators. Their flexibility and power are illustrated with applications in quantum and condensed matter physics and we highlight several exciting new developments in the growing class of resolvent-based algorithms for modal analysis in infinite-dimensional spaces.
Date
Location
Troy 2012
Speaker: Andrew Horning from Massachusetts Institute of Technology
Back to top