Hamburg University of Technology / Institute of Mathematics / Talks German flag


Search | Managament of Talks (German)

Talks 1 to 10 of 520 | show all

Next page Last page
Date Time Venue Talk
01/10/22 03:00 pm Zoom A new approach to the hot spots conjecture
Dr. Jonathan Rohleder

It is a conjecture going back to J. Rauch (1974) that the hottest and coldest spots in an insulated homogeneous medium such as an insulated plate of metal should converge to the boundary, for "most" initial heat distributions, as time tends to infinity. This so-called hot spots conjecture can be phrased alternatively as follows: the eigenfunction(s) corresponding to the first non-zero eigenvalue of the Neumann Laplacian on a Euclidean domain should take its maximum and minimum on the boundary only. This has been proven to be false for certain domains with holes, but it was shown to hold for several classes of simply connected or convex planar domains. One of the most recent advances is the proof for all triangles given by Judge and Mondal (Annals of Math. 2020). The conjecture remains open in general for simply connected or at least convex domains. In this talk we provide a new approach to the conjecture. It is based on a non-standard variational principle for the eigenvalues of the Neumann and Dirichlet Laplacians.
01/07/22 01:30 pm E3.074 & online (talk via zoom) Behavior of Nonlinear Water Waves in the Presence of Random Wind Forcing
Leo Dostal

01/06/22 01:00 pm Am Schwarzenberg-Campus 3 (E), Room 3.074 Bachelorarbeit: Task-basierte Implementierung von Parareal mittels torcpy
Florentine Meerjanssen, Institut für Mathematik
12/17/21 01:30 pm Zoom Low-Rank Updates for Schur Complement Preconditioners
Rebekka Beddig

12/10/21 01:30 pm Zoom A Block Householder Based Algorithm for the QR Decomposition of Hierarchical Matrices
Vincent Griem

Hierarchical Matrices are dense but data-sparse matrices that use low-rank factorisations of suitable submatrices to allow for storage with linear-polylogarithmic complexity. Furthermore, efficient approximations of matrix operations like matrix-vector and matrix-matrix multiplication, matrix inversion and LU decomposition are available. There are several approaches for the computation of QR factorisations in the hierarchical matrix format, however, they suffer from numerical drawbacks that limit their use in many applications. In this talk, I will present a new approach based on block Householder transformations that improves upon some of those problems. To prevent unnecessary high ranks in the resulting factors and increase speed as well as accuracy the algorithm meticulously tracks for which intermediate results low-rank factorisations are available.

I will try to keep things as simple as possible and give a short introduction to hierarchical matrices as well. Previous knowledge of them is not necessary to understand the basic ideas and main obstacles of the new algorithm. I will focus on aspects, that I haven't talked about yet in similar talks in the past, mainly on how a cost estimate is possible although the hierarchical structure of the resulting QR decomposition is step-wise created during the algorithm and not defined beforehand.
11/30/21 05:15 pm Online via Zoom Statistische Analyse von Fehlern in Schachpartien [Bachelorarbeit]
Paul Roth
11/29/21 03:00 pm Online & E3.074 (talk via zoom) Local pressure-correction for flow problems
Malte Braack, Christian-Albrechts-Universität zu Kiel

We present a novel local pressure correction method for incompressible fluid flows. Pressure correction methods
decouple the velocity and pressure components of the time-dependent Navier-Stokes equations and lead to a sequence of elliptic partial differential equations for both components instead of a saddle point problem. In some situations, the equations
for the velocity components are solved explicitly (with time step restrictions) and thus the elliptic pressure problem remains to be the most expensive step. Here, we employ a multiscale procedure for the solution of the Poisson problem related to pressure. The procedure replaces the global Poisson problem by local Poisson problems on subregions.We propose a new Robin-type boundary condition design for the
local Poisson problems, which contains a coarse approximation of the global Poisson problem. Accordingly, no further communication between subregions is necessary and the method is perfectly adapted for parallel computations. Numerical experiments regarding a known analytical solution and flow around cylinder benchmarks show the effectivity of this new local pressure correction method.
11/22/21 03:00 pm E3.074 & zoom (talk via zoom) A Hybrid Approach for Data-based Models Using a Least-squares Regression*
Malin Lachmann

An increased use of renewable energy could significantly contribute to decelerate climate change but cannot be realized easily since most renewable energy sources underlie volatile availability. Using of storage devices and scheduling consumers to times when energy is available can increase the amount of renewable energy that is used. For this purpose, adequate models that forecast the energy generation and consumption as well as the behavior of storage devices are essential. We present a computationally efficient modeling approach based on a least-squares problem that is extended by a hybrid model approach based on kmeans clustering and evaluate it on real-world data at the examples of modeling the state of charge of a battery storage and the temperature inside a milk cooling tank. The experiments indicate that the hybrid approach leads to better forecasting results, especially if the devices show a more complicated behavior. Furthermore, we investigate whether the behavior of the models is qualitatively realistic and find that the battery model fulfills this requirement and is thus suitable for the application in a smart energy management system. Even though forecasts for the hybrid milk cooling model have low error values, further steps need to be taken to avoid undesired effects when using this model in such a sophisticated system.
11/19/21 01:30 pm Am Schwarzenberg-Campus 3 (E), Room 3.074 + Zoom Shearlet-based Approach to Dynamic Computed Tomography
Thorben Abel

I will introduce myself and present the topic of my master thesis.

Computed Tomography (CT) is a standard procedure in clinical imaging. In dynamic CT, several CT scans are made to make a process inside the patient visible. Therefore, the X-ray exposure to the patient is relatively high during such a survey. Thus, it is desirable to lower the X-ray exposure to the patient.

In my thesis I investigated an approach which requires only sparse angular sampling for every scan. In order to be able to reconstruct the image anyway, I used a shearlet system combined with an $\ell^1$-regularization. I compared different shearlet systems and checked for different parameters the impact on the results. I used both simulated data as well as real CT data for the tests.
11/11/21 03:00 pm Am Schwarzenberg-Campus 3 (E), Room 3.074 Informationen zweiter Ordnung im Training neuronaler Netze [Masterarbeit]
Eva Lina Fesefeldt

* Talk within the Colloquium on Applied Mathematics