Bounds on Amplification Factors, Element-Node and Node-Node Equivalence for Square Finite Elements in Kinematic Shallow Water Equations

The upper and lower bounds of amplification factors of lumped finite element schemes are compared with nodal (integer or half-integer multiple of) eigen-value solutions of consistent finite element scheme at element and node levels of error analysis. The closeness or proximity between bounds on solutions of amplification factors and eigen-solutions reveals that the two methods, consistent and lumped finite element schemes are equivalent. The element error solutions of lumped mass matrix assumption and consistent nodal solution denotes the element-node error equivalence and the nodal solutions of all of the finite element schemes denote the node-node error equivalence for square finite elements in kinematic wave shallow water equations. The comparison plots of lumped and consistent finite element schemes are presented in this paper for illustration.

Staggered Semi-Implicit Hybrid Finite Volume/Finite Element Schemes for Turbulent and Non-Newtonian Flows

This paper presents a new family of semi-implicit hybrid finite volume/finite element schemes on edge-based staggered meshes for the numerical solution of the incompressible Reynolds-Averaged Navier–Stokes (RANS) equations in combination with the k−ε turbulence model. The rheology for calculating the laminar viscosity coefficient under consideration in this work is the one of a non-Newtonian Herschel–Bulkley (power-law) fluid with yield stress, which includes the Bingham fluid and classical Newtonian fluids as special cases. For the spatial discretization, we use edge-based staggered unstructured simplex meshes, as well as staggered non-uniform Cartesian grids. In order to get a simple and computationally efficient algorithm, we apply an operator splitting technique, where the hyperbolic convective terms of the RANS equations are discretized explicitly at the aid of a Godunov-type finite volume scheme, while the viscous parabolic terms, the elliptic pressure terms and the stiff algebraic source terms of the k−ε model are discretized implicitly. For the discretization of the elliptic pressure Poisson equation, we use classical conforming P1 and Q1 finite elements on triangles and rectangles, respectively. The implicit discretization of the viscous terms is mandatory for non-Newtonian fluids, since the apparent viscosity can tend to infinity for fluids with yield stress and certain power-law fluids. It is carried out with P1 finite elements on triangular simplex meshes and with finite volumes on rectangles. For Cartesian grids and more general orthogonal unstructured meshes, we can prove that our new scheme can preserve the positivity of k and ε. This is achieved via a special implicit discretization of the stiff algebraic relaxation source terms, using a suitable combination of the discrete evolution equations for the logarithms of k and ε. The method is applied to some classical academic benchmark problems for non-Newtonian and turbulent flows in two space dimensions, comparing the obtained numerical results with available exact or numerical reference solutions. In all cases, an excellent agreement is observed.

Efficient Temporal Third/Fourth-Order Finite Element Method for a Time-Fractional Mobile/Immobile Transport Equation with Smooth and Nonsmooth Data

In recent years, the numerical theory of fractional models has received more and more attention from researchers, due to the broad and important applications in materials and mechanics, anomalous diffusion processes and other physical phenomena. In this paper, we propose two efficient finite element schemes based on convolution quadrature for solving the time-fractional mobile/immobile transport equation with the smooth and nonsmooth data. In order to deal with the weak singularity of solution near t=0, we choose suitable corrections for the derived schemes to restore the third/fourth-order accuracy in time. Error estimates of the two fully discrete schemes are presented with respect to data regularity. Numerical examples are given to illustrate the effectiveness of the schemes.