Admin message

Attention: i10git will shutdown soon!

This i10git GitLab server was migrated to gitos.rrze.fau.de due to hardware issues with the current host. This affects all production repositories, including waLBerla, lbmpy, pystencils and HyTeG.

Login: Gitos supports DFN-AAI and eduGAIN. If your institution does not support either, please use our GitHub mirrors.

Onboarding: All repositories belonging to groups were migrated. To regain access, first log in to gitos.rrze.fau.de once to activate your account. Then email cs10-admin@fau.de with your old i10git and your new gitos.rrze username (the @) as shown on your respective user profiles. We will reassign your accordingly. Note: Repositories from former courses (e.g. advpt) were not migrated.

Personal repositories in individual user namespaces were not migrated. Please export these yourself before the old server is shut down.

Expected shutdown by the end of 2026. Until then, the old i10git server will still be reachable with all repositories archived (read only). However, due to the ongoing hardware issues, it may remain unreliable and will receive no further maintenance.

The parent group is archived. This project and its data are read-only.
Shaidurov quadrature
In his monograph "Multigrid Methods for Finite Elements" (https://doi.org/10.1007/978-94-015-8527-9) Shaidurov presents some interesting quadrature rules. The idea is to place quadrature points on the boundary of elements, if possible. The integrand must thus be only evaluated once for all adjacent elements. For example, first order polynomials (P1) can be integrated with one point at a tetrahedron's barycenter, i.e. 1 function evaluation per element. It can also be integrated using one point at each node. Assuming that each node is adjacent to 24 cells, this results in 1/6 function evaluations per element. On the flip side, four evaluations must be summed on each element (instead of just one). If function evaluations are expensive, this most definitely is not very significant. The reference lists 5 rules on triangles and tetrahedrons, each. The rules with the most points can integrate P4 space exactly (with just one node in the volume). - On our grids, how many cells are adjacent to a vertex/edge/face? - An implementation must use a clever caching strategy when iterating over the elements to gain performance from this quadrature. How can we implement that? - In what cases are function evaluations expensive?
issue