No abstract

No abstract

No abstract

No abstract

No abstract

Computational predictions of the transient flow in multiple blade row turbomachinery configurations are considered. For cases with unequal numbers of blades/vanes in adjacent rows (“unequal pitch”) a computation over multiple passages is required to ensure that simple periodic boundary conditions can be applied. For typical geometries, a time accurate solution requires computation over a significant portion of the wheel. A number of methods are now available that address the issue of unequal pitch while significantly reducing the required computation time. Considered here are a family of related methods (“Transformation Methods”) which transform the equations, the solution or the boundary conditions in a manner that appropriately recognizes the periodicity of the flow, yet do not require solution of all or a large number of the blades in a given row. This paper will concentrate on comparing and contrasting these numerical treatments. The first method, known as “Profile Transformation”, overcomes the unequal pitch problem by simply scaling the flow profile that is communicated between neighboring blade rows, yet maintains the correct blade geometry and pitch ratio. The next method, known as the “Fourier Transformation” method applies phase shifted boundary conditions. To avoid storing the time history on the periodic boundary, a Fourier series method is used to store information at the blade passing frequency (BPF) and its harmonics. In the final method, a pitch-wise time transformation is performed that ensures that the boundary is truly periodic in the transformed space. This method is referred to as “Time Transformation”. The three methods have recently been added to a commercially-available CFD solver which is pressure based and implicit in formulation. The results are compared and contrasted on two turbine cases of engineering significance: a high pressure power turbine stage and a low pressure aircraft engine turbine stage. The relative convergence rates and solution times are examined together with the effect of non blade passing frequencies in the flow field. Transient solution times are compared with more conventional steady stage analyses, and in addition detailed flow physics such as boundary layer transition location are examined and reported.

Computational predictions of the transient flow in turbine blade rows are considered. Adjacent blade rows typically contain unequal numbers of blades and vanes, requiring a computation over multiple passages per row to permit application of simple periodic boundary conditions. For typical geometries, use of conventional solution methods requires computation over all or a significant portion of the wheel to ensure a time accurate solution. The computational load is significantly reduced by methods which enable a one or two-passage solution to accurately model the full wheel (or part wheel, if applicable) solution. In this work, three methods are used: Profile Transformation, Fourier Transformation and Time Transformation. This paper will concentrate on the evaluation of these methods on two turbine geometries. The first test case is a frozen gust analysis for a high pressure transonic turbine; the geometry includes hub and casing cavities together with a complex tip. The second test case is a low pressure turbine stage run over a range of operating points. Comparisons between the various methods and the equivalent part wheel periodic solution are made to demonstrate the accuracy and computational efficiency of the transformation methods.

This paper describes an algorithm for computing two-dimensional transonic, inviscid flows. The solution procedure uses an explicit Runge-Kutta time marching, finite volume scheme. The computational grid is an irregular triangulation. The algorithm can be applied to arbitrary two-dimensional geometries. When used for analyzing flows in blade rows, terms representing the effects of changes in streamsheet thickness and radius, and the effects of rotation, are included. The solution is begun on a coarse grid, and grid points are added adaptively during the solution process, using criteria such as pressure and velocity gradients. Advantages claimed for this approach are (a) the capability of handling arbitrary geometries (e.g., multiple, dissimilar blades), (b) the ability to resolve small-scale features (e.g., flows around leading edges, shocks) with arbitrary precision, and (c) freedom from the necessity of generating “good” grids (the algorithm generates its own grid, given an initial coarse grid). Solutions are presented for several examples that illustrate the usefulness of the algorithm.