Two‐dimensional shallow water equations by composite schemes

Composite schemes are formed by global composition of several Lax–Wendroff steps followed by a diffusive Lax–Friedrichs or WENO step, which filters out the oscillations around shocks typical for the Lax–Wendroff scheme. These schemes are applied to the shallow water equations in two dimensions. The Lax–Friedrichs composite is also formulated for a trapezoidal mesh, which is necessary in several example problems. The suitability of the composite schemes for the shallow water equations is demonstrated on several examples, including the circular dam break problem, the shock focusing problem and supercritical channel flow problems. Copyright © 1999 John Wiley & Sons, Ltd.     

A two‐dimensional finite volume morphodynamic model on unstructured triangular grids

We discuss the application of a finite volume method to morphodynamic models on unstructured triangular meshes. The model is based on coupling the shallow water equations for the hydrodynamics with a sediment transport equation for the morphodynamics. The finite volume method is formulated for the quasi‐steady approach and the coupled approach. In the first approach, the steady hydrodynamic state is calculated first and the corresponding water velocity is used in the sediment transport equation to be solved subsequently. The second approach solves the coupled hydrodynamics and sediment transport system within the same time step. The gradient fluxes are discretized using a modified Roe's scheme incorporating the sign of the Jacobian matrix in the morphodynamic system. A well‐balanced discretization is used for the treatment of source terms. We also describe an adaptive procedure in the finite volume method by monitoring the bed–load in the computational domain during its transport process. The method uses unstructured meshes, incorporates upwinded numerical fluxes and slope limiters to provide sharp resolution of steep bed gradients that may form in the approximate solution. Numerical results are shown for a test problem in the evolution of an initially hump‐shaped bed in a squared channel. For the considered morphodynamical regimes, the obtained results point out that the coupled approach performs better than the quasi‐steady approach only when the bed–load rapidly interacts with the hydrodynamics. Copyright © 2009 John Wiley & Sons, Ltd.     

Unstructured finite volume discretization of two‐dimensional depth‐averaged shallow water equations with porosity

This paper deals with the numerical discretization of two‐dimensional depth‐averaged models with porosity. The equations solved by these models are similar to the classic shallow water equations, but include additional terms to account for the effect of small‐scale impervious obstructions which are not resolved by the numerical mesh because their size is smaller or similar to the average mesh size. These small‐scale obstructions diminish the available storage volume on a given region, reduce the effective cross section for the water to flow, and increase the head losses due to additional drag forces and turbulence. In shallow water models with porosity these effects are modelled introducing an effective porosity parameter in the mass and momentum conservation equations, and including an additional drag source term in the momentum equations. This paper presents and compares two different numerical discretizations for the two‐dimensional shallow water equations with porosity, both of them are high‐order schemes. The numerical schemes proposed are well‐balanced, in the sense that they preserve naturally the exact hydrostatic solution without the need of high‐order corrections in the source terms. At the same time they are able to deal accurately with regions of zero porosity, where the water cannot flow. Several numerical test cases are used in order to verify the properties of the discretization schemes proposed. Copyright © 2009 John Wiley & Sons, Ltd.     

Solution of the 2D shallow water equations using the finite volume method on unstructured triangular meshes

A 2D, depth-integrated, free surface flow solver for the shallow water equations is developed and tested. The solver is implemented on unstructured triangular meshes and the solution methodology is based upon a Godunov-type second-order upwind finite volume formulation, whereby the inviscid fluxes of the system of equations are obtained using Roe's flux function. The eigensystem of the 2D shallow water equations is derived and is used for the construction of Roe's matrix on an unstructured mesh. The viscous terms of the shallow water equations are computed using a finite volume formulation which is second-order-accurate. Verification of the solution technique for the inviscid form of the governing equations as well as for the full system of equations is carried out by comparing the model output with documented published results and very good agreement is obtained. A numerical experiment is also conducted in order to evaluate the performance of the solution technique as applied to linear convection problems. The presented results show that the solution technique is robust. © 1997 John Wiley & Sons, Ltd.     

Simulation of single‐ and two‐phase flows on sliding unstructured meshes using finite volume method

The paper presents an efficient finite volume method for unstructured grids with rotating sliding parts composed of arbitrary polyhedral elements for both single‐ and two‐phase flows. Mathematical model used in computations is based on the ensemble averaged conservation equations. These equations are solved for each phase and in case of single‐phase flow reduce to the transient Reynolds‐averaged Navier–Stokes (TRANS) equations. Transient flow induced by rotating impellers is thus resolved in time. The use of unstructured grids allows an easy and flexible meshing for the entire flow domain. Polyhedral cell volumes are created on the arbitrary mesh interface placed between rotating and static parts. Cells within the rotating parts move each time step and the new faces are created on the arbitrary interfaces only, while the rest of the domain remain ‘topologically’ unchanged. Implicit discretization scheme allows a wide range of time‐step sizes, which further reduce the computational effort. Special attention is given to the interpolation practices used for the reconstruction of the face quantities. Mass fluxes are recalculated at the beginning of each time step by using an interpolation scheme, which enhances the coupling between the pressure and velocity fields. The model has been implemented into the commercially available CFD code AVL SWIFT (AVL AST, SWIFT Manual 3.1, AVL List GmbH, Graz, Austria, 2002). Single‐phase flow in a mixing vessel stirred by a six‐bladed Rushton‐type turbine and two‐phase flow in aerated stirred vessel with the four‐blade Rushton impeller are simulated. The results are compared with the available experimental data, and good agreement is observed. The proposed algorithm is proved to be both stable and accurate for single‐phase as well as for the two‐phase flows calculations. Copyright 2004 John Wiley & Sons, Ltd.     

An unstructured grid,three‐dimensional model based on the shallow water equations

A semi‐implicit finite difference model based on the three‐dimensional shallow water equations is modified to use unstructured grids. There are obvious advantages in using unstructured grids in problems with a complicated geometry. In this development, the concept of unstructured orthogonal grids is introduced and applied to this model. The governing differential equations are discretized by means of a semi‐implicit algorithm that is robust, stable and very efficient. The resulting model is relatively simple, conserves mass, can fit complicated boundaries and yet is sufficiently flexible to permit local mesh refinements in areas of interest. Moreover, the simulation of the flooding and drying is included in a natural and straightforward manner. These features are illustrated by a test case for studies of convergence rates and by examples of flooding on a river plain and flow in a shallow estuary. Copyright © 2000 John Wiley & Sons, Ltd.     

An eigenvector‐based linear reconstruction scheme for the shallow‐water equations on two‐dimensional unstructured meshes

This paper presents a new approach to MUSCL reconstruction for solving the shallow‐water equations on two‐dimensional unstructured meshes. The approach takes advantage of the particular structure of the shallow‐water equations. Indeed, their hyperbolic nature allows the flow variables to be expressed as a linear combination of the eigenvectors of the system. The particularity of the shallow‐water equations is that the coefficients of this combination only depend upon the water depth. Reconstructing only the water depth with second‐order accuracy and using only a first‐order reconstruction for the flow velocity proves to be as accurate as the classical MUSCL approach. The method also appears to be more robust in cases with very strong depth gradients such as the propagation of a wave on a dry bed. Since only one reconstruction is needed (against three reconstructions in the MUSCL approach) the EVR method is shown to be 1.4–5 times as fast as the classical MUSCL scheme, depending on the computational application. Copyright © 2006 John Wiley & Sons, Ltd.     

A well‐balanced stable generalized Riemann problem scheme for shallow water equations using adaptive moving unstructured triangular meshes

We propose a well‐balanced stable generalized Riemann problem (GRP) scheme for the shallow water equations with irregular bottom topography based on moving, adaptive, unstructured, triangular meshes. In order to stabilize the computations near equilibria, we use the Rankine–Hugoniot condition to remove a singularity from the GRP solver. Moreover, we develop a remapping onto the new mesh (after grid movement) based on equilibrium variables. This, together with the already established techniques, guarantees the well‐balancing. Numerical tests show the accuracy, efficiency, and robustness of the GRP moving mesh method: lake at rest solutions are preserved even when the underlying mesh is moving (e.g., mesh points are moved to regions of steep gradients), and various comparisons with fixed coarse and fine meshes demonstrate high resolution at relatively low cost. Copyright © 2013 John Wiley & Sons, Ltd.     

Improved multislope MUSCL reconstruction on unstructured grids for shallow water equations

In shallow water flow and transport modeling, the monotonic upstream‐centered scheme for conservation laws (MUSCL) is widely used to extend the original Godunov scheme to second‐order accuracy. The most important step in MUSCL‐type schemes is MUSCL reconstruction, which calculate‐extrapolates the values of independent variables from the cell center to the edge. The monotonicity of the scheme is preserved with the help of slope limiters that prevent the occurrence of new extrema during reconstruction. On structured grids, the calculation of the slope is straightforward and usually based on a 2‐point stencil that uses the cell centers of the neighbor cell and the so‐called far‐neighbor cell of the edge under consideration. On unstructured grids, the correct choice for the upwind slope becomes nontrivial. In this work, 2 novel total variation diminishing schemes are developed based on different techniques for calculating the upwind slope and the downwind slope. An additional treatment that stabilizes the scheme is discussed. The proposed techniques are compared to 2 existing MUSCL reconstruction techniques, and a detailed discussion of the results is given. It is shown that the proposed MUSCL reconstruction schemes obtain more accurate results with less numerical diffusion and higher efficiency.     

The Lagrange–Galerkin method for the two‐dimensional shallow water equations on adaptive grids

The weak Lagrange–Galerkin finite element method for the two‐dimensional shallow water equations on adaptive unstructured grids is presented. The equations are written in conservation form and the domains are discretized using triangular elements. Lagrangian methods integrate the governing equations along the characteristic curves, thus being well suited for resolving the non‐linearities introduced by the advection operator of the fluid dynamics equations. An additional fortuitous consequence of using Lagrangian methods is that the resulting spatial operator is self‐adjoint, thereby justifying the use of a Galerkin formulation; this formulation has been proven to be optimal for such differential operators. The weak Lagrange–Galerkin method automatically takes into account the dilation of the control volume, thereby resulting in a conservative scheme. The use of linear triangular elements permits the construction of accurate (by virtue of the second‐order spatial and temporal accuracies of the scheme) and efficient (by virtue of the less stringent Courant–Friedrich–Lewy (CFL) condition of Lagrangian methods) schemes on adaptive unstructured triangular grids. Lagrangian methods are natural candidates for use with adaptive unstructured grids because the resolution of the grid can be increased without having to decrease the time step in order to satisfy stability. An advancing front adaptive unstructured triangular mesh generator is presented. The highlight of this algorithm is that the weak Lagrange–Galerkin method is used to project the conservation variables from the old mesh onto the newly adapted mesh. In addition, two new schemes for computing the characteristic curves are presented: a composite mid‐point rule and a general family of Runge–Kutta schemes. Results for the two‐dimensional advection equation with and without time‐dependent velocity fields are illustrated to confirm the accuracy of the particle trajectories. Results for the two‐dimensional shallow water equations on a non‐linear soliton wave are presented to illustrate the power and flexibility of this strategy. Copyright © 2000 John Wiley & Sons, Ltd.     

An improved technique for solving two‐dimensional shallow water problems

A numerical model for solving the 2D shallow water equations is proposed herewith. This model is based on a finite volume technique in a generalized co‐ordinate system, coupled with a semi‐implicit splitting algorithm in which a Helmholtz equation is used for the surface elevation. Several benchmark problems have proven the good accuracy of this method in complex geometries. Nevertheless, several numerical perturbations were noted in the surface elevation. After finding the origin, a new numerical technique is suggested, to avoid these perturbations. Several severe tests are proposed to validate this technique. Copyright © 1999 John Wiley & Sons, Ltd.     

Solution of incompressible flows with or without a free surface using the finite volume method on unstructured triangular meshes

An incompressible Navier–Stokes solver based on a cell‐centre finite volume formulation for unstructured triangular meshes is developed and tested. The solution methodology makes use of pseudocompressibility, whereby the convective terms are computed using a Godunov‐type second‐order upwind finite volume formulation. The evolution of the solution in time is obtained by subiterating the equations in pseudotime for each physical time step, with the pseudotime step set equal to infinity. For flows with a free surface the computational mesh is fitted to the free surface boundary at each time step, with the free surface elevation satisfying a kinematic boundary condition. A ‘leakage coefficient’, ε, is introduced for the calculation of flows with a free surface in order to control the leakage of flow through the free surface. This allows the assumption of stationarity of mesh points to be made during the course of pseudotime iteration. The solver is tested by comparing the output with a wide range of documented published results, both for flows with and without a free surface. The presented results show that the solver is robust. © 1999 John Wiley & Sons, Ltd.     

Edge‐based finite element method for shallow water equations

This paper describes an edge‐based implementation of the generalized residual minimum (GMRES) solver for the fully coupled solution of non‐linear systems arising from finite element discretization of shallow water equations (SWEs). The gain in terms of memory, floating point operations and indirect addressing is quantified for semi‐discrete and space–time analyses. Stabilized formulations, including Petrov–Galerkin models and discontinuity‐capturing operators, are also discussed for both types of discretization. Results illustrating the quality of the stabilized solutions and the advantages of using the edge‐based approach are presented at the end of the paper. Copyright © 2001 John Wiley & Sons, Ltd.     

Finite‐volume multi‐stage schemes for shallow‐water flow simulations

A finite‐volume multi‐stage (FMUSTA) scheme is proposed for simulating the free‐surface shallow‐water flows with the hydraulic shocks. On the basis of the multi‐stage (MUSTA) method, the original Riemann problem is transformed to an independent MUSTA mesh. The local Lax–Friedrichs scheme is then adopted for solving the solution of the Riemann problem at the cell interface on the MUSTA mesh. The resulting first‐order monotonic FMUSTA scheme, which does not require the use of the eigenstructure and the special treatment of entropy fixes, has the generality as well as simplicity. In order to achieve the high‐resolution property, the monotonic upstream schemes for conservation laws (MUSCL) method are used. For modeling shallow‐water flows with source terms, the surface gradient method (SGM) is adopted. The proposed schemes are verified using the simulations of six shallow‐water problems, including the 1D idealized dam breaking, the steady transcritical flow over a hump, the 2D oblique hydraulic jump, the circular dam breaking and two dam‐break experiments. The simulated results by the proposed schemes are in satisfactory agreement with the exact solutions and experimental data. It is demonstrated that the proposed FMUSTA schemes have superior overall numerical accuracy among the schemes tested such as the commonly adopted Roe and HLL schemes. Copyright © 2007 John Wiley & Sons, Ltd.     

An immersed boundary method for unstructured meshes in depth averaged shallow water models

The representation of geometries as buildings, flood barriers or dikes in free surface flow models implies tedious and time‐consuming operations in order to define accurately the shape of these objects when using a body fitted numerical mesh. The immersed boundary method is an alternative way to define solid bodies inside the computational domain without the need of fitting the mesh boundaries to the shape of the object. In the direct forcing immersed boundary method, a solid body is represented by a grid of Lagrangian markers, which define its shape and which are independent from the fluid Eulerian mesh. This paper presents a new implementation of the immersed boundary method in an unstructured finite volume solver for the 2D shallow water equations. Moving least‐squares is used to transmit information between the grid of Lagrangian markers and the fluid Eulerian mesh. The performance of the proposed implementation is analysed in three test cases involving different flow conditions: the flow around a spur dike, a dam break flow with an isolated obstacle and the flow around an array of obstacles. A very good agreement between the classic body fitted approach and the immersed boundary method was found. The differences between the results obtained with both methods are less relevant than the errors because of the intrinsic shallow water assumptions. Copyright © 2015 John Wiley & Sons, Ltd.     

A CIP/multi‐moment finite volume method for shallow water equations with source terms

A novel finite volume method has been presented to solve the shallow water equations. In addition to the volume‐integrated average (VIA) for each mesh cell, the surface‐integrated average (SIA) is also treated as the model variable and is independently predicted. The numerical reconstruction is conducted based on both the VIA and the SIA. Different approaches are used to update VIA and SIA separately. The SIA is updated by a semi‐Lagrangian scheme in terms of the Riemann invariants of the shallow water equations, while the VIA is computed by a flux‐based finite volume formulation and is thus exactly conserved. Numerical oscillation can be effectively avoided through the use of a non‐oscillatory interpolation function. The numerical formulations for both SIA and VIA moments maintain exactly the balance between the fluxes and the source terms. 1D and 2D numerical formulations are validated with numerical experiments. Copyright © 2007 John Wiley & Sons, Ltd.     

基于非结构网格求解二维浅水方程的高精度有限体积方法

采用HLL格式,在三角形非结构网格下采用有限体积离散,建立了求解二维浅水方程的高精度的数值模型.本文采用多维重构和多维限制器的方法来获得高精度的空间格式以及防止非物理振荡的产生,时间离散采用三阶Runge-Kutta法以获得高阶的时间精度.基于三角形网格,底坡源项采用简单的斜底模型离散,为保证计算格式的和谐性,对经典的HLL格式计算的数值通量中的静水压力项进行了修正.算例证明本文提出的方法的和谐性并具有高精度的间断捕捉能力和稳定性.     

A domain decomposition approach to finite volume solutions of the Euler equations on unstructured triangular meshes

We report on our recent efforts on the formulation and the evaluation of a domain decomposition algorithm for the parallel solution of two‐dimensional compressible inviscid flows. The starting point is a flow solver for the Euler equations, which is based on a mixed finite element/finite volume formulation on unstructured triangular meshes. Time integration of the resulting semi‐discrete equations is obtained using a linearized backward Euler implicit scheme. As a result, each pseudo‐time step requires the solution of a sparse linear system for the flow variables. In this study, a non‐overlapping domain decomposition algorithm is used for advancing the solution at each implicit time step. First, we formulate an additive Schwarz algorithm using appropriate matching conditions at the subdomain interfaces. In accordance with the hyperbolic nature of the Euler equations, these transmission conditions are Dirichlet conditions for the characteristic variables corresponding to incoming waves. Then, we introduce interface operators that allow us to express the domain decomposition algorithm as a Richardson‐type iteration on the interface unknowns. Algebraically speaking, the Schwarz algorithm is equivalent to a Jacobi iteration applied to a linear system whose matrix has a block structure. A substructuring technique can be applied to this matrix in order to obtain a fully implicit scheme in terms of interface unknowns. In our approach, the interface unknowns are numerical (normal) fluxes. Copyright © 2001 John Wiley & Sons, Ltd.