26.04.2016 um 16:15 Uhr in 69/125:
Roland Tomasi (Universität Osnabrück)
Smoothed Particle Hydrodynamics
I will give a short introduction to real-time simulation of fluids using Smoothed Particle Hydrodynamics (SPH). SPH is a mesh-free Lagrangian method, which is very well suited for parallelization and computations on modern GPUs.
03.05.2016 um 16:15 Uhr in 69/125:
Benjamin Collas (Universität Bayreuth)
Arithmetics of Moduli Spaces of Curves
As originally spotted by A. Grothendieck in ``Esquisse d'un programme'', the combinatorial structure of the moduli spaces of curves encaptures remarkable arithmetic properties. We present how this combinatoric at infinity manifests itself within the theory of profinite geometric Galois representations -- a theory whose genus 0 part has recently seen some Operadic developments --, and then how this serves as a motivation for further arithmetic studies in relation with the local stack combinatoric of the spaces.
10.05.2016 um 16:15 Uhr in 69/125:
Maximilian Wank (Universität Osnabrück)
Convergence of a Kacanov Iteration for the p-Poisson Equation
The p-Laplace operator appears in many applications, e.g. non-Newtonian fluid theory, turbulent flow of a gas in porous media, glaciology or plastic modelling. After a short introduction of the basic ideas and techniques by means of the linear Laplace operator we will discuss an iterative algorithm for solving the nonlinear p-Poisson equation. Thereby the variational structure of the problem will play an important role.
24.05.2016 um 16:15 Uhr in 69/125:
Markus Chimani (Universität Osnabrück)
Approximation Algorithms: Theoretical Beauty vs. Practicality
In theory, approximation algorithms form a sweet spot for NP-hard optimization problems: they promise to find provably "good" solutions in polynomial time. Approximation research has let to many truly beautiful and insightful results. In practice, however, many approximation techniques are futile and their application is hindered by huge constant factors, numerical restrictions of real machines, etc. In the last years, the field of Algorithm Engineering has garnered much respect in building a theoretical foundation for the practical study of originally theoretical algorithms. There are many successes in polynomial-time solvable problems, as well as heuristic and exact methods for NP-hard problems. For approximation algorithms, however, there are only very few research results trying to bridge the gap between their theoretical study and their worthwhileness in practice. In this talk, we discuss ways to bring those two sides together and try to demonstrate how theory and practice can strengthen each other.
31.05.2016 um 16:15 Uhr in 69/125:
Roser Homs Pons (Universität Barcelona)
Gorenstein colength of artinian local rings
In this talk we will do an introduction to Artinian local rings and how far they are from being Gorenstein. For this purpose, we will need to define Gorenstein colength and introduce the main tool we are using to compute it: Macaulay inverse systems. We will reformulate concepts such as Hilbert functions in terms of these inverse systems, show characterizations for rings with Gorenstein colength 0 and 1 and provide some rough outlines on what is known in the general case.
21.06.2016 um 16:15 Uhr in 69/125:
Lars Diening (Universität Osnabrück)
Discrete Maximum Principle
We discuss the maximum principle for harmonic functions and its discrete counterparts.