Two Questions About Mathematical Software
This day is about the following two questions about Mathematical Software:
(1) What is a sparse matrix?
We will investigate the interplay of data representations and algorithmic complexity, both theoretically and empirically. As a first basic example we will discuss algorithms in linear algebra over dense and sparse matrices.
(2) How good are convex hull algorithms?
We will discuss algorithms for computing convex hulls and compare implementations on various kinds of input. Additionally, we will survey what is known and not known about the theoretical complexity of such methods.
Format: Our mini-workshop will start at 10:00 sharp. There will be two blocks of the same format: 1 hour presentation, 10min break, 1 hour+ exercises. The second block will start at 14:00. So there will be more a lunch break (self-organized) of more than 90min. The whole thing will end around 16:30.
Audience: PhD students and postdocs of nonlinear algebra, geometric combinatorics and their friends.
Registration is closed!