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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Hydro-Code Implementation and Testing of a Kinetic Phase Transition Framework

In this report we describe the Kinetic Phase Transition (KPT) framework that has been worked out over the last 10 years (from around 2014) and the implementation of it into three different codes, the one-dimensional hydro- LASLO and the three-dimensional magneto-hydro- ALEGRA, Sandia codes, via subroutines in the LAMBDA Equations of State and constitutive models package, and Flag, an arbitrary Lagrangian-Eulerian multiphysics code developed within the Lagrangian Applications project (LAP) at LANL. We discuss the introduction of phase mass (and/or volume) fractions that are needed in a code for it to be ‘phase aware’, that is, not only the thermodynamic state is known in each point but also the mixture of the materials’ phases in that point. Further we point to the need of a full Equations of State for each phase in a material to achieve phase awareness and we review the equilibrium phase model, where a phase mixture is at its lowest Gibbs free energy state, to make this point clear. Contrasting the kinetic phase transition to this equilibrium model seamlessly introduce us to the KPT framework that is subsequently thoroughly discussed. While the determination of the total state and the states and mass fractions of phases in each point is a problem that can borrow many of its numerical details from Eulerian codes and mixture of materials (not phases), the update of mass fractions with time in a KPT framework needs a new set of considerations. General for any update model is that we need to prevent mass fractions from becoming unphysical (negative or their sum to be larger than one). We have solved this problem by implementing a subdivision of the hydro time step that prevents the phase from being fully present to not present at all in one subdivided time step by limiting the size of the subdivided time step. This scheme also corrects numerical problems from abrupt changes in parameter values, the so called Gibbs phenomena, that gives rise to slushing between phases in the KPT framework. Interspersed throughout the report are discussions on different thermodynamics considerations. EOS validity windows, limitations on the EOS phase space, are needed for the KPT framework and are discussed separately and exemplified. The KPT framework described in this report has been verified by code comparison, but validation is still an active area of research. There is room for improvement in the update model, both in the model for determination of rates and in how to prevent the mass fractions from becoming unphysical. In addition, the parameters in the KPT update model and the placement of the phase boundary in the EOS phase space, and interactions with other constitutive models, are closely related and interfering with each other. One possible way forward is to simultaneously develop KPT parameters, EOS, and constitutive models for each material.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

An analysis of the spatio-temporal resolution of the immersed boundary method with direct forcing

The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

High temporal frequency data from a four turbine, blade-resolved wind farm simulation with ExaWind

The data was generated with ExaWind (https://github.com/Exawind) which couples AMR-Wind (https://github.com/Exawind/amr-wind/), Nalu-Wind (https://github.com/Exawind/nalu-wind), TIOGA (https://github.com/Exawind/tioga), and OpenFAST (https://github.com/OpenFAST/openfast). This is a large-scale simulation of a blade-resolved wind farm using the ExaWind software stack. ExaWind couples together a background flow solver, AMR-Wind, and a near-body solver, Nalu-Wind, through an overset technique from the TIOGA application. Another application, OpenFAST, handles the structural dynamics of the turbine blades and towers, which informs the fluid-structure interaction of the wind turbines with the flow solvers. This particular simulation includes four blade-resolved wind turbines operating in a turbulent atmospheric boundary layer. The AMR-Wind solver uses 500 million cells and is being solved on 256 AMD GPUs of the Oakridge Leadership Computing Facility Frontier supercomputer. Each turbine is assigned its own Nalu-Wind solver with over 13 million elements per turbine and solved using 448 CPU cores, for a total of 1792 CPU cores. For each node, 56 cores contain Nalu-Wind, while 8 cores correspond to AMR-Wind operations on the GPUs. Consequently, ExaWind is entirely utilizing the CPUs and the GPUs of the nodes concurrently. The data used in the visualization is full flow field data output from the simulation. It is lossy-compressed to a specific accuracy using ZFP and written to disk every 16 time-steps to enable real-time flow visualization. The flow fields are sampled at a high temporal frequency to enable real-time, 24fps visualization. The flow fields are sampled every 12 simulation time steps (every 0.04132s).

17 WIND ENERGY↗

NASA NTRS1985

A time-accurate multiple-grid algorithm

A time-accurate multiple-grid algorithm is described. The algorithm allows one to take much larger time steps with an explicit time-marching scheme than would otherwise be the case. Sample calculations of a scalar advection equation and the Euler equations for an oscillating airfoil are shown. For the oscillating airfoil, time steps an order of magnitude larger than the single-grid algorithm are possible.

Jespersen, D. C.↗

NASA NTRS1989

A cell-vertex multigrid method for the Navier-Stokes equations

A cell-vertex scheme for the Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing, a multigrid method, and carefully controlled artificial dissipative terms, very good convergence rates are obtained for a wide range of two- and three-dimensional flows over airfoils and wings. The accuracy of the code is examined by grid refinement studies and comparison with experimental data. For an accurate prediction of turbulent flows with strong separations, a modified version of the nonequilibrium turbulence model of Johnson and King is introduced, which is well suited for an implementation into three-dimensional Navier-Stokes codes. It is shown that the solutions for three-dimensional flows with strong separations can be dramatically improved, when a nonequilibrium model of turbulence is used.

Radespiel, R.↗

NASA NTRS1989

An efficient cell-vertex multigrid scheme for the three-dimensional Navier-Stokes equations

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.

Radespiel, R.↗

NASA NTRS1991

A multiple-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations

A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.

Atkins, Harold↗

NASA NTRS1991

A multi-block multigrid method for the solution of the Euler and Navier-Stokes equations for three-dimensional flows

A multi-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell-vertex method which employs central-difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques, and variable-coefficient numerical smoothing results in an efficient and robust scheme. The multi-block strategy places the block loop within the Runge-Kutta loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one- and two-block calculations in which the two-block grid is generated by splitting the one-block grid. Results are presented for both Euler and Navier-Stokes computations of wings and wing-fuselage combinations.

Atkins, H. L.↗

NASA NTRSDate not supplied

Enhancing Scalability for FUN3D Rotorcraft Simulations with Yoga: an Overset Grid Assembler

FUN3D, an unstructured grid Navier-Stokes CFD code is capable of overset grid simu- lations, but does not have an internal method for assembling an overset grid system from a group of component grids. FUN3D currently relies on the third party codes Suggar++ and DiRTlib to perform domain assembly and provide intergrid connectivity for overset simulations. Rotorcraft simulations with moving, deforming blades require domain assembly and mesh deformation at each time step. For these simulations, the three primary drivers of computational cost for each time step are: deforming the mesh, performing domain assembly, and performing subiterations of the flow solver. FUN3D exhibits strong and weak scalability for the flow solver subiterations and the mesh deformation. However, FUN3D is currently hardwired directly to the serial version of Suggar++, which has a fixed cost for a given mesh system. Therefore, domain assembly begins to dominate the total cost of each time step as grid systems become larger. An integrated method for parallel domain assembly is presented that addresses scalability for large grid systems. Restructuring within FUN3D to accommodate integrated domain assembly is also discussed, which could enable use of the parallel Suggar++ library.

Cameron T Druyor↗

DOE OSTI2020

Dimension-free path-integral molecular dynamics without preconditioning

Convergence with respect to imaginary-time discretization (i.e., the number of ring-polymer beads) is an essential part of any path-integral-based molecular dynamics (MD) calculation. However, an unfortunate property of existing non-preconditioned numerical integration schemes for path-integral molecular dynamics—including essentially all existing ring-polymer molecular dynamics (RPMD) and thermostatted RPMD (T-RPMD) methods—is that for a given MD time step, the overlap between the exact ring-polymer Boltzmann–Gibbs distribution and that sampled using MD becomes zero in the infinite-bead limit. This has clear implications for hybrid Metropolis Monte Carlo/MD sampling schemes, and it also causes the divergence with bead number of the primitive path-integral kinetic-energy expectation value when using standard RPMD or T-RPMD. We show that these and other problems can be avoided through the introduction of “dimension-free” numerical integration schemes for which the sampled ring-polymer position distribution has non-zero overlap with the exact distribution in the infinite-bead limit for the case of a harmonic potential. Most notably, we introduce the BCOCB integration scheme, which achieves dimension freedom via a particular symmetric splitting of the integration time step and a novel implementation of the Cayley modification [R. Korol et al., J. Chem. Phys. 151, 124103 (2019)] for the free ring-polymer half-steps. More generally, we show that dimension freedom can be achieved via mollification of the forces from the external physical potential. The dimension-free path-integral numerical integration schemes introduced here yield finite error bounds for a given MD time step, even as the number of beads is taken to infinity; these conclusions are proven for the case of a harmonic potential and borne out numerically for anharmonic systems that include liquid water. The numerical results for BCOCB are particularly striking, allowing for nearly three-fold increases in the stable time step for liquid water with respect to the Bussi–Parrinello (OBABO) and Leimkuhler (BAOAB) integrators, while introducing negligible errors in the calculated statistical properties and absorption spectrum. Importantly, the dimension-free, non-preconditioned integration schemes introduced here preserve ergodicity and global second-order accuracy, and they remain simple, black-box methods that avoid additional computational costs, tunable parameters, or system-specific implementations.

Korol, Roman (ORCID:0000000193076351)↗

NASA NTRS1993

Time-accurate Navier-Stokes calculations with multigrid acceleration

A numerical scheme to solve the unsteady Navier-Stokes equations is described. The scheme is implemented by modifying the multigrid-multiblock version of the steady Navier-Stokes equations solver, TLNS3D. The scheme is fully implicit in time and uses TLNS3D to iteratively invert the equations at each physical time step. The design objective of the scheme is unconditional stability (at least for first- and second-order discretizations of the physical time derivatives). With unconditional stability, the choice of the time step is based on the physical phenomena to be resolved rather than limited by numerical stability which is especially important for high Reynolds number viscous flows, where the spatial variation of grid cell size can be as much as six orders of magnitude. An analysis of the iterative procedure and the implementation of this procedure in TLNS3D are discussed. Numerical results are presented to show both the capabilities of the scheme and its speed up relative to the use of global minimum time stepping. Reductions in computational times of an order of magnitude are demonstrated.

Melson, N. Duane↗

NASA NTRS2000

A gas-kinetic BGK scheme for the compressible Navier-Stokes equations

This paper presents an improved gas-kinetic scheme based on the Bhatnagar-Gross-Krook (BGK) model for the compressible Navier-Stokes equations. The current method extends the previous gas-kinetic Navier-Stokes solver developed by Xu and Prendergast by implementing a general nonequilibrium state to represent the gas distribution function at the beginning of each time step. As a result, the requirement in the previous scheme, such as the particle collision time being less than the time step for the validity of the BGK Navier-Stokes solution, is removed. Therefore, the applicable regime of the current method is much enlarged and the Navier-Stokes solution can be obtained accurately regardless of the ratio between the collision time and the time step. The gas-kinetic Navier-Stokes solver developed by Chou and Baganoff is the limiting case of the current method, and it is valid only under such a limiting condition. Also, in this paper, the appropriate implementation of boundary condition for the kinetic scheme, different kinetic limiting cases, and the Prandtl number fix are presented. The connection among artificial dissipative central schemes, Godunov-type schemes, and the gas-kinetic BGK method is discussed. Many numerical tests are included to validate the current method.

Xu, Kun↗

NASA NTRS1986

Comparison of Euler and full potential marching techniques for flows over complex configurations

Two recently developed aerodynamic prediction techniques based on the steady full potential equation and the unsteady Euler equations have been applied to a variety of three-dimensional supersonic flow problems exhibiting embedded subsonic regions. Both techniques utilize planar Gauss-Seidel relaxation in the marching direction and approximate factorization in the cross-flow plane. A conservative switching scheme and flux bias technique are employed in the full potential method to transition from the supersonic marching procedure to a subsonic relaxation algorithm and vice versa. A new unified approach with finite volume, high accuracy (up to third order) Total Variation Diminishing formulation (based on Roe's scheme) is used in the Euler solver. In the supersonic regions of the flow an 'infinitely large' time step is employed, and a finite time step is applied in the subsonic regions of the flow to reach the steady-state as a time-asymptote. Numerical solutions are obtained for a number of complex configurations, including: (1) an elliptic waverider, (2) a realistic fighter configuration, (3) the Space Shuttle, and (4) a Shuttle-like configuration. Both the Full Potential and Euler numerical results are in good agreement with available experimental data.

Szema, K. Y.↗

NASA NTRS2014

High-Order Residual-Distribution Hyperbolic Advection-Diffusion Schemes: 3rd-, 4th-, and 6th-Order

In this paper, spatially high-order Residual-Distribution (RD) schemes using the first-order hyperbolic system method are proposed for general time-dependent advection-diffusion problems. The corresponding second-order time-dependent hyperbolic advection- diffusion scheme was first introduced in [NASA/TM-2014-218175, 2014], where rapid convergences over each physical time step, with typically less than five Newton iterations, were shown. In that method, the time-dependent hyperbolic advection-diffusion system (linear and nonlinear) was discretized by the second-order upwind RD scheme in a unified manner, and the system of implicit-residual-equations was solved efficiently by Newton's method over every physical time step. In this paper, two techniques for the source term discretization are proposed; 1) reformulation of the source terms with their divergence forms, and 2) correction to the trapezoidal rule for the source term discretization. Third-, fourth, and sixth-order RD schemes are then proposed with the above techniques that, relative to the second-order RD scheme, only cost the evaluation of either the first derivative or both the first and the second derivatives of the source terms. A special fourth-order RD scheme is also proposed that is even less computationally expensive than the third-order RD schemes. The second-order Jacobian formulation was used for all the proposed high-order schemes. The numerical results are then presented for both steady and time-dependent linear and nonlinear advection-diffusion problems. It is shown that these newly developed high-order RD schemes are remarkably efficient and capable of producing the solutions and the gradients to the same order of accuracy of the proposed RD schemes with rapid convergence over each physical time step, typically less than ten Newton iterations.

Mazaheri, Alireza R.↗

NASA NTRS1991

A variable multi-step method for transient heat conduction

A variable explicit time integration algorithm is developed for unsteady diffusion problems. The algorithm uses nodal partitioning and allows the nodal groups to be updated with different time steps. The stability of the algorithm is analyzed using energy methods and critical time steps are found in terms of element eigenvalues with no restrictions on element types. Several numerical examples are given to illustrate the accuracy of the method.

Smolinski, Patrick↗

NASA NTRS1984

A numerical transport scheme which avoids negative mixing ratios

A new scheme for numerically integrating the transport equation has been developed. This square root method avoids the problem of negative mixing ratios by using the square root of the concentration instead of the concentration itself as an advective time step. Conservation of total mass at every time step is achieved by extending the concept of quadratic conservation to the numerical time integration method. A few time schemes that fulfill the requirement of step-by-step quadratic conservation are described, the simplest of which is the modified Lax-Wendroff method.

Schneider, H.-R.↗

NASA NTRS1988

An explicit Runge-Kutta method for 3D turbulent incompressible flows

A computer code has been developed to solve for the steady-state solution of the 3D incompressible Reynolds-averaged Navier-Stokes equations. The approach is based on the cell-center, central-difference, finite-volume formulation and an explicit one-step, multistage Runge-Kutta time-stepping scheme. The Baldwin-Lomax turbulence model is used. Techniques to accelerate the rate of convergence to a steady-state solution include the preconditioned method, the local time stepping, and the implicit residual smoothing. Improvements in computational efficiency have been demonstrated in several areas. This numerical procedure has been used to simulate the turbulent horseshoe vortex flow around an airfoil/flat-plate juncture.

Sung, Chao-Ho↗

DOE OSTI2021

Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory

Direct simulation of the von Neumann dynamics for a general (pure or mixed) quantum state can often be expensive. One prominent example is the real-time time-dependent density functional theory (rt-TDDFT), a widely used framework for the first principle description of many-electron dynamics in chemical and materials systems. Practical rt-TDDFT calculations often avoid the direct simulation of the von Neumann equation, and solve instead a set of Schrödinger equations, of which the dynamics is equivalent to that of the von Neumann equation. However, the time step size employed by the Schrödinger dynamics is often much smaller. Here, in order to improve the time step size and the overall efficiency of the simulation, we generalize a recent work of the parallel transport (PT) dynamics for simulating pure states [An, Lin, Multiscale Model. Simul. 18, 612, 2020] to general quantum states. The PT dynamics provides the optimal gauge choice, and can employ a time step size comparable to that of the von Neumann dynamics. Going beyond the linear and near adiabatic regime in previous studies, we find that the error of the PT dynamics can be bounded by certain commutators between Hamiltonians, density matrices, and their derived quantities. Such a commutator structure is not present in the Schrödinger dynamics. We demonstrate that the parallel transport-implicit midpoint (PT-IM) method is a suitable method for simulating the PT dynamics, especially when the spectral radius of the Hamiltonian is large. The commutator structure of the error bound, and numerical results for model rt-TDDFT calculations in both linear and nonlinear regimes, confirm the advantage of the PT dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗