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.
A method is described for reducing the number of levels to be dealt with in calculating time-dependent populations of atoms or ions in plasmas. The procedure effectively extends the collisional-radiative model to consecutive stages of ionization, treating ground and metastable levels explicitly and excited levels implicitly. Direct comparisons of full and simulated systems are carried out for five-level models.
The scalar form of the approximate factorization method was used to develop a new code for the solution of three dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form were iterated in time until a steady solution was reached. Evidence was given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at the domain boundaries was proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects were accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. The flow in a developing S-duct was then solved in the laminar regime in a Reynolds number (Re) of 790 and in the turbulent regime at Re equals 40,000 by using the Baldwin-Lomax model. The Stanitz elbow was then solved by using an invicid version of the same code at M sub inlet equals 0.4. Grid dependence and convergence rate were investigated, showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re equals 2.5 times 10(exp 6) was solved with the Baldwin-Lomax and the q-omega models. Both approaches show satisfactory agreement with experiments, although the q-omega model was slightly more accurate.
A previous time-derivative preconditioning procedure for solving the Navier-Stokes is extended to the chemical species equations. The scheme is implemented using both the implicit ADI and the explicit Runge-Kutta algorithms. A new definition for time-step is proposed to enable grid-independent convergence. Several examples of both reacting and non-reacting propulsion-related flowfields are considered. In all cases, convergence that is superior to conventional methods is demonstrated. Accuracy is verified using the example of a backward facing step. These results demonstrate that preconditioning can enhance the capability of density-based methods over a wide range of Mach and Reynolds numbers.
The scalar form of the approximate factorization method was used to develop a new code for the solution of three-dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form are iterated in time until a steady solution is reached. Evidence is given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at domain boundaries is proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects are accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. For the first, an investigation on the model behavior in case of multiple boundaries is performed. The flow in a developing S-duct is then solved in the laminar regime at Reynolds number (Re) 790 and in the turbulent regime at Re=40,000 using the Baldwin-Lomax model . The Stanitz elbow is then solved using an inviscid version of the same code at M(sub inlet)=0.4. Grid dependence and convergence rate are investigated showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re=2.5x10(exp 6) is solved with the Baldwin-Lomax and the q-omega models. Both approaches showed satisfactory agreement with experiments, although the q-omega model is slightly more accurate.
The conservation-law form of the inviscid gasdynamic equations has the remarkable property that the nonlinear flux vectors are homogeneous functions of degree one. This property readily permits the splitting of flux vectors into subvectors by similarity transformations so that each subvector has associated with it a specified eigenvalue spectrum. As a consequence of flux vector splitting, new explicit and implicit dissipative finite-difference schemes are developed for first-order hyperbolic systems of equations. Appropriate one-sided spatial differences for each split flux vector are used throughout the computational field even if the flow is locally subsonic. The results of some preliminary numerical computations are included.
The conservation-law form of the inviscid gasdynamic equations has the remarkable property that the nonlinear flux vectors are homogeneous functions of degree one. This property readily permits the splitting of flux vectors into subvectors by similarity transformations so that each subvector has associated with it a specified eigenvalue spectrum. As a consequence of flux vector splitting, new explicit and implicit dissipative finite-difference schemes are developed for first-order hyperbolic systems of equations. Appropriate one-sided spatial differences for each split flux vector are used throughout the computational field even if the flow is locally subsonic. The results of some preliminary numerical computations are included.
An adaptive implicit/explicit finite element procedure for the solution of three-dimensional problems of steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid-exhibiting structure in the normal direction is employed, while away from this region the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, solutions are obtained for the problems of shock-boundary layer interaction and shock-shock interaction on a swept cylindrical leading edge. Comparisons are made with experimental observations.
An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.
A method is developed to determine solutions to the full-potential equation for steady supersonic conical flow using the artificial density method. Various update schemes used generally for transonic potential solutions are investigated. The schemes are compared for speed and robustness. All versions of the computer code have been vectorized and are currently running on the CYBER-203 computer. The update schemes are vectorized, where possible, either fully (explicit schemes) or partially (implicit schemes). Since each version of the code differs only by the update scheme and elements other than the update scheme are completely vectorizable, comparisons of computational effort and convergence rate among schemes are a measure of the specific scheme's performance. Results are presented for circular and elliptical cones at angle of attack for subcritical and supercritical crossflows.
Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.
In a recently published work by Abarbanel and Gottlieb (1980), a new class of explicit time-split algorithms designed for application to the compressible Navier-Stokes equations was developed. These algorithms, which utilize locally-one-dimensional (LOD) spatial steps, were shown to possess stability characteristics superior to those of other time-split schemes. In the present work, the properties of an implicit LOD method, analogous to the Abarbanel-Gottlieb algorithm, are examined using the two-dimensional heat conduction equation as the test problem. Both temporal and spatial inconsistencies inherent in the scheme are identified, and a new consistent, implicit splitting approach is developed and applied to the linear Burgers' equation. The relationship between this new method and other time-split implicit schemes is explained and stability problems encountered with the method in three dimensions are discussed.
A cell-vertex scheme for the three-dimensional Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing with locally varying coefficients, a multigrid method and carefully controlled dissipative terms, very good convergence rates are obtained for two- and three-dimensional flows. Details of the acceleration techniques, which are important for convergence on meshes with high aspect-ratio cells, are discussed. Emphasis is put on the analysis of the stability properties of the implicit smoothing of the explicit residuals with coefficients, which depend on cell aspect ratios.
The current compute environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array and the J90 cluster) provide the required computation bandwidth for CFD calculations of transient problems. If we follow the traditional computational analysis steps for CFD (and we wish to construct an interactive visualizer) we need to be aware of the following: (1) Disk space requirements. A single snap-shot must contain at least the values (primitive variables) stored at the appropriate locations within the mesh. For most simple 3D Euler solvers that means 5 floating point words. Navier-Stokes solutions with turbulence models may contain 7 state-variables. (2) Disk speed vs. Computational speeds. The time required to read the complete solution of a saved time frame from disk is now longer than the compute time for a set number of iterations from an explicit solver. Depending, on the hardware and solver an iteration of an implicit code may also take less time than reading the solution from disk. If one examines the performance improvements in the last decade or two, it is easy to see that depending on disk performance (vs. CPU improvement) may not be the best method for enhancing interactivity. (3) Cluster and Parallel Machine I/O problems. Disk access time is much worse within current parallel machines and cluster of workstations that are acting in concert to solve a single problem. In this case we are not trying to read the volume of data, but are running the solver and the solver outputs the solution. These traditional network interfaces must be used for the file system. (4) Numerics of particle traces. Most visualization tools can work upon a single snap shot of the data but some visualization tools for transient problems require dealing with time.
The performance of two numerical solution schemes, (1) an implicit upwind relaxation with a finite-volume discretization (Thomas and Walters, 1985) and (2) an explicit-implicit MacCormack (1981) scheme with a finite-difference discretization, is compared in two-dimensional simulations of supersonic flow past a flat plate with leading edge, a rearward-facing step, a 10-deg compression corner, a NACA 0012 airfoil at high angle of attack, and a cavity. The algebraic turbulence model, the solution methods, and the boundary conditions and SIMD coding are explained, and the results are presented in tables and graphs and characterized with reference to published experimental data. Scheme (1) is found to converge more rapidly and to give more accurate results than (2) in a wide range of problem types.
The Space Station Active Thermal Control System (ATCS) has been modeled using modified SINDA/SINFLO programs to solve two-phase Thermo-fluid problems. The modifications include changes in several subroutines to incorporate implicit solution which allows larger time step as compared to that for explicit solutions. Larger time step saves computer time but involves larger computational error. Several runs were made using various time steps for the ATCS model. It has been found that for a reasonable approach, three times larger time step as compared to that used in explicit method is a good value which will reduce the computer time by approximately 50 percent and still maintain the accuracy of the output data to within 90 percent of the explicit values.
Methods are developed for computing numerical solutions along block boundaries, even when there is a discontinuity in the grid lines or slopes. The technique is based on matching derivatives and does not require overlapping and interpolation of solution values at block boundaries. The comparison of block boundary values is implicit and has proven to be stable for both implicit and explicit numerical algorithms. Examples are included for the numerical solution of the Euler equations for compressible flow on grids with both grid line discontinuities and discontinuous slopes at block boundaries.
In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.
Papers presented in this volume provide an overview of recent work on numerical boundary condition procedures and multigrid methods. The topics discussed include implicit boundary conditions for the solution of the parabolized Navier-Stokes equations for supersonic flows; far field boundary conditions for compressible flows; and influence of boundary approximations and conditions on finite-difference solutions. Papers are also presented on fully implicit shock tracking and on the stability of two-dimensional hyperbolic initial boundary value problems for explicit and implicit schemes.