Papers › An arbitrary-order fully discrete Stokes complex on general polyhedral meshes
An arbitrary-order fully discrete Stokes complex on general polyhedral meshes
Marien-Lorenzo Hanot
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we present an arbitrary-order fully discrete Stokes complex on general polyhedral meshes. We enriche the fully discrete de Rham complex with the addition of a full gradient operator defined on vector fields and fitting into the complex. We show a complete set of results on the novelties of this complex: exactness properties, uniform Poincar\'e inequalities and primal and adjoint consistency. The Stokes complex is especially well suited for problem involving Jacobian, divergence and curl, like the Stokes problem or magnetohydrodynamic systems. The framework developed here eases the design and analysis of scheme for such problems. Schemes built that way are nonconforming and benefit from the exactness of the complex. We illustrate with the design and study of a scheme to solve the Stokes equations and validate the convergence rates with various numerical tests.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections