FoCM 2014 conference

Workshop A6 - Real Number Complexity

December 11, 14:30 ~ 15:00 - Room C11

Some Results on the Complexity of the Eigenvalue Problem

Diego Armentano

Universidad de La República, Uruguay   -

In this talk we present an algorithm for the eigenvalue(eigenvector) problem which runs on average polynomial time over the space of n by n complex matrices with Gaussian entries.

Joint work with Carlos Beltrán (Universidad de Cantabria, Spain), Peter Bürgisser (Technische Universität Berlin, Germany), Felipe Cucker (City University of Hong Kong, Hong Kong) and Michael Shub (City University of New York, USA).

View abstract PDF