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 361 records · Page 20

A fully implicit scheme for the barotropic primitive equations

An efficient implicit finite-difference method is developed and tested for a global barotropic model. The scheme requires, at each time step, the solution of only one-dimensional block-tridiagonal linear systems. This additional computation is offset by the use of a time step chosen independently of the mesh spacing. The method is second-order accurate in time and fourth-order accurate in space. Present experience indicates that this implicit method is practical for numerical simulation on fine meshes.

Cohn, S. E.↗

Unifying Temporal and Structural Credit Assignment Problems

Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.

Agogino, Adrian K.↗

Enabling Extended-Term Simulation of Power Systems with High PV Penetration. Final Report

This is the final Technical Report for DOE-SETO Project Award # DE-EE0036461. The goal of this project is to advance the understanding of the grid impact of high penetration of photovoltaic (PV) generation by developing novel numerical methods to solve the differential algebraic equations (DAEs) that define power systems. This will overcome the limitations of current software packages – namely that they only consider fast dynamics over brief time periods. The work presented in this final project report covers results over the entire period of the project. This includes results on model development, code development for the PST repository, datasets in the PST repository, algorithm development and results from variable time-step simulations, development and results from multirate simulations, and sensitivity analysis of key parameter in variable time-step methods. In addition, this report discusses project outreach activities to stakeholders, and a summary of project products. Also covered in this final report is the writing of two conference papers (one of which has already been accepted) and a journal paper. In addition, the updating of two inverter models (both grid forming and grid following) to be compatible with the latest version of PST software is discussed.

14 SOLAR ENERGY↗

Power series representation of partial derivatives required in orbit determination.

A program to integrate the equations of motion by series in powers of the time step can be easily modified to furnish the elements of the matrizant in power series of the time step. In particular, if the series representing the motion are obtained recursively, differentiation of the recurrence relations will provide immediately a recursive scheme for computing the coefficient in the power series for the elements of the matrizant.

Schanzle, A. F.↗

Structured Overlapping Grid Simulations of Contra-rotating Open Rotor Noise

Computational simulations using structured overlapping grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) solver framework are presented for predicting tonal noise generated by a contra-rotating open rotor (CROR) propulsion system. A coupled Computational Fluid Dynamics (CFD) and Computational AeroAcoustics (CAA) numerical approach is applied. Three-dimensional time-accurate hybrid Reynolds Averaged Navier-Stokes/Large Eddy Simulation (RANS/LES) CFD simulations are performed in the inertial frame, including dynamic moving grids, using a higher-order accurate finite difference discretization on structured overlapping grids. A higher-order accurate free-stream preserving metric discretization with discrete enforcement of the Geometric Conservation Law (GCL) on moving curvilinear grids is used to create an accurate, efficient, and stable numerical scheme. The aeroacoustic analysis is based on a permeable surface Ffowcs Williams-Hawkings (FW-H) approach, evaluated in the frequency domain. A time-step sensitivity study was performed using only the forward row of blades to determine an adequate time-step. The numerical approach is validated against existing wind tunnel measurements.

Grid↗

Multigrid, Fractional-Step Computation Of Flow

Speed of computer code solving three-dimensional Navier-Stokes equations of flow of incompressible fluid by fractional-step method increased significantly by use of multigrid procedures. In method, equations solved on general nonorthogonal curvilinear coordinate grid, using volume fluxes. At each time step, computations performed in two fractional steps. In first step, equations of conservation of momentum solved by use of gradient of pressure from previous time step via explicit approximate-factorization method, yielding approximate flow field that does not satisfy equation of conservation of mass. In second step, discrete Poisson-like equation with Neumann-type boundary conditions, formed by combining equations of conservation of momentum and mass, solved iteratively.

Kwak, Dochan↗

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗

Variational mesoscale satellite data assimilation and initialization

The problems of mesoscale satellite data assimilation were examined. Assimilation of satellite data to improve the forecasts made by mesoscale forecast models was undertaken. Assimilation of high resolution satellite derived temperature data into a mesoscale model with horizontal resolution of 50 to 60 km is reported. Unlike global assimilation, in which a small portion of the forecast model domain is subject to data insertion at virtually every time step, the mesoscale assimilation virtually all of the forecast model domain is subject to data insertion at one time step. The mesoscale problem lends itself naturally to intermittent data assimilation and the forecast model is reinitialized whenever a new satellite pass covers its domain with data. The satellite data assimilation as an initialization problem are discussed.

Sasaki, Y. K.↗

Central difference TVD and TVB schemes for time dependent and steady state problems

We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.

Jorgenson, P.↗

Central difference TVD and TVB schemes for time dependent and steady state problems

We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.

Jorgenson, P.↗

Creep Life Prediction of Ceramic Components Using the 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. Such long life requirements necessitate 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 work is to present a design methodology for predicting the lifetimes of structural components subjected to multiaxial creep loading. This methodology utilizes commercially available finite element packages and takes into account the time varying creep stress distributions (stress relaxation). In this methodology, the creep life of a component is divided into short time steps, during which, the stress and strain distributions are assumed constant. The damage, D, is calculated for each time step based on a modified Monkman-Grant creep rupture criterion. For components subjected to predominantly tensile loading, failure is assumed to occur when the normalized accumulated damage at any point in the component is greater than or equal to unity.

Jadaan, Osama M.↗

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗

A note on the leap-frog scheme in two and three dimensions

The paper considers the leap-frog finite-difference method (Kreiss and Oliger, 1973) for systems of partial differential equations of the form du/dt = dF/dx + dG/dy + dH/dz, where d denotes partial derivative, u is a q-component vector and a function of x, y, z, and t, and the vectors F, G, and H are functions of u only. The original leap-frog algorithm is shown to admit a modification that improves on the stability conditions for two and three dimensions by factors of 2 and 2.8, respectively, thereby permitting larger time steps. The scheme for three dimensions is considered optimal in the sense that it combines simple averaging and large time steps.

Abarbanel, S.↗

Land Surface Reflectances from Geostationary Sensors

GEONEX is a processing pipeline that produces a suite of satellite land surface products using data streams from the latest geostationary (GEO) sensors including the GOES016/ABI and the Himawari-8/AHI. The suite, created collaboratively by scientists from NASA and NOAA, includes top-of-atmosphere (TOA) reflectances, land surface reflectances (LSRs), vegetation indices, LAI/fPAR, and other downstream products. As a key component of the GEONEX product processing, we have adapted the Multi-Angle Implementation of Atmospheric Correction (MAIAC) algorithm to produce LSRs from the TOA data. Because the algorithm depends on building "stacks" of images, we first run internal geo-registration checks to ensure geo-spatial accuracy and consistency of the input (L1B) data before transferring them from the geostationary projection into a tile system in geographic grids. Scan-time is inferred from metadata and applied to calculate the sun-sensor angles for each grid cell. The MAIAC algorithm is run to detect clouds/shadows, estimate aerosol optical thickness (AOT), perform atmospheric corrections, and generate LSRs. We have processed 18-months (from 2016/04 onward) of AHI data over East Asia and Oceania at a 10-minute time step and 10-months (from 2018/01 onward) of ABI data over North and South Americas at a 15-minute time step. As a verification measure, we compare the GEONEX (AHI/ABI) surface reflectances with the standard MODIS products (MOD09GA) and the MODIS MAIAC products over pixels that have similar sun-view geometries. The results indicate general linear relationships between GEONEX and corresponding MODIS LSRs. In particular, the RMSEs between GEONEX and MOD09 data are comparable to those between MOD09 and MODIS MAIAC products, suggesting that the uncertainties of GEONEX LSRs fall into an acceptable range. However, direct comparisons of LSRs over pixels with different sun-view angles are not as straightforward and require more modeling efforts to correct the directional effects. Evaluation of such angular influences on the downstream products (e.g., vegetation indices) is also under investigation.

Geostationary satellite; Remote Sensing; Atmospher↗

Predicting rime ice accretion on airfoils

A method for predicting the droplet impingement and resulting rime ice accretion on airfoils in an incompressible, inviscid flowfield is presented. The governing equations for the water droplet trajectories are described briefly and the appropriate similarity parameters presented. Droplet impingement parameters are described for both monodisperse and arbitrary droplet size distributions. A time-stepping ice accretion process is presented where the flowfield and droplet impingement characteristics are updated periodically to model the time-dependent nature of the process. The method compares well to experimental results of both droplet impingement and rime ice shapes. The time stepping improves the accuracy of the ice shape predictions. Recommendations are given for further research.

Bragg, M. B.↗

The 'optimum' upwind advection on a triangular mesh

For advection schemes based on fluctuation splitting, a design criterion of optimizing the time step leads to linear schemes that coincide with those designed for least truncation error. A further stage of optimizing the time step using a nonlinear positivity criterion, leads to considerable further gains in resolution.

Roe, P. L.↗

Multigrid for hypersonic viscous two- and three-dimensional flows

The use of a multigrid method with central differencing to solve the Navier-Stokes equations for hypersonic flows is considered. The time dependent form of the equations is integrated with an explicit Runge-Kutta scheme accelerated by local time stepping and implicit residual smoothing. Variable coefficients are developed for the implicit process that removes the diffusion limit on the time step, producing significant improvement in convergence. A numerical dissipation formulation that provides good shock capturing capability for hypersonic flows is presented. This formulation is shown to be a crucial aspect of the multigrid method. Solutions are given for two-dimensional viscous flow over a NACA 0012 airfoil and three-dimensional flow over a blunt biconic.

Turkel, E.↗

Multigrid for hypersonic viscous two- and three-dimensional flows

The use of a multigrid method with central differencing to solve the Navier-Stokes equations for hypersonic flows is considered. The time-dependent form of the equations is integrated with an explicit Runge-Kutta scheme accelerated by local time stepping and implicit residual smoothing. Variable coefficients are developed for the implicit process that remove the diffusion limit on the time step, producing significant improvement in convergence. A numerical dissipation formulation that provides good shock-capturing capability for hypersonic flows is presented. This formulation is shown to be a crucial aspect of the multigrid method. Solutions are given for two-dimensional viscous flow over a NACA 0012 airfoil and three-dimensional viscous flow over a blunt biconic.

Turkel, E.↗