Solution of the parabolized Navier-Stokes equations for supersonic flows by a fully implicit method with an analysis of departure solution behavior
Explore the source record for details and available documents.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
A new time accurate coupled solution procedure for solving the chemical non-equilibrium Navier-Stokes equations over a wide range of Mach numbers is described. The scheme is shown to be very efficient and robust for flows with velocities ranging from M less than or equal to 10(exp -10) to supersonic speeds.
Explore the source record for details and available documents.
The present time-accurate coupled-solution procedure addresses the chemical nonequilibrium Navier-Stokes equations over a wide Mach-number range uses, in conjunction with the strong conservation form of the governing equations, five unknown primitive variables. The numerical tests undertaken address steady convergent-divergent nozzle flows with air dissociation/recombination, dump combustor flows with n-pentane/air chemistry, and unsteady nonreacting cavity flows.
Differentiable programming is a powerful concept as it enables the seemly propagation of gradients through functions, algorithms, and/or whole physics simulations. These gradients are useful for a wide variety of applications, including sensitivity studies and machine learning, but one of particular interest is optimization. Gradient-based optimization, enabled through automatic/algorithmic differentiation (AD), can be used on predictive physical models to efficiently optimize a set of design variables. AD methods are a particularly promising approach to complex physics simulations because they can be shown to scale well with an increasing number of design variables; however, care must be taken when coupling between different models or different states of a single model.
Implicit–Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is split into stiff and nonstiff processes with the goal of lower computational costs than a purely implicit or explicit approach. A complementary form of flexible IVP solvers are multirate infinitesimal methods for problems split into fast- and slow-changing dynamics, that solve a multirate IVP by evolving a sequence of “fast” IVPs using any suitably accurate algorithm. This article introduces a new class of high-order implicit–explicit multirate methods that are designed for multirate IVPs in which the slow-changing dynamics are further split in an IMEX fashion. This new class, which we call implicit–explicit multirate infinitesimal stage-restart (IMEX-MRI-SR), both improves upon the previous implicit–explicit multirate infinitesimal generalized-structure additive Runge Kutta (IMEX-MRI-GARK) methods by allowing for far easier creation of new embedded methods, and extends multirate exponential Runge Kutta (MERK) methods by allowing the fast-changing dynamics to be nonlinear and the methods to be implicit. We leverage GARK theory to derive conditions for orders of accuracy up to four, and we provide second- and third-order accurate example methods, which are the first known embedded MRI methods with IMEX structure. We then perform numerical simulations demonstrating convergence rates and computational performance in both fixed-step and adaptive-step settings.
We combine a high order compact finite difference approximation and collocation techniques to numerically solve the two dimensional heat equation. The resulting method is implicit arid can be parallelized with a strategy that allows parallelization across both time and space. We compare the parallel implementation of the new method with a classical implicit method, namely the Crank-Nicolson method, where the parallelization is done across space only. Numerical experiments are carried out on the SGI Origin 2000.
Implicit approximate-factorization algorithms have been developed that use monotone methods for the calculation of steady and unsteady transonic flows governed by the small-disturbance-potential equation. These algorithms use the new Engquist-Osher switch in the type-dependent differencing in place of the standard Murman-Cole switch. The resulting algorithms are more stable; hence, calculations can be done more efficiently. For steady flows, the convergence rate is about 35% faster, and for unsteady flows the allowable time step is about 10 times larger. These improvements are achieved with no increase in computer storage and with only minor modifications in codes that use the Murman-Cole switch. Also an implicit algorithm has been developed for the steady full-potential equation in one-dimension, which uses monotone methods.
Implicit extrapolation methods for the solution of partial differential equations are based on applying the extrapolation principle indirectly. Multigrid tau-extrapolation is a special case of this idea. In the context of multilevel finite element methods, an algorithm of this type can be used to raise the approximation order, even when the meshes are nonuniform or locally refined. Here previous results are generalized to the variable coefficient case and thus become applicable for nonlinear problems. The implicit extrapolation multigrid algorithm converges to the solution of a higher order finite element system. This is obtained without explicitly constructing higher order stiffness matrices but by applying extrapolation in a natural form within the algorithm. The algorithm requires only a small change of a basic low order multigrid method.
A fully-implicit finite-volume algorithm for two-dimensional axisymmetric flows has been coupled to a detailed hydrogen-air reaction mechanism (13 species and 33 reactions) so that supersonic combustion phenomena may be investigated. Numerical computations are compared with ballistic-range shadowgraphs of Lehr (1972) that exhibit two discontinuities caused by a blunt body as it passes through a premixed stoichiometric hydrogen-air mixture. The suitability of the numerical procedure for simulating these double-front flows is shown. The requirements for the physical formulation and the numerical modeling of these flowfields are discussed. Finally, the sensitivity of these external flowfields to changes in certain key reaction rate constants is examined.
Numerical tests were made for a model of the Navier-Stokes equations using a second-order accurate implicit scheme which guarantees diagonal dominance. The results suggest that the failure of implicit methods using large marching steps may not always be attributed to the lack of diagonal dominance in the coefficient matrix. In some cases the failure may be caused by a nonlinear instability associated with the solution method.
This paper derives the three dimensional lambda-formulation equations for a general orthogonal curvilinear coordinate system and provides various block-explicit and block-implicit methods for solving them, numerically. Three model problems, characterized by subsonic, supersonic and transonic flow conditions, are used to assess the reliability and compare the efficiency of the proposed methods.
This paper derives the three dimensional lambda-formulation equations for a general orthogonal curvilinear coordinate system and provides various block-explicit and block-implicit methods for solving them, numerically. Three model problems, characterized by subsonic, supersonic and transonic flow conditions, are used to assess the reliability and compare the efficiency of the proposed methods.
A reexamination of some numerical methods is considered in light of the new class of computers which use vector streaming to achieve high computation rates. A study has been made of the effect on the relative efficiency of several numerical methods applied to a particular fluid flow problem when they are implemented on a vector computer. The method of Brailovskaya, the alternating direction implicit method, a fully implicit method, and a new method called partial implicitization have been applied to the problem of determining the steady state solution of the two-dimensional flow of a viscous imcompressible fluid in a square cavity driven by a sliding wall. Results are obtained for three mesh sizes and a comparison is made of the methods for serial computation.
Studies on the adaptive implicit-explicit (AIE) method for large-scale problems are presented. The AIE method is based on dynamic grouping of the elements into the implicit and explicit subsets as dictated by the element level stability and accuracy considerations. The method has been applied to various flow problems including the incompressible flow and convection-diffusion problems, and it has been demonstrated that substantial savings in CPU time and memory can be achieved.
Summary Recently, graphics processing units (GPUs) have been demonstrated to provide a significant performance benefit for black-oil reservoir simulation, as well as flash calculations that serve an important role in compositional simulation. A comprehensive approach to compositional simulation based on GPUs has yet to emerge, and the question remains as to whether the benefits observed in black-oil simulation persist with a more complex fluid description. We present a positive answer to this question through the extension of a commercial GPU-based black-oil simulator to include a compositional description based on standard cubic equations of state (EOSs). We describe the motivations for the selected nonlinear formulation, including the choice of primary variables and iteration scheme, and support for both fully implicit methods (FIMs) and adaptive implicit methods (AIMs). We then present performance results on an example sector model and simplified synthetic case designed to allow a detailed examination of runtime and memory scaling with respect to the number of hydrocarbon components and model size, as well as the number of processors. We finally show results from two complex asset models (synthetic and real) and examine performance scaling with respect to GPU generation, demonstrating that performance correlates strongly with GPU memory bandwidth. NOTE: This paper is also published as part of the 2021 SPE Reservoir Simulation Conference Special Issue.
A method is presented for formulating the boundary conditions in implicit finite-difference form needed for obtaining solutions to the compressible Navier-Stokes equations by the Beam and Warming implicit factored method. The usefulness of the method was demonstrated (a) by establishing the boundary conditions applicable to the analysis of the flow inside an axisymmetric piston-cylinder configuration and (b) by calculating velocities and mass fractions inside the cylinder for different geometries and different operating conditions. Stability, selection of time step and grid sizes, and computer time requirements are discussed in reference to the piston-cylinder problem analyzed.
The multiple-grid scheme of Ni (1981) for the solution of the unsteady Euler equations for quasi-one-dimensional transonic flow problems is analyzed according to its ability to accelerate convergence to a steady state solution, its applicability to an implicit scheme, its accuracy, and its stability limits. This scheme is applied successfully to McCormack's (1981) implicit method of solving quasi-one-dimensional transonic flow problems for CFL numbers significantly greater than unity. It is determined that the second order accuracy of this implicit method is preserved by employing the multiple gridding. However, stability limitations that are flow dependent are introduced into the implicit method by the use of the multiple-grid scheme which will curtail its use under certain flow conditions. A scaling modification for the multiple grid scheme is developed which further improves its performance when used with explicit and artificially-damped implicit methods without any increase in computational work.