An Incidence-Based Edge-Averaged Method for Convection-Diffusion Problems on Polytopal Meshes
math.NA, cs.NA
Submitted: 2026-10-31
Updated: 2026-10-31
Comments: 21 pages, 9 figures, submitted to the Special Section of SISC for the 2026 Colorado Conference on Iterative Methods
License: http://creativecommons.org/licenses/by/4.0/
The gist: We develop an incidence-based edge-averaged method for scalar convection-diffusion problems on convex polytopal meshes in arbitrary dimensions.
Abstract
We develop an incidence-based edge-averaged method for scalar convection-diffusion problems on convex polytopal meshes in arbitrary dimensions. The proposed method extends the classical edge-averaged finite-element scheme through a graph-theoretic formulation based on vertex-edge incidence matrices. We first establish this formulation on simplices in arbitrary dimensions and then extend it to convex polytopes by introducing complementary edges and generalized barycentric coordinates. A key ingredient is a matrix identity that relates the generalized Whitney edge mass matrix to a diagonal representation of the Poisson stiffness matrix, enabling an exponentially-fitted discretization expressed entirely in terms of nodal values and edge weights. We prove that the resulting stiffness matrix is a nonsingular M-matrix under suitable positivity and connectivity conditions, ensuring monotonicity and the discrete maximum principle. Numerical experiments on two- and three-dimensional simplicial and nonsimplicial meshes demonstrate first-order convergence in the H 1 semi-norm and stable, nonoscillatory solutions in convection-dominated regimes.
Sources
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers