Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.23506

On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods

Elena Gaburro·Matej Klima·Mauro Bonafini·Maurizio Tavelli
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work investigates a novel approach for the high order evolution of hyperbolic PDEs using ADER discontinuous Galerkin schemes within a direct Arbitrary-Lagrangian-Eulerian (ALE) framework on 3D moving polyhedral meshes with topology changes. Our direct ALE method is based on the PDE integration over 4D (3D+time) space-time control volumes connecting the elements of two subsequent tessellations, so to simultaneously evolve the solution both in time and between the two different meshes in an effective and high order manner. In this way, we also avoid any complex and expensive projection-reconstruction techniques and any mesh intersection operation typical of indirect ALE schemes. The crucial step consists in the strategy for building space-time control volumes that also connect elements with different shapes and neighborhoods due to a change in topology. In fact, simply linking existing elements by collapsing or expanding their edges would leave a "hole" in the space-time domain. To fill it, we introduce additional degenerate elements that we call hole-like elements. These are 4D objects with zero 3D volume at both the beginning and end of the timestep, but which possess a strictly non-zero 4D space-time volume. Given the uniqueness of this space-time approach in 3D+time and the necessity of characterizing the geometry of such elements, the main objective of this paper is the formal geometrical and numerical description of the method as well as the presentation of new and intuitive visualization strategies. In particular, we provide a detailed characterization of the hole-like elements arising in correspondence to 2-3, 3-2, and 4-4 flips on the underlying Delaunay tetrahedralization. Finally, we numerically show that the method is fully conservative, satisfies the GCL and maintains the correct order of convergence even in the presence of frequent topology changes.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Gaburro, Matej Klima, Mauro Bonafini, Maurizio Tavelli. 2026-08-22. On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods. https://arxiv.org/abs/2605.23506

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗