SEARCH · Search NASA
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.
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.
A class of implicit upwind differencing methods for the compressible Navier-Stokes equations is described and applied. The methods are based on the use of local eigenvalues or wave speeds to control spatial differencing of inviscid terms and are aimed at increasing the level of accuracy and stability achievable in computation. Techniques for accelerating the rate of convergence to a steady state solution are also used. Applications to inviscid and viscous transonic flows are discussed and compared with other methods and experimental measurements. It is shown that accurate and efficient transonic airfoil calculations can be made on the Cray-l computer in less than 2 min.
The development of a fully implicit finite-difference model, whose time step is chosen solely to resolve accurately the physical flow of interest is discussed. The method is based on an operator factorization which reduces the dimensionality of the implicit approach: at each time step only (spatially) one-dimensional block-tridiagonal linear systems must be solved. The scheme uses two time levels and is second-order accurate in time. Compact implicit spatial differences are used, yielding fourth-order accuracy both vertically and horizontally. In addition, the development of a fully interactive computer code is discussed. With this code the user will have a choice of models, with various levels of accuracy and sophistication, which are imbedded, as subsets of the fully implicit 3D code.
The radial impurity transport equation for tokamak plasma is a form of diffusion–convection–reaction equation. The impurity transport equation is solved to determine the distribution of impurity (non-fuel) ion species with different ionization states perpendicular to magnetic surfaces of tokamak plasma. The equation for each charge (ionization) state Z is a non-linear, second-order in space, first-order in time, parabolic partial differential equation coupled to the previous Z − 1 and the next Z + 1 charge states of the impurity species through its reaction term. The number of differential equations to be solved simultaneously is hence determined by the number of ionization states of the impurity species studied. The solution to the set of these coupled equations can be obtained using a semi-implicit numerical method applied on it. The present study describes the application of von Neumann stability analysis over the semi-implicit numerical method applied over the radial impurity transport equation and determines a generic stability criterion for the method. The stability analysis is further illustrated using the geometry of Aditya tokamak installed at the Institute for Plasma Research Gandhinagar, India as an example. The impurity species considered is oxygen (Atomic number = 8). This leads to a set of eight coupled equations for charge states Z = 1 to 8 over which von Neumann analysis is illustrated in present study.
In this paper, we introduce implicit gradient methods as alternatives to conventional least-squares gradient methods for second- and third-order nodal-gradient cell-centered finite-volume discretizations, where solutions are stored at cells but gradients are stored at nodes. Because of the unique configuration of solutions and gradients, implicit gradient systems developed for the node-centered edge-based discretization method can be directly applied once the numerical solutions are interpolated from cells to nodes with sufficient accuracy. The resulting defect-correction solver can be loosely coupled with a flow-equation solver, and at convergence, solutions and gradients that satisfy the corresponding residual equations are obtained. Each iteration is relatively cheap compared with least-squares methods involving hundreds of neighbors. Numerical results are presented for accuracy verification studies and some simple but realistic flow problems.
A class of implicit upwind-differencing methods for the compressible Navier-Stokes equations is described and applied. The methods are based on the use of local eigenvalues or wave speeds to control spatial differencing of inviscid terms and are aimed at increasing the level of accuracy and stability achievable in computation. Techniques for accelerating the rate of convergence to a steady-state solution are also used. Applications to inviscid and viscous transonic flows are discussed and compared with other methods and experimental measurements. It is shown that accurate and efficient transonic airfoil calculations can be made on the Cray-1 coomputer in less than 2 min.
In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in “fully-gray” form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. In the modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of ∼2–4 compared to standard RW, and a factor of ∼3–6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation.
The factored-implicit, gas-dynamic algorithm has been adapted to the numerical simulation of equilibrium reactive flows. Changes required in the perfect gas version of the algorithm are developed, and the method of coupling gas-dynamic and chemistry variables is discussed. A flow-field solution that approximates a Jovian entry case was obtained by this method and compared with the same solution obtained by HYVIS, a computer program much used for the study of planetary entry. Comparison of surface pressure distribution and stagnation line shock-layer profiles indicates that the two solutions agree well.
Explicit, implicit, and characteristic finite-difference methods are applied to solve model equations representative of the compressible Navier-Stokes equations. An approach is then formulated for solving the Navier-Stokes equation at high Reynolds numbers. The approach has drastically reduced the computation time required to obtain viscous flow solutions. Computational results for shock wave separated flows are presented.
A class of implicit finite difference schemes of the Beam and Warming approximate factorization type will be addressed. The development and analysis of various aspects of this class of schemes will be given along with the motivations behind many of the choices. Various acceleration and efficiency modifications such as matrix reduction, diagonalization and flux split schemes will be presented. The methods are demonstrated in fully vectorized codes for a CRAY type architecture. The emphasis will be on the Euler equations in generalized coordinates.
A fully implicit code was developed to solve the three-dimensional primitive equations of atmospheric flow. The scheme is second order accurate in time and fourth order accurate in the horizontal and vertical directions. Furthermore, as a result of being fully implicit, the time step is not restricted by the mesh spacing near the poles, nor by the speed of inertia-gravity waves. Rather, the time step, deltat is determined simply by the requirement that it be small enough to adequately resolve the atmospheric flow of interest. The accuracy and efficiency of current models for fine grids should be significantly improved.
In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.
This work represents a first-of-its-kind successful application to employ advanced numerical methods in solving realistic two-phase flow problems with two-fluid six-equation two-phase flow model. These advanced numerical methods include high-resolution spatial discretization scheme with staggered grids (high-order) fully implicit time integration schemes, and Jacobian-free Newton–Krylov (JFNK) method as the nonlinear solver. The computer code developed in this work has been extensively validated with existing experimental flow boiling data in vertical pipes and rod bundles, which cover wide ranges of experimental conditions, such as pressure, inlet mass flux, wall heat flux and exit void fraction. Additional code-to-code benchmark with the RELAP5-3D code further verifies the correct code implementation. The combined methods employed in this work exhibit strong robustness in solving two-phase flow problems even when phase appearance (boiling) and realistic discrete flow regimes are considered. Transitional flow regimes used in existing system analysis codes, normally introduced to overcome numerical difficulty, were completely removed in this work. As a result, this in turn provides the possibility to utilize more sophisticated flow regime maps in the future to further improve simulation accuracy.