Solvers for mixed finite element problems using Poincaré operators based on spanning trees

We propose an explicit construction of Poincaré operators for the lowest order finite element spaces, by employing spanning trees in the grid. In turn, a stable decomposition of the discrete spaces is derived that leads to an efficient numerical solver for the Hodge-Laplace problem. The solver consists of solving four smaller, symmetric positive definite systems. We moreover place the decomposition in the framework of auxiliary space preconditioning and propose robust preconditioners for elliptic mixed finite element problems. The efficiency of the approach is validated by numerical experiments.