Partial differential equations on hypergraphs and networks of surfaces: derivation and hybrid discretizations

Abstract

We introduce a general, analytical framework to express and to approximate partial differential equations (PDEs) numerically on graphs and networks of surfaces---generalized by the term hypergraphs. To this end, we consider PDEs on hypergraphs as singular limits of PDEs in networks of thin domains (such as fault planes, pipes, etc.), and we observe that (mixed) hybrid formulations offer useful tools to formulate such PDEs. Thus, our numerical framework is based on hybrid finite element methods (in particular, the class of hybrid discontinuous Galerkin methods).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…