Search arXivSearch

arXiv · 2504.18903

Numerical analysis of an H(div)-conforming divergence-free DG method with a second-order explicit Runge-Kutta scheme for incompressible flows

Abstract

Recently, H(div)-conforming DG type methods coupled with Runge-Kutta (RK) time stepping have been widely employed for simulating high Reynolds number flows, with the convective terms treated explicitly. Although the analysis techniques of RKDG methods were well developed, the extension to incompressible flows is highly nontrivial due to the exactly divergence-free constraint, where the key lies in analyzing the convective terms. We neglect viscosity effects, and conduct an error analysis for an H(div)-conforming divergence-free DG method combined with a second-order explicit RK scheme, for the incompressible Euler equations. We derive an a priori error estimate of $O(h^{k+1 / 2}+τ^2)$ under a restrictive CFL condition $τ\lesssim h^{4 / 3}$ for polynomials of degree $k \geq 1$, where $h$ and $τ$ are the mesh size and time step size, respectively, assuming that the exact solution is smooth. For the case of linear polynomials, we investigate whether existing analytical techniques can relax the restrictive CFL condition to a standard CFL condition $τ\lesssim h$. It is demonstrated that the exactly divergence-free constraint prevents the application of these techniques. We conjecture that the error estimates for linear polynomials cannot be derived under a standard CFL condition. Finally, we mention that based on our analytical framework, our analytical results will be readily extended to the Navier-Stokes equations at high mesh Reynolds number, with the viscous and convective terms treated explicitly. Numerical experiments are conducted, supporting our analytical results and the conjecture for linear polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongbin Han, Yanren Hou, Xuehua Zhao. 2026-01-28. Numerical analysis of an H(div)-conforming divergence-free DG method with a second-order explicit Runge-Kutta scheme for incompressible flows. https://arxiv.org/abs/2504.18903

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

KEEP EXPLORING

Related papers

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

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

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