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.