Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Time Stepping”

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 991 records · Page 55

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.↗

Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice

Here we address the scattering construction of discrete time quantum walks on the honeycomb lattice. We write the system general (unitary) one step time evolution operator in terms of: (i) complete arbitrary scattering matrices Γ{sup (j,k)}, defined on the sites (j,k) of the lattice and; and (ii) topological directional functions Φ, which represent the distinct ways we can keep track of the propagation directions along the three bonds attached to each (j,k). By imposing the Φ’s to comply with all the honeycomb translational and point group symmetries (in the case of Γ{sup (j,k)}=Γ), we obtain in total ten independent model versions, presenting different dynamical features. To study some of their traits, we consider the idea of ‘characteristic paths’ CPs (closely related to classical random walks), determining the CPs for each one of the ten formulations. We then discuss many numerical examples of time evolution dynamics for our scattering quantum walks. For the calculations we use few Γ’s, as the Discrete Fourier Transform (DFT) and Grover matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gas Flow Tightly Coupled to Elastoplastic Geomechanics for Tight- and Shale-Gas Reservoirs: Material Failure and Enhanced Permeability

We investigate coupled flow and geomechanics in gas production from extremely low permeability reservoirs such as tight and shale gas reservoirs, using dynamic porosity and permeability during numerical simulation. In particular, we take the intrinsic permeability as a step function of the status of material failure, and the permeability is updated every time step. We consider gas reservoirs with the vertical and horizontal primary fractures, employing the single and dynamic double porosity (dual continuum) models. We modify the multiple porosity constitutive relations for modeling the double porous continua for flow and geomechanics. The numerical results indicate that production of gas causes redistribution of the effective stress fields, increasing the effective shear stress and resulting in plasticity. Shear failure occurs not only near the fracture tips but also away from the primary fractures, which indicates generation of secondary fractures. These secondary fractures increase the permeability significantly, and change the flow pattern, which in turn causes a change in distribution of geomechanical variables. From various numerical tests, we find that shear failure is enhanced by a large pressure drop at the production well, high Biot's coefficient, low frictional and dilation angles. Smaller spacing between the horizontal wells also contributes to faster secondary fracturing. When the dynamic double porosity model is used, we observe a faster evolution of the enhanced permeability areas than that obtained from the single porosity model, mainly due to a higher permeability of the fractures in the double porosity model. These complicated physics for stress sensitive reservoirs cannot properly be captured by the uncoupled or flow-only simulation, and thus tightly coupled flow and geomechanical models are highly recommended to accurately describe the reservoir behavior during gas production in tight and shale gas reservoirs and to smartly design production scenarios.

02 PETROLEUM↗

Performance Characteristics of HYDRA - a Multi-Physics simulation code from Lawrence Livermore National Laboratory

HYDRA is used to simulate a variety of experiments carried out at the National Ignition Facility (NIF) [4] and other high energy density physics facilities. HYDRA has packages to simulate radiation transfer, atomic physics, hydrodynamics, laser propagation, and a number of other physics effects. HYDRA has over one million lines of code and includes both MPI and thread-level (OpenMP and pthreads) parallelism. This paper measures the performance characteristics of HYDRA using hardware counters on an IBM BlueGene/Q system. We report key ratios such as bytes/instruction and memory bandwidth for several different physics packages. The total number of bytes read and written per time step is also reported. We show that none of the packages which use significant time are memory bandwidth limited on a Blue Gene/Q. HYDRA currently issues very few SIMD instructions. The pressure on memory bandwidth will increase if high levels of SIMD instructions can be achieved.

97 MATHEMATICS AND COMPUTING↗

Decrease time-to-solution through improved linear-system setup and solve

The goal of the ExaWind project is to enable predictive simulations of wind farms composed of many MW-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines, and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary code in the ExaWind project is Nalu, which is an unstructured-grid solver for the acoustically-incompressible Navier-Stokes equations, and mass continuity is maintained through pressure projection. The model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as re-initialization of matrices and re-computation of preconditioners is required at every time step We describe in this report our efforts to decrease the setup and solution time for the mass-continuity Poisson system with respect to the benchmark timing results reported in FY18 Q1. In particular, we investigate improving and evaluating two types of algebraic multigrid (AMG) preconditioners: Classical Ruge-Stfiben AMG (C-AMG) and smoothed-aggregation AMG (SA-AMG), which are implemented in the Hypre and Trilinos/MueLu software stacks, respectively. Preconditioner performance was optimized through existing capabilities and settings.

17 WIND ENERGY↗

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↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (control-lable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

The Development of a Generalized Riser Flow Regime Map Based Upon Higher Moment and Chaotic Statistics Using Electrical Capacitance Volume Tomography (ECVT)

Dynamic analyses have been applied to the temporal signals from an Electro Capacitance Volume Tomography instrument located near mid-height on the riser of an industrial-scale cold-flow circulating fluidized bed to characterize gas-solids flow behavior in the riser. Twelve capacitance electrodes surround the cylindrical riser over a height of 1.3 m. The instrument used a neural network deconvolution algorithm to determine the spatially resolved solids fraction recorded at 52 Hz. Experiments were carried out over a range of gas and solids flows in the transport regime using a Geldart Group B bed material, high density polyethylene with mean particle size of 880 μm. The radial solids distribution was found to vary from one-time step to the next between profiles typical of laminar and turbulent flow. The duration of time spent in each of these flow profiles depended upon the operating regime – dilute, core-annular, or fast fluidized bed. The chaotic structure of the temporal data was characterized using the three conventional approaches: the first 4 moments from the distribution of signal in time, system memory parameters from the autocorrelation function and the Hurst exponent, and analysis of the correlationentropy and correlation dimension of the attractor. These signal analysis techniques were used to clearly distinguish differences between different transport operating regimes. Specifically, it was experimentally observed that a riser transitions from core annular flow profile to dilute and dense regimes via increasing the frequency of short term transients to either dilute or dense flow profiles, respectively. A regime map was generated based upon these dynamics using solids flux and gas velocity axes. Fast fluidized, core annular, and dilute each exhibited different degree of dynamic characteristics typical of fluid dominated or particle compromising behavior. It should be noted that the magnitude for the different statistics was in the same range regardless of the regime, it was the radial profile for the statistic that changed and subsequently identified that there was a change in the regime. Finally, a reduced regime map was developed consisting of plotting the gas velocity normalized by the upper transport velocity versus the solids flux normalized by the saturation carrying capacity. The use of this reduced plot allowed the data from widely different conditions to be plotted and compared on the same<p>graph. Note that in many instances, some of the statistics identified the operating point as being in one regime while others indicated that it was in another indicating a transition region between dilute or core annular regimes and between the core annular and fast fluidization regimes. This now provides a tool that can be used to optimize process performance, identify changes in operating states, or replicate process dynamics during process scaling or changing operating parameters. </p>

Breault, Ronald↗

A Positive-Definite, WENO-Limited, High-Order Finite Volume Solver for 2-D Transport on the Cubed Sphere Using an ADER Time Discretization

Modern computer architectures reward added computation if it reduces algorithmic dependence, reduces data movement, increases accuracy/robustness, and improves memory accesses. The driving motive for this study is to develop a numerical algorithm that respects these constraints while improving accuracy and robustness. This study introduces the ADER-DT (Arbitrary DERivatives in time and space-differential transform) time discretization to positive-definite, weighted essentially nonoscillatory (WENO)-limited, finite volume transport on the cubed sphere in lieu of semidiscrete integrators. The cost of the ADER-DT algorithm is significantly improved from previous implementations without affecting accuracy. A new function-based WENO implementation is also detailed for use with the ADER-DT time discretization. While ADER-DT costs about 1.5 times more than a fourth-order, five-stage strong stability preserving Runge-Kutta (SSPRK4) method, it is far more computationally dense (which is advantageous on accelerators such as graphics processing units), and it has a larger effective maximum stable time step. ADER-DT errors converge more quickly with grid refinement than SSPRK4, giving 6.5 times less error in the L ∞ norm than SSPRK4 at the highest refinement level for smooth data. For nonsmooth data, ADER-DT resolves C 0 discontinuities more sharply. For a complex flow field, ADER exhibits less phase error than SSPRK4. In conclusion, improving both accuracy and robustness as well as better respecting modern computational efficiency requirements, we believe the method presented herein is competitive for efficiently transporting tracers over the sphere for applications targeting modern computing architectures.

97 MATHEMATICS AND COMPUTING↗