skip to main content

Title: Adaptive partitioned methods for the time-accurate approximation of the evolutionary Stokes–Darcy system
This paper develops, analyzes and tests a time-accurate partitioned method for the Stokes-Darcy equations. The method combines a time filter and Backward Euler scheme, is second order accurate and provide, at no extra complexity, an estimated the temporal error. This approach post-processes the solutions of Backward Euler scheme by adding three lines to original codes to increase the time accuracy from first order to second order. We prove long time stability and error estimates of Backward Euler plus time filter with constant time stepsize. Moreover, we extend the approach to variable time stepsize and construct adaptive algorithms. Numerical tests show convergence of our method and support the theoretical analysis.
; ;
Award ID(s):
Publication Date:
Journal Name:
Computer methods in applied mechanics and engineering
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract We present a discontinuity aware quadrature (DAQ) rule and use it to develop implicit self-adaptive theta (SATh) schemes for the approximation of scalar hyperbolic conservation laws. Our SATh schemes require the solution of a system of two equations, one controlling the cell averages of the solution at the time levels, and the other controlling the space-time averages of the solution. These quantities are used within the DAQ rule to approximate the time integral of the hyperbolic flux function accurately, even when the solution may be discontinuous somewhere over the time interval. The result is a finite volume scheme using the theta time stepping method, with theta defined implicitly (or self-adaptively). Two schemes are developed, self-adaptive theta upstream weighted (SATh-up) for a monotone flux function using simple upstream stabilization, and self-adaptive theta Lax–Friedrichs (SATh-LF) using the Lax–Friedrichs numerical flux. We prove that DAQ is accurate to second order when there is a discontinuity in the solution and third order when it is smooth. We prove that SATh-up is unconditionally stable, provided that theta is set to be at least 1/2 (which means that SATh can be only first order accurate in general). We also prove that SATh-up satisfies the maximummore »principle, and is total variation diminishing under appropriate monotonicity and boundary conditions. General flux functions require the SATh-LF scheme, so we assess its accuracy through numerical examples in one and two space dimensions. These results suggest that SATh-LF is also stable and satisfies the maximum principle (at least at reasonable Courant-Friedrichs-Lewy numbers). Compared to the solutions of finite volume schemes using Crank–Nicolson and backward Euler time stepping, SATh-LF solutions often approach the accuracy of the former, but without oscillation, and they are numerically less diffuse than the latter.« less
  2. This report presents a low computational and cognitive complexity, stable, time accurate and adaptive method for the Navier-Stokes equations. The improved method requires a minimally intrusive modification to an existing program based on the fully implicit / backward Euler time discretization, does not add to the computational complexity, and is conceptually simple. The backward Euler approximation is simply post-processed with a two-step, linear time filter. The time filter additionally removes the overdamping of Backward Euler while remaining unconditionally energy stable, proven herein. Even for constant stepsizes, the method does not reduce to a standard / named time stepping method but is related to a known 2-parameter family of A-stable, two step, second order methods. Numerical tests confirm the predicted convergence rates and the improved predictions of flow quantities such as drag and lift.
  3. In this paper, we discuss the stability and error estimates of the fully discrete schemes for linear conservation laws, which consists of an arbitrary Lagrangian–Eulerian discontinuous Galerkin method in space and explicit total variation diminishing Runge–Kutta (TVD-RK) methods up to third order accuracy in time. The scaling arguments and the standard energy analysis are the key techniques used in our work. We present a rigorous proof to obtain stability for the three fully discrete schemes under suitable CFL conditions. With the help of the reference cell, the error equations are easy to establish and we derive the quasi-optimal error estimates in space and optimal convergence rates in time. For the Euler-forward scheme with piecewise constant elements, the second order TVD-RK method with piecewise linear elements and the third order TVD-RK scheme with polynomials of any order, the usual CFL condition is required, while for other cases, stronger time step restrictions are needed for the results to hold true. More precisely, the Euler-forward scheme needs τ ≤ ρh 2 and the second order TVD-RK scheme needs $ \tau \le \rho {h}^{\frac{4}{3}}$ for higher order polynomials in space, where τ and h are the time and maximum space step, respectively, and ρmore »is a positive constant independent of τ and h .« less
  4. The thermal radiative transfer (TRT) equations form an integro-differential system that describes the propagation and collisional interactions of photons. Computing accurate and efficient numerical solutions TRT are challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space that includes the independent variables of time, space, and velocity. In order to reduce the dimensionality of the phase space, classical approaches such as the P$_N$ (spherical harmonics) or the S$_N$ (discrete ordinates) ansatz are often used in the literature. In this work, we introduce a novel approach: the hybrid discrete (H$^T_N$) approximation to the radiative thermal transfer equations. This approach acquires desirable properties of both P$_N$ and S$_N$, and indeed reduces to each of these approximations in various limits: H$^1_N$ $\equiv$ P$_N$ and H$^T_0$ $\equiv$ S$_T$. We prove that H$^T_N$ results in a system of hyperbolic partial differential equations for all $T\ge 1$ and $N\ge 0$. Another challenge in solving the TRT system is the inherent stiffness due to the large timescale separation between propagation and collisions, especially in the diffusive (i.e., highly collisional) regime. This stiffness challenge can be partially overcome via implicit time integration, although fully implicit methods may become computationally expensivemore »due to the strong nonlinearity and system size. On the other hand, explicit time-stepping schemes that are not also asymptotic-preserving in the highly collisional limit require resolving the mean-free path between collisions, making such schemes prohibitively expensive. In this work we develop a numerical method that is based on a nodal discontinuous Galerkin discretization in space, coupled with a semi-implicit discretization in time. In particular, we make use of a second order explicit Runge-Kutta scheme for the streaming term and an implicit Euler scheme for the material coupling term. Furthermore, in order to solve the material energy equation implicitly after each predictor and corrector step, we linearize the temperature term using a Taylor expansion; this avoids the need for an iterative procedure, and therefore improves efficiency. In order to reduce unphysical oscillation, we apply a slope limiter after each time step. Finally, we conduct several numerical experiments to verify the accuracy, efficiency, and robustness of the H$^T_N$ ansatz and the numerical discretizations.« less
  5. In this paper, we study the central discontinuous Galerkin (DG) method on overlapping meshes for second order wave equations. We consider the first order hyperbolic system, which is equivalent to the second order scalar equation, and construct the corresponding central DG scheme. We then provide the stability analysis and the optimal error estimates for the proposed central DG scheme for one- and multi-dimensional cases with piecewise P k elements. The optimal error estimates are valid for uniform Cartesian meshes and polynomials of arbitrary degree k  ≥ 0. In particular, we adopt the techniques in Liu et al . ( SIAM J. Numer. Anal. 56 (2018) 520–541; ESAIM: M2AN 54 (2020) 705–726) and obtain the local projection that is crucial in deriving the optimal order of convergence. The construction of the projection here is more challenging since the unknowns are highly coupled in the proposed scheme. Dispersion analysis is performed on the proposed scheme for one dimensional problems, indicating that the numerical solution with P 1 elements reaches its minimum with a suitable parameter in the dissipation term. Several numerical examples including accuracy tests and long time simulation are presented to validate the theoretical results.