Fast spectral tools for graph structure.
Generalizing classic eigenvalue localization results (e.g. Gershgorin).
Theory and scalable algorithms for kernel-based function approximation.
Asynchronous parallel algorithms for finding minima fast by fitting functions to surrogate models.
SCAN Seminar (CS/MATH 7290)
Ongoing. M 1:25-2:15, Gates 406.
The Scientific Computing and Numerics seminar series focuses on various methods in scientific computing, the analysis of convergence properties and computational efficiency, and their adaptation to specific applications.