pith. sign in

math.NA

Numerical Analysis

Numerical algorithms for problems in analysis and algebra, scientific computation

4
math.NA 2026-05-20 2 theorems

Discretization preserves area and volume in curvature flows at any order

by Ganghui Zhang, Boris D. Andrews +1 more

Arbitrary-order structure-preserving discretizations for geometric curvature flows

Auxiliary variables let the continuous area dissipation law hold exactly after arbitrary-order discretization.

Figure from the paper full image
abstract click to expand
Geometric flows, where an immersed manifold evolves in time according to its own geometry, exhibit important structural properties. For example, surface diffusion dissipates surface area while conserving volume; it is desirable to preserve these properties on discretization. This has motivated a substantial body of research on structure-preserving discretizations for these flows, albeit at low order in time. In this work, we present the first discretization of geometric curvature flows (curve shortening/mean curvature flow and curve/surface diffusion) that preserves the evolution of area and volume at arbitrary order in space and time. The key idea is to introduce auxiliary variables in a particular way so that the derivation of the area dissipation law can be replicated after discretization with continuous Petrov--Galerkin in time. These auxiliary variables are indicated by a general strategy for structure-preservation in time that applies to many other problems. The proposed scheme also preserves mesh quality in the same manner as the minimal deformation rate strategy. We demonstrate its structure-preserving properties and high-order convergence on several benchmark examples.
0
1
math.NA 2026-05-06 3 theorems

Reduced model speeds up crowd-contact simulations 30 to 60 times

by Giulia Sambataro, Virginie Ehrlacher

Model order reduction for parametrized variational inequalities: application to crowd motion

A greedy index-picker for contact forces plus a learned correction keeps agents from overlapping in dense crowds

Figure from the paper full image
abstract click to expand
This work investigates model order reduction for time-dependent parametrized variational inequalities, with a focus on discrete contact problems. As a prototypical example, we consider an agent-based crowd model [Maury et al., 2011] in which agent velocities are obtained at each time step from a constrained least-squares problem. Geometric parameter variations induce significant variability in both agent positions and contact forces, leading to a slowly decaying Kolmogorov $n$-width of the solution manifold. We propose a nonlinear approach that combines a linear reduced-order model with a deep-learning-based correction. The method utilizes a greedy index selection (gIS) algorithm for compressing Lagrange multipliers and Proper Orthogonal Decomposition (POD) applied to velocity snapshots. Additionally, we explore hyper-reduction techniques, comparing the Empirical Interpolation Method (EIM) and the Empirical Quadrature (EQ) procedure from both computational complexity and accuracy perspectives. Finally, we demonstrate the applicability of the methodology in a complex scenario involving many agents in a highly congested geometric configuration. This work represents the first attempt to apply model order reduction to a discrete contact problem of the type introduced in [Maury et al., 2011] and paves the way for future advancements in nonlinear MOR specifically for this class of problems.
0

browse all of math.NA → full archive · search · sub-categories