Pressure-Robust Enriched Galerkin Methods for Navier-Stokes Equations

Chun Song; Minfu Feng

Home/Archive/arXiv

arXiv · 2511.20240

Pressure-Robust Enriched Galerkin Methods for Navier-Stokes Equations

Chun Song·Minfu Feng

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents an enriched Galerkin (EG) finite element method for the incompressible Navier--Stokes equations. The method augments continuous piecewise linear velocity spaces with elementwise bubble functions, yielding a locally conservative velocity approximation while retaining the efficiency of low-order continuous elements. The viscous term is discretized using a symmetric interior penalty formulation, and the divergence constraint is imposed through a stable pressure space. To enhance the robustness of the velocity approximation with respect to the pressure, a reconstruction operator is introduced in the convective and coupling terms, resulting in a pressure-robust scheme whose accuracy does not deteriorate for small viscosities. Both Picard and Newton linearizations are formulated in a fully discrete manner, and the corresponding linear systems are assembled efficiently at each iteration. Optimal a~priori error estimates are established for the velocity in the mesh-dependent energy norm and for the pressure in the $L^2$ norm. Two representative numerical experiments are presented: a smooth manufactured solution and the lid-driven cavity flow. The numerical results confirm the theoretical convergence rates, demonstrating first-order convergence of the velocity in the energy norm, second-order convergence in the $L^2$ norm, and first-order convergence of the pressure. The proposed EG scheme accurately captures characteristic flow structures, illustrating its effectiveness and robustness for incompressible flow simulation.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Chun Song, Minfu Feng. 2026-09-03. Pressure-Robust Enriched Galerkin Methods for Navier-Stokes Equations. https://arxiv.org/abs/2511.20240

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

Discover connections

cs.NA subject math.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

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↗