43 - NHR PerfLab Seminar: High-Performance Implementations for High-Order Finite-Element Discretizations of PDEs [ID:45755]
50 von 691 angezeigt

My topic is going to be the high performance implementation of high-order finite element

discretization.

So I'm focusing on a particular topic of PDEs.

And I would like to start with a few applications that I've been active in and try to convince

you that the approach we're choosing is interesting and helpful.

So let me just give you three pictures here that's from simulations that we've done in

various areas.

On the left-hand side, you see a typical turbulent flow.

And what you see here, what probably is just noise on your screen on the left, is the very

fine scale structure that we are having in this flow.

And this means, of course, that we need high performance capabilities.

This is a simulation which is run on a supercomputer.

In the middle, you see a part of the human lung.

So what you see in the upper part of the figure is that this is some airways where we have

air going through.

And then it splits up into small structures.

And again, this is a typical problem that we want to solve in the order of understanding

of what happens in various scenarios.

And then on the right-hand side, I have a case of acoustics, which is some sound wave

which propagate in kind of a building and where we have been considering various optimizations

as well.

And all of these applications have in common that we are interested in solving them efficiently

and using the available hardware to a good extent.

So I want just to have two slides here on the general outline and ideas here.

So what I'm focusing on is the efficiency of the discretization.

Of course, what we want to do is we want to lower the number of degrees of freedom because

we are solving kind of the problems which are on the edge of what you could do even

on supercomputers.

So what we are aiming for is we want to have a higher accuracy per unknown that we have

in our method and the second ingredient that we try to get into is that we have a method

which should be applicable to general geometries.

So we are solving possibly complicated features that we need to resolve with unstructured

mesh.

And now of course the challenge, what I already said is that we have high Reynolds number

flows which develop fine-scale features.

So we need to track them over long times.

We need good dispersion properties because we want our methods to be resolving them well.

And the solution to these demands can be seen as a high-order finite element approximation

is a suitable case because they are geometric flexible because we can use unstructured meshes

and get high orders.

We prefer hexahedral meshes because we have some optimizations for them.

And the good thing about these kind of finite element type methods is that when we go to

higher orders we are adding unknowns inside of the elements.

So of course this means that we are giving up some of the flexibility in the mesh because

we are not having as many elements for the same number of unknowns but we still have

the ability to do unstructured meshes together.

And the degrees that we typically look at is between three and seven I say.

It might be depending on various applications where we do.

And I did say before we are looking at finite element type methods.

We often look at discontinuous Galerkin methods because they have attractive properties in

Teil einer Videoserie :
Teil eines Kapitels:
NHR@FAU PerfLab Seminar

Zugänglich über

Offener Zugang

Dauer

01:02:02 Min

Aufnahmedatum

2022-11-08

Hochgeladen am

2022-11-20 16:36:05

Sprache

en-US

NHR PerfLab Seminar talk on November 8, 2022
Speaker: Martin Kronbichler, University of Augsburg
Abstract: My talk will present recent developments on matrix-free finite-element algorithms for numerically solving partial differential equations on complex geometries. The core ingredient is the computation of the integrals underlying the finite-element discretization on the fly. While this leads to algorithms with several hundreds of arithmetic operations per unknown and was traditionally considered too expensive compared to assembling a global sparse matrix, progress in performance engineering made it the fastest way to evaluate the matrix-vector product for practical cases of high-order discretizations with curvilinear unstructured hexahedral mesh elements or variable coefficients. The explanation is that the additional arithmetic work can be hidden behind the memory transfer of accessing the solution vectors, and in fact leverage a throughput close to simple finite difference stencils. I will present node-level performance results for high-order continuous and discontinuous Galerkin discretizations, including the case of adaptively refined meshes with hanging nodes. With the achieved high throughput of the matrix-vector product, we have observed that other operations in common iterative solvers, such as the vector operations in multigrid smoothers or the conjugate gradient method, now take a significant share of run time both on GPUs and CPUs. I will present results of loop fusion to increase data locality, which benefit CPUs with large L2 and L3 caches.
Speaker bio: Martin Kronbichler is a Professor at the University of Augsburg, Germany. He holds a diploma in applied mathematics from Technical University of Munich, Germany (2007) and a PhD degree in scientic computing with specialization in numerical analysis from Uppsala University, Sweden (2012). His research interests include high-order nite element methods for ow problems with matrix-free implementations, efcient numerical linear algebra, and their parallel and high-performance implementation on emerging exascale hardware using generic numerical software.
See https://hpc.fau.de/research/nhr-perflab-seminar-series/ for past and upcoming NHR PerfLab seminar talks.

Tags

HPC performance engineering finite elements PDE
Einbetten
Wordpress FAU Plugin
iFrame
Teilen