Derives discrete weak duality for hybrid high-order methods on convex minimization problems, yielding a priori rates on polyhedral meshes and a posteriori estimates via postprocessing that drive adaptive meshing.
Di Pietro, J´ erˆ ome Droniou, and Francesca Rapetti,Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra, Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Discrete weak duality of hybrid high-order methods for convex minimization problems
Derives discrete weak duality for hybrid high-order methods on convex minimization problems, yielding a priori rates on polyhedral meshes and a posteriori estimates via postprocessing that drive adaptive meshing.