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