Expositor: Mike Shub
Institución: Universidad de Nueva York Estados Unidos
Cuándo 09/03/2016 de 13:00
Dónde Auditorio "Alfonso Nápoles Gándara"
Given an n by n real or complex matrix M, find one or all the pairs (eigenvalue, eigenvector) of M. The problem is simple and pervasive, yet there is no known (at least by me) numerical algorithm which has a simple list of desired features: a) stability , b) convergence with probability one and c) average polynomial complexity. I will survey some of the problems concerning elimination theory and dynamical systems which arise. Finally I will present an algorithm satisfying all three criteria in the complex case.
Temas: