Monday, June 30, 2014
Konrad-Zuse-Zentrum für Informationstechnik Berlin
Takustr. 7
14195 Berlin
room 2005
Lecture - 14:15
Abstract:
This will be a talk about H. Minkowski: his life, his work, and his influence,
including a discussion of recent developments in arithmetic geometry.
Colloquium - 16:00
Abstract:
We describe and analyze a randomized homotopy algorithm for the Hermitian
eigenvalue problem. Given an n × n Hermitian matrix A the algorithm returns, almost surely,
a pair (λ, v) which approximates, in a very strong sense, an eigenpair of A. We prove that the
expected cost of this algorithm, where the expectation is both over the random choices of the
algorithm and a probability distribution on the input matrix A, is O(n^6), that is, cubic on the input size.