Fully and semi-implicit robust space–time DG methods for the incompressible Navier–Stokes equations

We carry out a stability and convergence analysis of a fully discrete scheme for the time-dependent Navier–Stokes equations resulting from combining an [Formula: see text]-conforming discontinuous Galerkin spatial discretization, and a discontinuous Galerkin time-stepping scheme. Such a scheme is proven to be pressure robust and Reynolds semi-robust. Standard techniques can be used to analyze only the case of lowest-order approximations in time. Therefore, we use some nonstandard test functions to prove existence of discrete solutions, unconditional stability, and quasi-optimal convergence rates for any degree of approximation in time. In particular, a continuous dependence of the discrete solution on the data of the problem, and quasi-optimal convergence rates for low and high Reynolds numbers are proven in an energy norm including the term [Formula: see text] for the velocity. In addition to the standard discontinuous Galerkin time-stepping scheme, which is fully implicit, we propose and analyze a novel high-order semi-implicit version that avoids the need of solving nonlinear systems of equations after the first time slab, thus improving the efficiency of the method. Some numerical experiments validating our theoretical results are presented for both schemes.

Authors

Institutions

Publication Details

Journal
Mathematical Models and Methods in Applied Sciences
Published
2025-06-27
DOI
https://doi.org/10.1142/s0218202525500460
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fully and semi-implicit robust space–time DG methods for the incompressible Navier–Stokes equations

Franco Dassi, Sergio Gómez, L. Beirão da Veiga
Mathematical Models and Methods in Applied Sciences
Advanced Numerical Methods in Computational Mathematics
article

Fully and semi-implicit robust space–time DG methods for the incompressible Navier–Stokes equations

Franco Dassi, Sergio Gómez, L. Beirão da Veiga
article en

Abstract

We carry out a stability and convergence analysis of a fully discrete scheme for the time-dependent Navier–Stokes equations resulting from combining an [Formula: see text]-conforming discontinuous Galerkin spatial discretization, and a discontinuous Galerkin time-stepping scheme. Such a scheme is proven to be pressure robust and Reynolds semi-robust. Standard techniques can be used to analyze only the case of lowest-order approximations in time. Therefore, we use some nonstandard test functions to prove existence of discrete solutions, unconditional stability, and quasi-optimal convergence rates for any degree of approximation in time. In particular, a continuous dependence of the discrete solution on the data of the problem, and quasi-optimal convergence rates for low and high Reynolds numbers are proven in an energy norm including the term [Formula: see text] for the velocity. In addition to the standard discontinuous Galerkin time-stepping scheme, which is fully implicit, we propose and analyze a novel high-order semi-implicit version that avoids the need of solving nonlinear systems of equations after the first time slab, thus improving the efficiency of the method. Some numerical experiments validating our theoretical results are presented for both schemes.

Mathematical Models and Methods in Applied SciencesVol. 35(12)
Istituto di Matematica Applicata e Tecnologie Informatiche (IT), University of Milano-Bicocca (IT)
European Commission
Openalex Percentile: Top 84%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.