Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time step”

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.

At least 199 records · Page 11

URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

RANS and URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

Continuum Damage Mechanics Used to Predict the Creep Life of Monolithic Ceramics

Significant improvements in propulsion and power generation for the next century will require revolutionary advances in high-temperature materials and structural design. Advanced ceramics are candidate materials for these elevated temperature applications. High-temperature and long-duration applications of monolithic ceramics can place their failure mode in the creep rupture regime. An analytical methodology in the form of the integrated design program-Ceramics Analysis and Reliability Evaluation of Structures/Creep (CARES/Creep) has been developed by the NASA Lewis Research Center to predict the life of ceramic structural components subjected to creep rupture conditions. This program utilizes commercially available finite element packages and takes into account the transient state of stress and creep strain distributions (stress relaxation as well as the asymmetric response to tension and compression). The creep life of a component is discretized into short time steps, during which the stress distribution is assumed constant. Then, the damage is calculated for each time step on the basis of a modified Monkman-Grant (MMG) creep rupture criterion. The cumulative damage is subsequently calculated as time elapses in a manner similar to Miner's rule for cyclic fatigue loading. Failure is assumed to occur when the normalized cumulative damage at any point in the component reaches unity. The corresponding time is the creep rupture life for that component.

Powers, Lynn M.↗

Recent developments in FEM-CFD

The current status of CFD with regard to unstructured grids employing finite element methods and Eulerian frames is reviewed. Algorithms suitable for the computation of large three-dimensional problems involving flow past arbitrary geometries are developed. Adaptive mesh refinement strategy is reviewed, and domain splitting or local time-stepping are briefly addressed. The development of search algorithms of optimal order, variable time-stepping Jacobi smoothers for elliptic problems, and transport concepts for hyperbolics to help achieve good performance for unstructured multigrid processes is discussed. As examples, transient supersonic flow in a channel, regular shock reflection of a wall, viscous flow past a protruberance, potential flow past a cylinder, and Burgers equation are considered.

Loehner, R.↗

Computerized reduction of elementary reaction sets for combustion modeling

If the entire set of elementary reactions is to be solved in the modeling of chemistry in computational fluid dynamics, a set of stiff ordinary differential equations must be integrated. Some of the reactions take place at very high rates, requiring short time steps, while others take place more slowly and make little progress in the short time step integration. The goal is to develop a procedure to automatically obtain sets of finite rate equations, consistent with a partial equilibrium assumptions, from an elementary set appropriate to local conditions. The possibility of computerized reaction reduction was demonstrated. However, the ability to use the reduced reaction set depends on the ability of the CFD approach in incorporate partial equilibrium calculations into the computer code. Therefore, the results should be tested on a code with partial equilibrium capability.

Wikstrom, Carl V.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗

Computerized reduction of elementary reaction sets for CFD combustion modeling

Modeling of chemistry in Computational Fluid Dynamics can be the most time-consuming aspect of many applications. If the entire set of elementary reactions is to be solved, a set of stiff ordinary differential equations must be integrated. Some of the reactions take place at very high rates, requiring short time steps, while others take place more slowly and make little progress in the short time step integration.

Wikstrom, Carl V.↗

Cooperation and Coordination Between Fuzzy Reinforcement Learning Agents in Continuous State Partially Observable Markov Decision Processes

Successful operations of future multi-agent intelligent systems require efficient cooperation schemes between agents sharing learning experiences. We consider a pseudo-realistic world in which one or more opportunities appear and disappear in random locations. Agents use fuzzy reinforcement learning to learn which opportunities are most worthy of pursuing based on their promise rewards, expected lifetimes, path lengths and expected path costs. We show that this world is partially observable because the history of an agent influences the distribution of its future states. We consider a cooperation mechanism in which agents share experience by using and-updating one joint behavior policy. We also implement a coordination mechanism for allocating opportunities to different agents in the same world. Our results demonstrate that K cooperative agents each learning in a separate world over N time steps outperform K independent agents each learning in a separate world over K*N time steps, with this result becoming more pronounced as the degree of partial observability in the environment increases. We also show that cooperation between agents learning in the same world decreases performance with respect to independent agents. Since cooperation reduces diversity between agents, we conclude that diversity is a key parameter in the trade off between maximizing utility from cooperation when diversity is low and maximizing utility from competitive coordination when diversity is high.

Berenji, Hamid R.↗

Implementation of an Open-Scenario, Long-Term Space Debris Simulation Approach

This paper provides a status update on the implementation of a flexible, long-term space debris simulation approach. The motivation is to build a tool that can assess the long-term impact of various options for debris-remediation, including the LightForce space debris collision avoidance concept that diverts objects using photon pressure [9]. State-of-the-art simulation approaches that assess the long-term development of the debris environment use either completely statistical approaches, or they rely on large time steps on the order of several days if they simulate the positions of single objects over time. They cannot be easily adapted to investigate the impact of specific collision avoidance schemes or de-orbit schemes, because the efficiency of a collision avoidance maneuver can depend on various input parameters, including ground station positions and orbital and physical parameters of the objects involved in close encounters (conjunctions). Furthermore, maneuvers take place on timescales much smaller than days. For example, LightForce only changes the orbit of a certain object (aiming to reduce the probability of collision), but it does not remove entire objects or groups of objects. In the same sense, it is also not straightforward to compare specific de-orbit methods in regard to potential collision risks during a de-orbit maneuver. To gain flexibility in assessing interactions with objects, we implement a simulation that includes every tracked space object in Low Earth Orbit (LEO) and propagates all objects with high precision and variable time-steps as small as one second. It allows the assessment of the (potential) impact of physical or orbital changes to any object. The final goal is to employ a Monte Carlo approach to assess the debris evolution during the simulation time-frame of 100 years and to compare a baseline scenario to debris remediation scenarios or other scenarios of interest. To populate the initial simulation, we use the entire space-track object catalog in LEO. We then use a high precision propagator to propagate all objects over the entire simulation duration. If collisions are detected, the appropriate number of debris objects are created and inserted into the simulation framework. Depending on the scenario, further objects, e.g. due to new launches, can be added. At the end of the simulation, the total number of objects above a cut-off size and the number of detected collisions provide benchmark parameters for the comparison between scenarios. The simulation approach is computationally intensive as it involves tens of thousands of objects; hence we use a highly parallel approach employing up to a thousand cores on the NASA Pleiades supercomputer for a single run. This paper describes our simulation approach, the status of its implementation, the approach to developing scenarios and examples of first test runs.

laser↗

A study of ice shape prediction methodologies and comparison with experimental data

Current analytical ice shape prediction methods are described and evaluated. The analyses of Gray (1958), Wilder (1969), and Bragg (1982) are compared with the prediction of the LEWICE computer analysis. The effects of time stepping and initial surface roughness on analysis predictions are studied utilizing the prediction methods and flight data. Rime, mixed, and glazed ice shapes at the leading edge of an airfoil are analyzed. It is observed that there is no change in ice shape prediction if ice accumulation is less than 0.01, a minimum of 2 time steps is need to incorporate time dependent behavior into the analysis, and the LEWICE analysis provided the most accurate predictions.

Korkan, K. D.↗

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗

Multi-resolution analysis for ENO schemes

Given an function, u(x), which is represented by its cell-averages in cells which are formed by some unstructured grid, we show how to decompose the function into various scales of variation. This is done by considering a set of nested grids in which the given grid is the finest, and identifying in each locality the coarsest grid in the set from which u(x) can be recovered to a prescribed accuracy. This multi-resolution analysis was applied to essentially non-oscillatory (ENO) schemes in order to advance the solution by one time-step. This is accomplished by decomposing the numerical solution at the beginning of each time-step into levels of resolution, and performing the computation in each locality at the appropriate coarser grid. An efficient algorithm for implementing this program in the 1-D case is presented; this algorithm can be extended to the multi-dimensional case with Cartesian grids.

Harten, Ami↗

Multi-resolution analysis for ENO schemes

Given a function u(x) which is represented by its cell-averages in cells which are formed by some unstructured grid, we show how to decompose the function into various scales of variation. This is done by considering a set of nested grids in which the given grid is the finest, and identifying in each locality the coarsest grid in the set from which u(x) can be recovered to a prescribed accuracy. We apply this multi-resolution analysis to Essentially Non-oscillatory Schemes (ENO) schemes in order to reduce the number of numerical flux computations which is needed in order to advance the solution by one time-step. This is accomplished by decomposing the numerical solution at the beginning of each time-step into levels of resolution, and performing the computation in each locality at the appropriate coarser grid. We present an efficient algorithm for implementing this program in the one-dimensional case; this algorithm can be extended to the multi-dimensional case with cartesian grids.

Harten, Ami↗

Probabilistic Round Trip Contamination Analysis of a Mars Sample Acquisition and Handling Process Using Markovian Decompositions

A method for evaluating the probability of a Viable Earth Microorganism (VEM) contaminating a sample during the sample acquisition and handling (SAH) process of a potential future Mars Sample Return mission is developed. A scenario where multiple core samples would be acquired using a rotary percussive coring tool, deployed from an arm on a MER class rover is analyzed. The analysis is conducted in a structured way by decomposing sample acquisition and handling process into a series of discrete time steps, and breaking the physical system into a set of relevant components. At each discrete time step, two key functions are defined: The probability of a VEM being released from each component, and the transport matrix, which represents the probability of VEM transport from one component to another. By defining the expected the number of VEMs on each component at the start of the sampling process, these decompositions allow the expected number of VEMs on each component at each sampling step to be represented as a Markov chain. This formalism provides a rigorous mathematical framework in which to analyze the probability of a VEM entering the sample chain, as well as making the analysis tractable by breaking the process down into small analyzable steps.

Hudson, Nicolas↗

Creep Life of Ceramic Components Using a Finite-Element-Based Integrated Design Program (CARES/CREEP)

The desirable properties of ceramics at high temperatures have generated interest in their use for structural application such as in advanced turbine engine systems. Design lives for such systems can exceed 10,000 hours. The long life requirement necessitates subjecting the components to relatively low stresses. The combination of high temperatures and low stresses typically places failure for monolithic ceramics in the creep regime. The objective of this paper is to present a design methodology for predicting the lifetimes of structural components subjected to creep rupture conditions. This methodology utilizes commercially available finite element packages and takes into account the time-varying creep strain distributions (stress relaxation). The creep life, of a component is discretized into short time steps, during which the stress and strain distributions are assumed constant. The damage is calculated for each time step based on a modified Monkman-Grant creep rupture criterion. Failure is assumed to occur when the normalized accumulated damage at any point in the component is greater than or equal to unity. The corresponding time will be the creep rupture life for that component. Examples are chosen to demonstrate the Ceramics Analysis and Reliability Evaluation of Structures/CREEP (CARES/CREEP) integrated design program, which is written for the ANSYS finite element package. Depending on the component size and loading conditions, it was found that in real structures one of two competing failure modes (creep or slow crack growth) will dominate. Applications to benchmark problems and engine components are included.

Powers, L. M.↗

Creep Life of Ceramic Components Using a Finite-Element-Based Integrated Design Program (CARES/CREEP)

The desirable properties of ceramics at high temperatures have generated interest in their use for structural applications such as in advanced turbine systems. Design lives for such systems can exceed 10,000 hours. The long life requirement necessitates subjecting the components to relatively low stresses. The combination of high temperatures and low stresses typically places failure for monolithic ceramics in the creep regime. The objective of this paper is to present a design methodology for predicting the lifetimes of structural components subjected to creep rupture conditions. This methodology utilized commercially available finite element packages and takes into account the time-varying creep strain distributions (stress relaxation). The creep life of a component is discretized into short time steps, during which the stress and strain distributions are assumed constant. The damage is calculated for each time step based on a modified Monkman-Grant creep rupture criterion. Failure is assumed to occur when the normalized accumulated damage at any point in the component is greater than or equal to unity. The corresponding time will be the creep rupture life for that component. Examples are chosen to demonstrate the CARES/CREEP (Ceramics Analysis and Reliability Evaluation of Structures/CREEP) integrated design programs, which is written for the ANSYS finite element package. Depending on the component size and loading conditions, it was found that in real structures one of two competing failure modes (creep or slow crack growth) will dominate. Applications to benechmark problems and engine components are included.

Gyekenyesi, J. P.↗

Numerical solution of the incompressible Navier-Stokes equations

The current work is initiated in an effort to obtain an efficient, accurate, and robust algorithm for the numerical solution of the incompressible Navier-Stokes equations in two- and three-dimensional generalized curvilinear coordinates for both steady-state and time-dependent flow problems. This is accomplished with the use of the method of artificial compressibility and a high-order flux-difference splitting technique for the differencing of the convective terms. Time accuracy is obtained in the numerical solutions by subiterating the equations in psuedo-time for each physical time step. The system of equations is solved with a line-relaxation scheme which allows the use of very large pseudo-time steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. Numerous laminar test flow problems are computed and presented with a comparison against analytically known solutions or experimental results. These include the flow in a driven cavity, the flow over a backward-facing step, the steady and unsteady flow over a circular cylinder, flow over an oscillating plate, flow through a one-dimensional inviscid channel with oscillating back pressure, the steady-state flow through a square duct with a 90 degree bend, and the flow through an artificial heart configuration with moving boundaries. An adequate comparison with the analytical or experimental results is obtained in all cases. Numerical comparisons of the upwind differencing with central differencing plus artificial dissipation indicates that the upwind differencing provides a much more robust algorithm, which requires significantly less computing time. The time-dependent problems require on the order of 10 to 20 subiterations, indicating that the elliptical nature of the problem does require a substantial amount of computing effort.

Rogers, Stuart E.↗

Smoothing and the second law

The technique of obtaining second order, oscillation free, total variation diminishing (TVD), scalar difference schemes by adding a limited diffusion flux (smoothing) to a second order centered scheme is explored. It is shown that such schemes do not always converge to the correct physical answer. The approach presented here is to construct schemes that numerically satisfy the second law of thermodynamics on a cell by cell basis. Such schemes can only converge to the correct physical solution and in some cases can be shown to be TVD. An explicit scheme with this property and second order spatial accuracy was found to have an extremely restrictive time step limitation (Delta t less than Delta x squared). Switching to an implicit scheme removed the time step limitation.

Merriam, Marshal L.↗