A Time Marching Method for Internal Flows Using Curvilinear Coordinates

Author(s):  
M. Reggio ◽  
R. Camarero

A time-marching method for flows with nozzle and blade-to-blade applications is presented. The approach developed consists of solving the basic conservation equations of gas dynamics in conservation form on a curvilinear grid. The assumption of quasi-streamlines is satisfied by generating a body-fitted coordinate system. Stability is maintained by upwind differencing of the mass and momentum fluxes and downwind differencing of the pressure. The method is then applied to the solution of a plane and axisymmetric nozzle and to VKI’s gas turbine blade and compared to previous computations and experiments.

2018 ◽  
Vol 13 (3) ◽  
pp. 59-63 ◽  
Author(s):  
D.T. Siraeva

Equations of hydrodynamic type with the equation of state in the form of pressure separated into a sum of density and entropy functions are considered. Such a system of equations admits a twelve-dimensional Lie algebra. In the case of the equation of state of the general form, the equations of gas dynamics admit an eleven-dimensional Lie algebra. For both Lie algebras the optimal systems of non-similar subalgebras are constructed. In this paper two partially invariant submodels of rank 3 defect 1 are constructed for two-dimensional subalgebras of the twelve-dimensional Lie algebra. The reduction of the constructed submodels to invariant submodels of eleven-dimensional and twelve-dimensional Lie algebras is proved.


1977 ◽  
Vol 99 (1) ◽  
pp. 53-62 ◽  
Author(s):  
Jean-Pierre Veuillot

The equations of the through flow are obtained by an asymptotic theory valid when the blade pitch is small. An iterative method determines the meridian stream function, the circulation, and the density. The various equations are discretized in an orthogonal mesh and solved by classical finite difference techniques. The calculation of the steady transonic blade-to-blade flow is achieved by a time marching method using the MacCormack scheme. The space discretization is obtained either by a finite difference approach or by a finite volume approach. Numerical applications are presented.


2021 ◽  
Author(s):  
Alexander Shchepetkin

<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>


2002 ◽  
Vol 124 (5) ◽  
pp. 812-819 ◽  
Author(s):  
S. L. Lee ◽  
Y. F. Chen

The NAPPLE algorithm for incompressible viscous flow on Cartesian grid system is extended to nonorthogonal curvilinear grid system in this paper. A pressure-linked equation is obtained by substituting the discretized momentum equations into the discretized continuity equation. Instead of employing a velocity interpolation such as pressure-weighted interpolation method (PWIM), a particular approximation is adopted to circumvent the checkerboard error such that the solution does not depend on the under-relaxation factor. This is a distinctive feature of the present method. Furthermore, the pressure is directly solved from the pressure-linked equation without recourse to a pressure-correction equation. In the use of the NAPPLE algorithm, solving the pressure-linked equation is as simple as solving a heat conduction equation. Through two well-documented examples, performance of the NAPPLE algorithm is validated for both buoyancy-driven and pressure-driven flows.


Sign in / Sign up

Export Citation Format

Share Document