skip to main content


Title: Fully discrete best-approximation-type estimates in L ∞ ( I ; L 2(Ω) d ) for finite element discretizations of the transient Stokes equations
Abstract In this article, we obtain an optimal best-approximation-type result for fully discrete approximations of the transient Stokes problem. For the time discretization, we use the discontinuous Galerkin method and for the spatial discretization we use standard finite elements for the Stokes problem satisfying the discrete inf-sup condition. The analysis uses the technique of discrete maximal parabolic regularity. The results require only natural assumptions on the data and do not assume any additional smoothness of the solutions.  more » « less
Award ID(s):
1913133
NSF-PAR ID:
10353872
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
IMA Journal of Numerical Analysis
ISSN:
0272-4979
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In this paper we establish best approximation type estimates for the fully discrete Galerkin solutions of transient Stokes problem in $L^2(I;L^2(\Omega)^d)$ and $L^2(I;H^1(\Omega)^d)$ norms. These estimates fill the gap in the error analysis of the transient Stokes problems and have a number of applications. The analysis naturally extends to inhomogeneous parabolic problems. The best type $L^2(I;H^1(\Omega))$ error estimate are new even for scalar parabolic problems. 
    more » « less
  2. We construct and analyze a CutFEM discretization for the Stokes problem based on the Scott–Vogelius pair. The discrete piecewise polynomial spaces are defined on macro-element triangulations which are not fitted to the smooth physical domain. Boundary conditions are imposed via penalization through the help of a Nitsche-type discretization, whereas stability with respect to small and anisotropic cuts of the bulk elements is ensured by adding local ghost penalty stabilization terms. We show stability of the scheme as well as a divergence–free property of the discrete velocity outside an O ( h ) neighborhood of the boundary. To mitigate the error caused by the violation of the divergence–free condition, we introduce local grad–div stabilization. The error analysis shows that the grad–div parameter can scale like O ( h −1 ), allowing a rather heavy penalty for the violation of mass conservation, while still ensuring optimal order error estimates. 
    more » « less
  3. Abstract In this paper we consider a spatial discretization scheme with an adaptive grid for the Nagumo PDE. In particular, we consider a commonly used time dependent moving mesh method that aims to equidistribute the arclength of the solution under consideration. We assume that the discrete analogue of this equidistribution is strictly enforced, which allows us to reduce the effective dynamics to a scalar non-local problem with infinite range interactions. We show that this reduced problem is well-posed and obtain useful estimates on the resulting nonlinearities. In the sequel papers (Hupkes and Van Vleck in Travelling waves for adaptive grid discretizations of reaction diffusion systems II: linear theory; Travelling waves for adaptive grid discretizations of reaction diffusion systems III: nonlinear theory) we use these estimates to show that travelling waves persist under these adaptive spatial discretizations. 
    more » « less
  4. We consider the numerical solution of a fourth‐order total variation flow problem representing surface relaxation below the roughening temperature. Based on a regularization and scaling of the nonlinear fourth‐order parabolic equation, we perform an implicit discretization in time and a C0Interior Penalty Discontinuous Galerkin (C0IPDG) discretization in space. The C0IPDG approximation can be derived from a mixed formulation involving numerical flux functions where an appropriate choice of the flux functions allows to eliminate the discrete dual variable. The fully discrete problem can be interpreted as a parameter dependent nonlinear system with the discrete time as a parameter. It is solved by a predictor corrector continuation strategy featuring an adaptive choice of the time step sizes. A documentation of numerical results is provided illustrating the performance of the C0IPDG method and the predictor corrector continuation strategy. The existence and uniqueness of a solution of the C0IPDG method will be shown in the second part of this paper.

     
    more » « less
  5. Abstract

    Strain localization and resulting plasticity and failure play an important role in the evolution of the lithosphere. These phenomena are commonly modeled by Stokes flows with viscoplastic rheologies. The nonlinearities of these rheologies make the numerical solution of the resulting systems challenging, and iterative methods often converge slowly or not at all. Yet accurate solutions are critical for representing the physics. Moreover, for some rheology laws, aspects of solvability are still unknown. We study a basic but representative viscoplastic rheology law. The law involves a yield stress that is independent of the dynamic pressure, referred to as von Mises yield criterion. Two commonly used variants, perfect/ideal and composite viscoplasticity, are compared. We derive both variants from energy minimization principles, and we use this perspective to argue when solutions are unique. We propose a new stress‐velocity Newton solution algorithm that treats the stress as an independent variable during the Newton linearization but requires solution only of Stokes systems that are of the usual velocity‐pressure form. To study different solution algorithms, we implement 2‐D and 3‐D finite element discretizations, and we generate Stokes problems with up to 7 orders of magnitude viscosity contrasts, in which compression or tension results in significant nonlinear localization effects. Comparing the performance of the proposed Newton method with the standard Newton method and the Picard fixed‐point method, we observe a significant reduction in the number of iterations and improved stability with respect to problem nonlinearity, mesh refinement, and the polynomial order of the discretization.

     
    more » « less