An improved third-order HWCNS for compressible flow simulation on curvilinear grids

Due to the very high requirements on the quality of computational grids, stability property and computational efficiency, the application of high-order schemes to complex flow simulation is greatly constrained. In order to solve these problems, the third-order hybrid cell-edge and cell-node weighted compact nonlinear scheme (HWCNS3) is improved by introducing a new nonlinear weighting mechanism. The new scheme uses only the central stencil to reconstruct the cell boundary value, which makes the convergence of the scheme more stable. The application of the scheme to Euler equations on curvilinear grids is also discussed. Numerical results show that the new HWCNS3 achieves the expected order in smooth regions, captures discontinuities sharply without obvious oscillation, has higher resolution than the original one and preserves freestream and vortex on curvilinear grids.

A High-Order Finite-Difference Method on Staggered Curvilinear Grids for Seismic Wave Propagation Applications with Topography

ABSTRACT We developed a 3D elastic wave propagation solver that supports topography using staggered curvilinear grids. Our method achieves comparable accuracy to the classical fourth-order staggered grid velocity–stress finite-difference method on a Cartesian grid. We show that the method is provably stable using summation-by-parts operators and weakly imposed boundary conditions via penalty terms. The maximum stable timestep obeys a relationship that depends on the topography-induced grid stretching along the vertical axis. The solutions from the approach are in excellent agreement with verified results for a Gaussian-shaped hill and for a complex topographic model. Compared with a Cartesian grid, the curvilinear grid adds negligible memory requirements, but requires longer simulation times due to smaller timesteps for complex topography. The code shows 94% weak scaling efficiency up to 1014 graphic processing units.

An Improved Third-order HWCNS for Compressible Flow Simulation on Curvilinear Grids

Due to the very high requirements on the quality of computational grids, stability property and computational efficiency, the application of high-order schemes to complex flow simulation is greatly constrained. In order to solve these problems, the third-order hybrid cell-edge and cell-node weighted compact nonlinear scheme(HWCNS3) is improved by introducing a new nonlinear weighting mechanism. The new scheme uses only the central stencil to reconstruct the cell boundary value, which makes the convergence of the scheme more stable. The application of the scheme to Euler equation on curvilinear grids is also discussed. Numerical results show that the new HWCNS3 achieves the expected order in smooth region, captures discontinuities sharply without obvious oscillation, has higher resolution than the original one and preserves freestream and vortex on curvilinear grids.

IZOGRID - A new tool for setting up orthogonal curvilinear grids for oceanic modeling

<p>Virtually all modern structured-grid ocean modeling codes are written in orthogonal curvilinear coordinates in horizontal directions, yet the overwhelming majority of modeling studies are done using very simple grid setups - mostly rectangular patches of Mercator grids rotated to proper orientation.  Furthermore, in communities like ROMS, we even observe decline in both interest and skill of creating curvilinear grids over long term.  This is caused primarily by the dissatisfaction with the existing tools and procedures for grid generation due to inability to achieve acceptable level of orthogonality errors.  Clearly, this causes underutilization of full potential of the modeling codes.</p><p>To address these issues, a new algorithm for constructing orthogonal curvilinear grids on a sphere for a fairly general geometric shape of the modeling region is implemented as a compile-once - use forever software package.  Theoretically one can use Schwartz-Christoffel conformal transform to project a curvilinear contour onto rectangle, then draw a Cartesian grid on it, and, finally, apply the inverse transform (the one which maps the rectangle back to the original contour) to the Cartesian grid in order to obtain the orthogonal curvilinear grid which fits the contour.  However, in the general case, the forward transform is an iterative algorithm of Ives and Zacharias (1989), and it is not easily invertible, nor it is feasible to apply it to a two-dimensional object (grid) as opposite to just one-dimensional (contour) because of very large number of operations.  To circumvent this, the core of the new algorithm is essentially based on the numerical solution of the inverse problem by an iterative procedure - finding such distribution of grid points along the sides of curvilinear contour, that the direct conformal mapping of it onto rectangle turns this distribution into uniform one along each side of the rectangle.  Along its way, this procedure also finds the correct aspect ratio, which makes it possible to automatically chose the numbers of grid points in each direction to yield locally the same grid spacing in both horizontal directions.  The iterative procedure itself turns out to be multilevel - i.e. an iterative loop built around another, internal iterative procedure.  Thereafter, knowing this distribution, the grid nodes inside the region are obtained solving a Dirichlet elliptic problem.  The latter is fairly standard, except that we use "mehrstellenverfahren" discretization, which yields fourth-order accuracy in the case of equal grid spacing in both directions.  The curvilinear contour is generated using splines (cubic or quintic) passing through the user-specified reference points, and, unlike all previous tools designed for the same purpose, it guarantees by the construction to yield the exact 90-degree angles at the corners of the curvilinear perimeter of grid.</p><p>Overall, with the combination of all the new features, it is shown that it is possible to achieve very small, previously unattainable level of orthogonality errors, as well as make it isotropic -- local distances between grid nodes in both directions are equal to each other.</p>

On the construction of orthogonal curvilinear grids for regional oceanic modeling: algorithm and user guide

A new algorithm for constructing orthogonal curvilinear grids on a sphere for a fairly general geometric shape of the modeling region is implemented as a “compile-once - use forever” software package. It is based on the numerical solution of the inverse problem by an iterative procedure -- finding such distribution of grid points along its perimeter, so that the conformal transformation of the perimeter into a rectangle turns this distribution into uniform one. The iterative procedure itself turns out to be multilevel - i.e. an iterative loop built around another, internal iterative procedure. Thereafter, knowing this distribution, the grid nodes inside the region are obtained solving an elliptic problem. It is shown that it was possible to obtain the exact orthogonality of the perimeter at the corners of the grid, to achieve very small, previously unattainable level of orthogonality errors, as well as make it isotropic -- local distances between grid nodes about both directions are equal to each other.