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 379 records · Page 21

Evolving the SpaceFOM: Lessons Learned and Future Development

For over fifty years, simulation has been a cornerstone technology for space missions. In many cases, one single simulator, developed by one team, is not enough to meet the simulation objectives. Astronaut crew training, docking, vehicle testing and complex mission planning all require several simulations to be connected and to interoperate, in order to achieve the goal of the simulation. To facilitate the development of interoperable simulations, an open standard, the SISO SpaceFOM was developed in collaboration between government, industry and academia. The standard was released in 2020. The initial release of SpaceFOM focuses on the core interoperability topics for space simulation: (i) specifying spatial data using several, well defined reference frames, (ii) managing time (including real-time, hard real-time, and as-fast-as-possible execution), (iii) composition of systems with subsystems such as space vehicles, and (iv) execution control, such as initializing, running, pausing, and terminating simulations. The initial release of SpaceFOM focuses on the core interoperability topics for space simulation: (i) specifying spatial data using several, well defined reference frames, (ii) managing time (including real-time, hard real-time, and as-fast-as-possible execution), (iii) composition of systems with subsystems such as space vehicles, and (iv) execution control, such as initializing, running, pausing, and terminating simulations. A number of requirements for the next version of SpaceFOM have been identified and proposed solutions are already under development. One key area is the object classes used for data exchange, where a richer set of classes have been proposed, based on practical use cases. For time management, the use of variable time resolutions and variable time steps is also proposed. For execution control, save and restore of simulations is considered as well as improved robustness, to handle failing components. A number of clarifications are also under consideration. This paper provides both a forward-looking view of the technical developments underway and a retrospective on the standard's evolution. The authors emphasize that prioritizing core challenges and delivering a practical first version were crucial steps. While not every idea was implemented in the initial release, the timely delivery of a functional standard enabled real-world applications, the growth of a user community, and the collection of valuable insights to shape future versions. The authors look forward to working with the next version of SpaceFOM together with the growing user community.

Simulation Interoperability↗

Evolving the SpaceFOM: Lessons Learned and Future Development

For over fifty years, simulation has been a cornerstone technology for space missions. In many cases, one single simulator, developed by one team, is not enough to meet the simulation objectives. Astronaut crew training, docking, vehicle testing and complex mission planning all require several simulations to be connected and to interoperate, in order to achieve the goal of the simulation. To facilitate the development of interoperable simulations, an open standard, the SISO SpaceFOM was developed in collaboration between government, industry and academia. The standard was released in 2020. The initial release of SpaceFOM focuses on the core interoperability topics for space simulation: (i) specifying spatial data using several, well defined reference frames, (ii) managing time (including real-time, hard real-time, and as-fast-as-possible execution), (iii) composition of systems with subsystems such as space vehicles, and (iv) execution control, such as initializing, running, pausing, and terminating simulations. A number of requirements for the next version of SpaceFOM have been identified and proposed solutions are already under development. One key area is the object classes used for data exchange, where a richer set of classes have been proposed, based on practical use cases. For time management, the use of variable time resolutions and variable time steps is also proposed. For execution control, save and restore of simulations is considered as well as improved robustness, to handle failing components. A number of clarifications are also under consideration. This paper provides both a forward-looking view of the technical developments underway and a retrospective on the standard's evolution. The authors emphasize that prioritizing core challenges and delivering a practical first version were crucial steps. While not every idea was implemented in the initial release, the timely delivery of a functional standard enabled real-world applications, the growth of a user community, and the collection of valuable insights to shape future versions. The authors look forward to working with the next version of SpaceFOM together with the growing user community.

FOMs↗

Efficiency and reliability enhancements in propulsion flowfield modeling

The implementation of traditional CFD algorithms in practical propulsion related flowfields often leads to dramatic reductions in efficiency and/or robustness. The present research is directed at understanding the reasons for this deterioration and finding methods to circumvent it. Work to date has focussed on low Mach number regions, viscous dominated regions, and high grid aspect ratios. Time derivative preconditioning, improved definition of the local time stepping, and appropriate application of boundary conditions are employed to decrease the required time to obtain a solution, while maintaining accuracy. A number of cases having features typical of rocket engine flowfields are computed to demonstrate the improvement over conventional methods. These cases include laminar and turbulent high Reynolds number flat plate boundary layers, flow over a backward-facing step, a diffusion flame, and wall heat-flux calculations in a turbulent converging-diverging nozzle. Results from these cases show convergence that is virtually independent of the local Mach number and the grid aspect ratio, which translates to a convergence speed-up of up to several orders of magnitude over conventional algorithms. Current emphasis is in extending these results to three-dimensional flows with highly stretched grids.

Buelow, Philip E. O.↗

An efficient and robust algorithm for two dimensional time dependent incompressible Navier-Stokes equations: High Reynolds number flows

An algorithm is presented for unsteady two-dimensional incompressible Navier-Stokes calculations. This algorithm is based on the fourth order partial differential equation for incompressible fluid flow which uses the streamfunction as the only dependent variable. The algorithm is second order accurate in both time and space. It uses a multigrid solver at each time step. It is extremely efficient with respect to the use of both CPU time and physical memory. It is extremely robust with respect to Reynolds number.

Goodrich, John W.↗

An efficient and robust algorithm for two dimensional time dependent incompressible Navier-Stokes equations - High Reynolds number flows

An algorithm is presented for unsteady two-dimensional incompressible Navier-Stokes calculations. This algorithm is based on the fourth order partial differential equation for incompressible fluid flow which uses the streamfunction as the only dependent variable. The algorithm is second order accurate in both time and space. It uses a multigrid solver at each time step. It is extremely efficient with respect to the use of both CPU time and physical memory. It is extremely robust with respect to Reynolds number.

Goodrich, John W.↗

Inlet Spillage Drag Predictions Using the AIRPLANE Code

AIRPLANE (Jameson/Baker) is a steady inviscid unstructured Euler flow solver. It has been validated on many HSR geometries. It is implemented as MESHPLANE, an unstructured mesh generator, and FLOPLANE, an iterative flow solver. The surface description from an Intergraph CAD system goes into MESHPLANE as collections of polygonal curves to generate the 3D mesh. The flow solver uses a multistage time stepping scheme with residual averaging to approach steady state, but R is not time accurate. The flow solver was ported from Cray to IBM SP2 by Wu-Sun Cheng (IBM); it could only be run on 4 CPUs at a time because of memory limitations. Meshes for the four cases had about 655,000 points in the flow field, about 3.9 million tetrahedra, about 77,500 points on the surface. The flow solver took about 23 wall seconds per iteration when using 4 CPUs. It took about eight and a half wall hours to run 1,300 iterations at a time (the queue limit is 10 hours). A revised version of FLOPLANE (Thomas) was used on up to 64 CPUs to finish up some calculations at the end. We had to turn on more communication when using more processors to eliminate noise that was contaminating the flow field; this added about 50% to the elapsed wall time per iteration when using 64 CPUs. This study involved computing lift and drag for a wing/body/nacelle configuration at Mach 0.9 and 4 degrees pitch. Four cases were considered, corresponding to four nacelle mass flow conditions.

Thomas, Scott D.↗

MSFC Stream Model Preliminary Results: Modeling the 1998-2002 Leonid Encounters and the 1993,1994, and 2004 Perseid Encounters

The cometary meteoroid ejection models of Jones (1996) and Crifo (1997) were used to simulate ejection from comets 55P/Tempel-Tuttle during the last 12 revolutions, and the 1862, 1737, and 161 0 apparitions of 1 OSP/Swift-Tuttle. Using cometary ephemerides generated by the JPL HORIZONS Solar System Data and Ephemeris Computation Service, ejection was simulated in 1 hour time steps while the comet was within 2.5 AU of the Sun. Also simulated was ejection occurring at the hour of perihelion passage. An RK4 variable step integrator was then used to integrate meteoroid position and velocity forward in time, accounting for the effects of radiation pressure, Poynting-Robertson drag, and the gravitational forces of the planets, which were computed using JPL's DE406 planetary ephemerides. An impact parameter is computed for each particle approaching the Earth, and the results are compared to observations of the 1998-2002 Leonid showers, and the 1993-1 994 Perseids. A prediction for Earth's encounter with the Perseid stream in 2004 is also presented.

Moser, D. E.↗

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

A space-marching method for the computation of viscous internal flows

A space-marching method has been developed to compute 3-D viscous flows in internal geometries. The Navier-Stokes equations have been posed as an initial-value problem by neglecting the effects of streamwise diffusion and treating the streamwise pressure gradient as a known source term. The fully coupled system of equations has been solved by a noniterative algorithm at each streamwise step of the computation. A low Mach number formulation of the equations has been used to compute incompressible flow fields. A computer program has been written to implement all aspects of the space-marching algorithm. The program is modular and is easily adapted to the widely varying geometries of internal flows. The space-marching algorithm has been tested by computing simple flows with known analytical solutions. The method has been used to predict complex 3-D turbulent flows. The algorithm is stable and very economical. A single sweep of the flow field by the space-marching method is approximately equivalent to one time-step of the time-marching method.

Govindan, T. R.↗

Unsteady transonic Navier-Stokes computations for an oscillating wing using single and multiple zones

Modern jet transports and maneuvering tactical fighters operating in the transonic regime often give rise to time-dependent fluid physics that interact with flexible structural components, e.g., vortical flow, shocks, and separation. Efficient computational fluid dynamic (CFD) methods are required to study such computationally intensive problems. In this work a numerical method is presented to address this problem. Time-dependent, compressible, Navier-Stokes equations are used to simulate unsteady transonic flow about a three-dimensional rigid wing undergoing a forced periodic motion in angle of attack. An efficient, implicit, diagonal algorithm is utilized because of its low operation count per time step compared to other methods that solve systems of block matrix equations. The formal time accuracy is addressed theoretically and demonstrated numerically by comparison of computational results with experimental data. A zonal grid approach, capable of treating complex geometries, is presented and its time accuracy is demonstrated by comparing a zonal computation with a single grid computation and experimental data.

Chaderjian, Neal M.↗

An unconditionally stable Runge-Kutta method for unsteady rotor-stator interaction

A quasi-three-dimensional analysis has been developed for unsteady rotor-stator interaction in turbomachinery. The analysis solves the unsteady Euler or thin-layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stress-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations are integrated in time using an explicit four-stage Runge-Kutta scheme with a constant time step. Implicit residual smoothing is used to increase the stability limit of the time-accurate computations. The scheme is described, and stability and accuracy analyses are given.

Chima, Rodrick V.↗

Use of finite volume schemes for transition simulation

The use of finite-volume methods in the study of spatially and temporally evolving transitional flows over a flat plate is investigated. Schemes are developed with both central and upwind differencing. The compressible Navier-Stokes equations are solved with a Runge-Kutta time stepping scheme. Disturbances are determined using linear theory and superimposed at the inflow boundary. Time accurate integration is then used to allow temporal and spatial disturbance evolution. Characteristic-based boundary conditions are employed. The requirements of using finite-volume algorithms are studied in detail. Special emphasis is placed on difference schemes, grid resolution, and disturbance amplitudes. Moreover, comparisons are made with linear theory for small amplitude disturbances. Both subsonic and supersonic flows are considered, and it is shown that the locations of branch 1 and branch 2 of the neutral stability curve are well predicted, given sufficient resolution.

Fenno, Charles C., Jr.↗

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

High-Order Methods↗

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

Direct Numerical Simulations↗

Analysis of cure in composites processing

Finite element analysis is a general numerical tool for solving the field equations of engineering practice, and this paper demonstrates its use in modeling the nonisothermal cure of pultruded composite material. A very simple grid is used in this case to model a narrow strip of material, and this grid is then solved using a time-stepping transient algorithm to simulate the passage of the strip along the pultruder die. As time proceeds, heat is conducted into the strip from the heated boundaries at the die walls, and cure proceeds at a rate dependent on the local temperature. The computer model can be used to minimize the time needed for sufficient cure, and helps avoid such processing errors as undercure or thermal degradation.

Aylward, L.↗

Velocity and pressure fields associated with near-wall turbulence structures

Computer generated databases containing velocity and pressure fields in three-dimensional space at a sequence of time-steps, were used for the investigation of near-wall turbulence structures, their space-time evolution, and their associated pressure fields. The main body of the results were obtained from simulation data for turbulent channel flow at a Reynolds number of 180 (based on half-channel height and friction velocity) with a grid of 128 x 129 x and 128 points. The flow was followed over a total time of 141 viscous time units. Spanwise centering of the detected structures was found to be essential in order to obtain a correct magnitude of the associated Reynolds stress contribution. A positive wall-pressure peak is found immediately beneath the center of the structure. The maximum amplitude of the pressure pattern was, however, found in the buffer region at the center of the shear-layer. It was also found that these flow structures often reach a maximum strength in connection with an asymmetric spanwise motion, which motivated the construction of a conditional sampling scheme that preserved this asymmetry.

Johansson, Arne V.↗

Scalability study of parallel spatial direct numerical simulation code on IBM SP1 parallel supercomputer

The implementation and the performance of a parallel spatial direct numerical simulation (PSDNS) code are reported for the IBM SP1 supercomputer. The spatially evolving disturbances that are associated with laminar-to-turbulent in three-dimensional boundary-layer flows are computed with the PS-DNS code. By remapping the distributed data structure during the course of the calculation, optimized serial library routines can be utilized that substantially increase the computational performance. Although the remapping incurs a high communication penalty, the parallel efficiency of the code remains above 40% for all performed calculations. By using appropriate compile options and optimized library routines, the serial code achieves 52-56 Mflops on a single node of the SP1 (45% of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a 'real world' simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP for the same simulation. The scalability information provides estimated computational costs that match the actual costs relative to changes in the number of grid points.

Hanebutte, Ulf R.↗

Scalability of Parallel Spatial Direct Numerical Simulations on Intel Hypercube and IBM SP1 and SP2

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube and IBM SP1 and SP2 parallel computers is documented. Spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows are computed with the PSDNS code. The feasibility of using the PSDNS to perform transition studies on these computers is examined. The results indicate that PSDNS approach can effectively be parallelized on a distributed-memory parallel machine by remapping the distributed data structure during the course of the calculation. Scalability information is provided to estimate computational costs to match the actual costs relative to changes in the number of grid points. By increasing the number of processors, slower than linear speedups are achieved with optimized (machine-dependent library) routines. This slower than linear speedup results because the computational cost is dominated by FFT routine, which yields less than ideal speedups. By using appropriate compile options and optimized library routines on the SP1, the serial code achieves 52-56 M ops on a single node of the SP1 (45 percent of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a "real world" simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP supercomputer. For the same simulation, 32-nodes of the SP1 and SP2 are required to reach the performance of a Cray C-90. A 32 node SP1 (SP2) configuration is 2.9 (4.6) times faster than a Cray Y/MP for this simulation, while the hypercube is roughly 2 times slower than the Y/MP for this application. KEY WORDS: Spatial direct numerical simulations; incompressible viscous flows; spectral methods; finite differences; parallel computing.

Joslin, Ronald D.↗