MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Looking for the unique sink of a cube

Jan Foniok
ETH Zurich - Department of Mathematics
Talk
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS  
AG Audience
English

Date, Time and Location

Monday, 28 January 2008
13:30
30 Minutes
E1 4
24
Saarbrücken

Abstract

Based on joint work with K. Fukuda and B. Gärtner. Try to

use a principal pivoting algorithm to solve the linear complementarity
problem, and the combinatorics you get is an orientation of the n-
dimensional cube. Now, it's not an arbitrary orientation: The cube has
a unique sink. But not only that, even each face has a unique sink! So
it's desirable to be able to find the sink because finding the sink
also means finding the solution to the original problem. I will sketch
two algorithms which have both a deterministic and a randomised
version, and I will show some examples on which they are fast and
others on which they are slow. As it is work in progress, there are
likely to be more questions than answers...

Contact

Daniel Johannsen
--email hidden
passcode not visible
logged in users only

Daniel Johannsen, 01/25/2008 13:51
Daniel Johannsen, 01/24/2008 20:54 -- Created document.