Randomized methods for joint eigenvalue problems
Linear Algebra seminar by Daniel Kressner, École Polytechnique Fédérale de Lausanne
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Wednesday 10:30 New York (GMT-5)
Recording available
Abstract
Daniel Kressner surveys randomized algorithms for joint eigenvalue problems: finding common eigenvectors and their eigenvalues across a family of matrices. The talk covers algorithm development and analysis, with examples from signal processing and multivariate root finding. Joint work with Haoze He and Bor Plestenjak.
Topics
Related seminars
Randomized Numerical Linear Algebra
Related research
Recent Advances in Positive Semidefinite Matrix Approximation
Related research
Randomized Mixed-Precision Solution of Least Squares Problems
More on randomized algorithms