Hybrid Arbitrary Degree::Core 2D - Library to implement 2D schemes with edge and cell polynomials as unknowns
HArD::Core2D Documentation

Table of Contents

HArD::Core (sources: https://github.com/jdroniou/HArDCore2D) provides a suite of tools, in C++, to implement numerical schemes whose unknowns are polynomials in the cells and on the edges (in 2D) or faces (in 3D). The focus is on dealing on generic polytopal meshes. This documentation addresses the 2D version of HArD::Core, but similar principles are valid for the 3D version.

Build instructions

Building the libraries and the schemes

To build the libraries and implemented schemes, the minimal requirements are:

Make sure that you have the development version of boost installed. On Linux, install libboost-dev, libboost-filesystem-dev, libboost-program-options-dev, libboost-chrono-dev and libboost-timer-dev from your package manager.

The linear systems resulting from the assembled scheme are solved using the BiCGStab implementation of Eigen. An alternative (currently commented out in the schemes' implementations) is to use the MA41 solver of the HSL library. To use this alternative you will need:

Once you have installed all of the required dependencies, set up the build directory and generate the build files by running the following from the repository root:

mkdir build
cd build
cmake ..

After this, build/Schemes will contain the executables (e.g. hho-diffusion) to run the schemes. These executable need to access the typ2 meshes, which they should naturally find if you put the typ2_meshes directory at the root of the project's files.

Building the Documentation

The mesh documentation is built with Doxygen (http://www.stack.nl/~dimitri/doxygen/). If you are reading this then somebody has already built it for you. If you modify the code and wish to rebuild the documentation, simply run doxygen from the root directory. The HTML version of the documentation is generated inside documentation/html and the LaTeX version is generated inside documentation/latex and can be compiled using the generated Makefile.

The mesh


After it is loaded, the mesh is represented by classes describing a vertex, an edge, and a cell: Vertex, Edge, and Cell. Each of these classes contains methods to access useful information for the corresponding element, including other geometrical quantities it is related to. The mesh itself is represented by an element of the Mesh class with methods to access all the vertices, edges and cells (or a particular vertex, edge or cell). In this class, each cell has a unique identifier, numbered from 0.

For example, if mesh_ptr is a pointer to a Mesh class,

Vertex* vertex = mesh_ptr->vertex(5);
Eigen::Vector2d vert_coord = vertex->coords()

would store the coordinates of the fifth vertex into the Eigen vector vert_coord. As a generic rule, all geometrical vectors are Eigen::Vector2d. We also use Eigen::Vector{2,X}d and Eigen::Matrix{2,X}d for objects on which linear algebraic operations are performed. Lists (e.g. of cells, of functions...) are instances of std::vector<...>. Finally, Eigen::Array is used for lists on which component-wise operators are performed (typically, values of some functions at the quadrature nodes, that will be multiplied component-wise by the corresponding quadrature weights and then summed together).

Here is an example that loops over all cells, grabs all the edges of the cell, and loops over these edges to output their length. Here, mesh_ptr is a pointer to the mesh.

// Loop over all cells of the mesh
for (size_t iC = 0; iC < mesh_ptr->n_cells() iC++) {
// We grab the edges of the iC-th cell
std::vector<Edge *> edges = mesh_ptr->cell(iC)->get_edges();
// Loop over the edges of the cell
for (size_t ilE = 0; ilE < cell->n_edges(); ilE++) {
// Write the edge length on the standard output
std::cout << "The length of edge " << ilE+1 << " in cell " << iC+1 << " is: " << edges(ilE)->measure() << "\n";

The mesh classes and other auxilliary classes are located inside the namespace HArDCore2D.

There is no direct access from a high-level geometrical entity to elements purely associated with lower-level entities. For example, if mesh_ptr is a pointer to the mesh, there is no direct method to access the coordinates of the i-th vertex of the mesh (no mesh_ptr->coords_vertex() exists). Instead, this is done through mesh_ptr->vertex(i)->coords(). This choice is deliberate as it preserves the logical organisation of the data structure, and facilitates the memorisation of the various methods. Of course, writing a wrapper providing a direct access is easy...

Loading a mesh

HArDCore2D can currently read meshes in the typ2 format designed for the FVCA5 Benchmark. A short documentation describing this format is provided in the typ2_meshes directory (see README.pdf there). Several meshes can also be found in this directory.

A mesh file must be read using an instance of the MeshReaderTyp2 class, and then built using MeshBuilder. A working example is given below (assuming the executable will be in build/Schemes for example).

#include "mesh.hpp"
#include "import_mesh.hpp"
#include "mesh_builder.hpp"
using namespace HArDCore2D;
int main() {
// Mesh file to read
std::string mesh_file = "../../typ2_meshes/cart5x5.typ2";
// Read the mesh file
MeshReaderTyp2 mesh(mesh_file);
std::vector<std::vector<double> > vertices;
std::vector<std::vector<size_t> > cells;
std::vector<std::vector<double> > centers;
if (mesh.read_mesh(vertices, cells, centers) == false) {
std::cout << "Could not open file" << std::endl;
return false;
// Build the mesh
MeshBuilder* builder = new MeshBuilder();
Mesh* mesh_ptr = builder->build_the_mesh(vertices, cells);
std::cout << "There are " << mesh_ptr->n_cells() << " cells in the mesh.\n";

Note: the typ2 format allows for meshes with very generic polygonal cells, including non-convex cells. However, the builder assumes that each cell is star-shaped with respect to the isobarycenter of its vertices – otherwise, the calculation of the center of mass may be incorrect. Similarly, the quadrature rules (see Quadrature rules) assume that each cell is star-shaped with respect to its center of mass.

The HybridCore structure

The HybridCore structure encapsulates routines to create bases of polynomial spaces in each cell and on each edge, to integrate functions on these mesh entities, and to evaluate functions defined through their coefficients on the cell and edge basis functions. Start by including the structure as follows:

#include "hybridcore.hpp"

Initialising the HybridCore structure

To initialise a HybridCore structure, we must first have a mesh loaded as a pointer (see loading a mesh). The structure is then created by specifying the desired degree of the polynomial spaces on the edges and in the cells.

// Create the HybridCore structure with polynomial degree K on the edges, and L in the cells
HybridCore hho(mesh_ptr, K, L);

Polynomial basis functions

Initialising the HybridCore structure constructs basis functions for the polynomial spaces on the edges (up to degree $K$) and in the cells (up to degree $(K+1)$). The choice of the degree in the cells corresponds to the needs of certain high-order methods, such as the HHO method that requires the reconstruction of a polynomial of degree $(K+1)$ in each cell. It is also assumed that $L\le K+1$.

The basis functions are accessed through the methods cell_basis(iT,i) and edge_basis(iE,i) which return the i-th basis function on the iT-th cell or iE-th edge. The cell gradients are available from cell_gradient(iT,i); these gradients are indexed to correspond with their basis functions, which means that the first gradient will always identically be the zero vector, since it corresponds to the constant basis function.

const auto &phi_i = cell_basis(iT, i);
const auto &dphi_i = cell_gradient(iT, i); // dphi_i is the gradient of phi_i

The basis functions are hierarchical, which means that they are constructed by increasing degree. A basis of the space of polynomials of degree $K$ in the cell is thus obtained by selecting the first $(K+1)(K+2)/2$ cell basis functions.

When a scheme has polynomial unknowns of degree $K$ on the edges and $L$ in the cells, these unknowns can be represented as vectors of coefficients on the basis functions, for example by listing all the coefficients on the basis functions in the first cell, then all the coefficients on the basis functions in the second cell, etc., and then listing all the coefficients on the basis functions in the first edge, etc. This is the choice adopted in HHO-diffusion.

A number of convenient quantities relating to the basis functions are available in the HybridCore structure follows.

Symbol name Meaning
nlocal_cell_dofs The number of degrees of freedom of a cell polynomial (ie. the dimension of the space of polynomials of degree $\le L$ in two variables)
nlocal_face_dofs The number of degrees of freedom of a face polynomial (ie. the dimension of the space of polynomials of degree $\le K$ in one variable)
nhighorder_dofs The number of degrees of freedom of a degree $(K+1)$ cell polynomial (ie. the dimension of the space of polynomials of degree $\le K+1$ in two variables)
ngradient_dofs The dimension of the gradient space of degree $(K+1)$ cell polynomials
ntotal_cell_dofs The total number of degrees of freedom over all cell polynomials over the entire mesh (i.e. the number of cells times the dimension of the space of polynomials of degree $\le L$ in two variables)
ntotal_face_dofs The total number of degrees of freedom over all face polynomials over the entire mesh (i.e. the number of edges times the dimension of the space of polynomials of degree $\le K$ in one variables)
ninternal_face_dofs The total number of degrees of freedom over all internal faces over the entire mesh
ntotal_dofs The total number of cell and face degrees of freedom over the entire mesh

Integration over cells and edges

The HybridCore structure provides routines to integrate generic functions on the cells and the edges. These routines are however expensive as they re-compute the quadrature nodes and weights every time they are called. They should therefore only be used with parsimony; computing quadrature nodes and values of basis functions at these nodes is more efficient, see Quadratures rules.

For example, to integrate $f(x,y) = x^2 + y^2 $ over the cell number iT:

auto integral = integrate_over_cell(iT, [](auto x, auto y) {
return x*x+y*y;

Basis functions can also be integrated:

const auto& phi_i = edge_basis(iT, i);
const auto& phi_j = cell_basis(iT, j);
auto integral = hho.integrate_over_face(iT, [&phi_i, &phi_j](auto x, auto y, auto z) {
return phi_i(x,y) * phi_j(x,y);

Quadrature rules

HArD::Core deals with quite arbitrary cell geometries. As a consequence, no reference element can be used, and the quadrature rules have to be adjusted to each particular cell. This is done by partitioning each cell into triangles and by using John Burkardt's implementation of the Dunavant rules. The choice was also made not to pre-compute all quadrature rules for all cells and edges, but rather to compute them – with a locally chosen degree of exactness – when needed in the code. To reduce the computational cost, quadrature rules – and the values of basis functions at quadrature nodes – should only be computed once when looping over each cell, before being used, e.g., to form mass matrices.

The HybridCore structure provides routines to do that. The method cell_qrule(iT,doe) calculates quadrature nodes and weights, exact up to the polynomial degree doe for an integration over cell number iT; see edge_qrule(iE,doe) for the equivalent over an edge. This quadrature rule, stored for example in quadTE, is then be provided to basis_quad(type,i,quadTE,deg) which computes the values of the basis functions in cell/edge (depending on type=T or some other character) number i up to the specified degree deg; see also grad_basis_quad(i,quadTE,deg) to compute the gradients of the basis functions at the quadrature nodes.

Typically, these values are then passed on to gram_matrix(f_quad,g_quad,Nf,Ng,quadTE,sym,weight) which computes a ``generalised'' Gram matrix $(\int weight*f_i*g_j)_{ij}$ of the families of functions $(f_1,\ldots,f_{Nf})$ and $(g_1,\ldots,g_{Ng})$, provided at the quadrature notes by f_quad and g_quad (here, sym is a boolean indicating if the matrix is expected to be symmetric). This Gram matrix method is useful to compute mass and stiffness matrices.

Here is an example.

// Create quadrature rule on cell `iT`. Here, `hho` is an instance of the `HybridCore` class. The degree of
// exactness ensures that the rule will be exact for polynomial functions up to degree \f$K+L+1\f$
std::vector<HybridCore::qrule> quadT = hho.cell_qrule(iT, hho.Ldeg()+hho.K()+1);
// Compute values of basis functions, up to degree \f$(K+1)\$, at the quadrature nodes
std::vector<Eigen::ArrayXd> phi_quadT = hho.basis_quad('T', iT, quadT, hho.nhighorder_dofs());
// Compute values of gradients of basis functions, as well as `diff` times these gradients, at the quadrature nodes
std::vector<Eigen::ArrayXXd> dphiT_quadT = hho.grad_basis_quad(iT, quadT, hho.nhighorder_dofs());
// Create the mass matrix of basis functions up to degree \f$L\f$ and the stiffness matrix of the gradients
// kappa is a function that returns the diffusion tensor at the considered location
Eigen::MatrixXd MTT = hho.gram_matrix(phi_quadT, phi_quadT, hho.nlocal_cell_dofs(), hho.nhighorder_dofs(), quadT, true);
Eigen::MatrixXd StiffT = hho.gram_matrix(dphiT_quadT, dphiT_quadT, hho.nhighorder_dofs(), hho.nhighorder_dofs(), quadT, true, kappa);
// Grab the global index of the first edge of cell iT, compute quadrature nodes on this edge
size_t iF = mesh->cell(iT)->edge(0)->global_index();
std::vector<HybridCore::qrule> quadF = hho.edge_qrule(iF, 2*hho.K()+2);
// Compute the values of the cell basis function, and the edge basis function, at the quadrature nodes
// on the edge, and create the 'mass matrix' of cell-edge basis functions on the edge
std::vector<Eigen::ArrayXd> phiT_quadF = hho.basis_quad('T', iT, quadF, hho.nhighorder_dofs());
std::vector<Eigen::ArrayXd> phiF_quadF = hho.basis_quad('F', iF, quadF, hho.nlocal_edge_dofs());
Eigen::MatrixXd MFT = hho.gram_matrix(phiF_quadF, phiT_quadF, hho.nlocal_edge_dofs(), hho.nhighorder_dofs(), quadF, false);

At present, the quadrature rules available in the code support a total degree of exactness in the cells or on the edges up to 20.


The schemes currently available in HArD::Core2D are:

The directory runs contains BASH to run series of tests on families of meshes. The files data.sh describe the parameters of the test cases (polynomial degrees, boundary conditions, mesh families, etc.). The script produces results in the output directory, including a pdf file rate.pdf describing the rates of convergence in various energy norms.

To run the scripts as they are, you will need pdflatex and a FORTRAN compiler, and to adjust the Makefile to your compiler, to run compute_rates.f90 and compute the rates of convergence in the various norms.