Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1602.01703

Direct Arbitrary-Lagrangian-Eulerian finite volume schemes on moving nonconforming unstructured meshes

Elena Gaburro·Michael Dumbser·Manuel J. Castro
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present a novel second-order accurate Arbitrary-Lagrangian-Eulerian (ALE) finite volume scheme on moving nonconforming polygonal grids, in order to avoid the typical mesh distortion caused by shear flows in Lagrangian-type methods. In our new approach the nonconforming element interfaces are not defined by the user, but they are automatically detected by the algorithm if the tangential velocity difference across an element interface is sufficiently large. The grid nodes that are sufficiently far away from a shear wave are moved with a standard node solver, while at the interface we insert a new set of nodes that can slide in a nonconforming manner. In this way, the elements on both sides of the shear wave can move with a different velocity, without producing highly distorted elements. The core of the proposed method is the use of a space-time conservation formulation in the construction of the final finite volume scheme, which completely avoids the need of an additional remapping stage and ensures that the geometric conservation law (GCL) is automatically satisfied. Moreover, the mesh quality remains high and, as a direct consequence, also the time step remains almost constant in time, even for highly sheared vortex flows. The accuracy of the new scheme has been further improved by incorporating a special well balancing technique that is able to maintain particular stationary solutions of the governing PDE system up to machine precision. A large set of numerical tests has been carried out in order to check the accuracy and the robustness of the new method. In particular we have compared the results for a steady vortex in equilibrium solved with a standard conforming ALE method and with our new nonconforming ALE scheme, to show that the new nonconforming scheme is able to avoid mesh distortion even after very long simulation times.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Gaburro, Michael Dumbser, Manuel J. Castro. 2017-10-29. Direct Arbitrary-Lagrangian-Eulerian finite volume schemes on moving nonconforming unstructured meshes. https://doi.org/10.1016/j.compfluid.2017.09.022

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↗