Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1802.10585

A staggered semi-implicit hybrid FV/FE projection method for weakly compressible flows

A. Bermúdez·S. Busto·M. Dumbser·J. L. Ferrín·L. Saavedra·M. E. Vázquez-Cendón
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we present a novel staggered semi-implicit hybrid finite-volume/finite-element (FV/FE) method for the resolution of weakly compressible flows in two and three space dimensions. The pressure-based methodology introduced in Bermúdez et al. 2014 and Busto et al. 2018 for viscous incompressible flows is extended here to solve the compressible Navier-Stokes equations. Instead of considering the classical system including the energy conservation equation, we replace it by the pressure evolution equation written in non-conservative form. To ease the discretization of complex spatial domains, face-type unstructured staggered meshes are considered. A projection method allows the decoupling of the computation of the density and linear momentum variables from the pressure. Then, an explicit finite volume scheme is used for the resolution of the transport diffusion equations on the dual mesh, whereas the pressure system is solved implicitly by using continuous finite elements defined on the primal simplex mesh. Consequently, the CFL stability condition depends only on the flow velocity, avoiding the severe time restrictions that might be imposed by the sound velocity in the weakly compressible regime. High order of accuracy in space and time of the transport diffusion stage is attained using a local ADER (LADER) methodology. Moreover, also the CVC Kolgan-type second order in space and first order in time scheme is considered. To prevent spurious oscillations in the presence of shocks, an ENO-based reconstruction, the minmod limiter or the Barth-Jespersen limiter are employed. To show the validity and robustness of our novel staggered semi-implicit hybrid FV/FE scheme, several benchmarks are analysed, showing a good agreement with available exact solutions and numerical reference data from low Mach numbers, up to Mach numbers of the order of unity.

Explore related subjects

math.NAcs.NAmath.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Bermúdez, S. Busto, M. Dumbser, J. L. Ferrín, L. Saavedra, M. E. Vázquez-Cendón. 2020-06-15. A staggered semi-implicit hybrid FV/FE projection method for weakly compressible flows. https://arxiv.org/abs/1802.10585

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↗