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 775 records · Page 43

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Performance Analysis of PIConGPU: Particle-in-Cell on GPUs using NVIDIA’s NSight Systems and NSight Compute

PIConGPU, Particle In Cell on GPUs, is an open source simulations framework for plasma and laser-plasma physics used to develop advanced particle accelerators for radiation therapy of cancer, high energy physics and photon science. While PIConGPU has been optimized for at least 5 years to run well on NVIDIA GPU-based clusters, there has been limited exploration by the development team of potential scalability bottlenecks using recently updated and new tools including NVIDIA’s NVProf tool and the brand-new NVIDIA NSight Suite (Systems and Compute) tools. PIConGPU is a highly optimized application that runs production jobs at scale on a system Oak Ridge Leadership Facility’s (OLCF) Summit supercomputer (using the full machine at 4600 nodes; at 98% of GPU utilization on all ~28000 NVIDIA Volta GPUs). PIConGPU has been selected as one of the the eight applications for OLCF’s coveted Center for Accelerated Application Readiness (CAAR) program aimed at the facility’s Frontier supercomputer (OLCF’s first exascale system to launch in 2021), to partner with our vendors (primary vendors: AMD and Cray/HPE) ensuring that Frontier will be able to perform large-scale science when it opens to users in 2022. To this effect, performance engineers on the PIConGPU team wanted to dive deep into the application to understand at the finest granularity, which portions of the code could be further optimized to exploit the hardware on Summit at it’s maximum potential and also to elucidate which key kernels should be tracked and optimized for the CAAR effort to port this code to Frontier. Any bottlenecks that are observed via performance profiling on Summit are likely to also impact scalability on the Frontier-dev system and the Frontier Early Access (EA) system. Additionally, the engineers wanted to take a closer look at the newest NVIDIA profiling tools which allows us to identify the most useful features on these tools and will provide an opportunity to compare it to new AMD and Cray’s performance analysis tool releases and provide feedback to our vendor partners on what features are most important and mission critical for CAAR efforts. The primary goal of this report is to focus on the evaluation of PIConGPU’s most time-intensive kernels using NVProf and NSight Suite. Three kernels, Current Deposition (also known as Compute Current), Particle Push (Move and Mark), and Shift Particles are known to be some of the most time-consuming kernels in PIConGPU. The Current xi Deposition kernel and Particle Push kernel both set up the particle attributes for running any physics simulation with PIConGPU, so it is crucial to improve the performance of these two kernels. In this report, we measure single GPU metrics for the three kernels, offer high level takeaways from the conducted analysis, and compare the profiling data from NSight Compute to that of NVProf. This analysis was performed using a grid size of 240 x 272 x 224, and 10 time steps with the Mid-November Figure of Merit (FOM) run setup. The Traveling Wave Electron Acceleration (TWEAC) science case used in this run is a representative science case for PIConGPU. This execution can also be used for baseline analysis on AMD MI50/ MI60 systems. As of the time of writing, the PIConGPU application has limited use for features of NSight Systems, so this report will mainly focus on insights garnered from NSight Compute. For this analysis, we run the “full” metric set available in NSight Compute version 2020.1.2 and use NSight Systems version 2020.3.1 to generate the application timeline.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1977

A solution to the Navier-Stokes equations based upon the Newton Kantorovich method

An implicit finite difference scheme based on the Newton-Kantorovich technique was developed for the numerical solution of the nonsteady, incompressible, two-dimensional Navier-Stokes equations in conservation-law form. The algorithm was second-order-time accurate, noniterative with regard to the nonlinear terms in the vorticity transport equation except at the earliest few time steps, and spatially factored. Numerical results were obtained with the technique for a circular cylinder at Reynolds number 15. Results indicate that the technique is in excellent agreement with other numerical techniques for all geometries and Reynolds numbers investigated, and indicates a potential for significant reduction in computation time over current iterative techniques.

Davis, J. E.↗

DOE OSTI2023

Operator inference with roll outs for learning reduced models from scarce and low-quality data

Data-driven modeling has become a key building block in computational science and engineering. However, data that are available in science and engineering are typically scarce, often polluted with noise and affected by measurement errors and other perturbations, which makes learning the dynamics of systems challenging. Here, in this work, we propose to combine data-driven modeling via operator inference with the dynamic training via roll outs of neural ordinary differential equations. Operator inference with roll outs inherits interpretability, scalability, and structure preservation of traditional operator inference while leveraging the dynamic training via roll outs over multiple time steps to increase stability and robustness for learning from low-quality and noisy data. Numerical experiments with data describing shallow water waves and surface quasi-geostrophic dynamics demonstrate that operator inference with roll outs provides predictive models from training trajectories even if data are sampled sparsely in time and polluted with noise of up to 10%.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2011

Does Terrestrial Drought Explain Global CO2 Flux Anomalies Induced by El Nino?

The El Nino Southern Oscillation is the dominant year-to-year mode of global climate variability. El Nino effects on terrestrial carbon cycling are mediated by associated climate anomalies, primarily drought, influencing fire emissions and biotic net ecosystem exchange (NEE). Here we evaluate whether El Nino produces a consistent response from the global carbon cycle. We apply a novel bottom-up approach to estimating global NEE anomalies based on FLUXNET data using land cover maps and weather reanalysis. We analyze 13 years (1997-2009) of globally gridded observational NEE anomalies derived from eddy covariance flux data, remotely-sensed fire emissions at the monthly time step, and NEE estimated from an atmospheric transport inversion. We evaluate the overall consistency of biospheric response to El Nino and, more generally, the link between global CO2 flux anomalies and El Nino-induced drought. Our findings, which are robust relative to uncertainty in both methods and time-lags in response, indicate that each event has a different spatial signature with only limited spatial coherence in Amazonia, Australia and southern Africa. For most regions, the sign of response changed across El Nino events. Biotic NEE anomalies, across 5 El Nino events, ranged from -1.34 to +0.98 Pg Cyr(exp -1, whereas fire emissions anomalies were generally smaller in magnitude (ranging from -0.49 to +0.53 Pg C yr(exp -1). Overall drought does not appear to impose consistent terrestrial CO2 flux anomalies during El Ninos, finding large variation in globally integrated responses from 11.15 to +0.49 Pg Cyr(exp -1). Despite the significant correlation between the CO2 flux and El Nino indices, we find that El Nino events have, when globally integrated, both enhanced and weakened terrestrial sink strength, with no consistent response across events

Schwalm. C. R.↗

DOE OSTI2025

Visualization techniques for the gyrokinetic tokamak simulation code

Gyrokinetic simulations of plasma microturbulence in tokamaks are challenging to visualize because the compute grid follows the magnetic field lines that spiral around the torus. We have overcome this challenge by developing three new approaches that improve visualization of gyrokinetics. Our techniques work directly with the topology of magnetic flux surfaces where the simulation stores variables in concentric rings on poloidal planes (vertical cross sections of the torus). Our visualization preview step triangulates each consecutive pair of rings to display the data on a poloidal plane. The second visualization technique follows spiral field lines around the torus and constructs polygons to visualize a flux surface. Third, the poloidal triangles are connected between planes to form prisms that compose a 3-D model of the entire torus. The visualization workflow produces detailed geometry that matches the high resolution, irregular compute grid for every time step. The surface and solid models are displayed in scientific visualization programs to effectively explore and communicate the results, including fluctuation of electron density, ion temperature, and electrostatic potential. Highly detailed renderings verify plasma behavior along magnetic field lines over time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1977

Atmospheric model development in support of SEASAT. Volume 3: Prediction models

As part of the SEASAT program of NASA, a set of four hemispheric, atmospheric models are developed. The four models use a polar stereographic grid in the horizontal and a sigma coordinate in the vertical. Conservation forms of the difference equations are integrated using either a fifteen or four minute time step on a 381 km or 127 km grid (at 60 deg N) for the 63 x 63 or 187 x 187 models respectively. A nonlinear pressure smoother is used along with momentum and temperature diffusion to help control computational noise. The horizontal boundary conditions are insulated slippery walls. Centered time differencing with time averaging of the pressure gradient force term in the momentum equations is used. Robert time filtering on of the temperature and moisture solutions is used for computational stability. The moisture and heat source/sink terms are modeled. Terms representing evaporation and large scale condensation, sensible heat exchange, parameterized cumulus convection and precipitation, and solar and terrestrial radiation are included. Initialization of the models is based on a pattern conservation technique to obtain objective analysis of the state parameter structure from the surface to 50 mb.

Wellck, R. E.↗

DOE OSTI2021

Error Analysis on Numerical Integration Algorithms in a Hypoelasticity Framework

This report determines local truncation errors for common stress integration algorithms used in explicit finite element codes with hypoelastic material models. The hypoelastic integration algorithms in question utilize an operator splitting procedure in a rotation neutralized configuration, where the stress response is determined from de- coupling the total deformation into rotational and strain dependent components. This document analyzes the error in evolving the stress given a one-step time increment Δt and compares the errors associated with both the rotational and strain components of the operator splitting method. A slight modification to a traditional algorithm is proposed and studied, where the rate of deformation is appropriately rotated from the midstep configuration at t n+1/2 to the end step configuration at t n+1 before the constitutive evaluation. The proposed modification either completely eliminates the error associated with the rotation rate or is of the same order of magnitude as the original algorithm for the three test cases considered in this report. These cases consist of an unaxial stretch with a constant true strain rate with a rigid body rotation, an uniaxial stretch with a constant engineering strain rate with a rigid body rotation, and a simple shear deformation. All three cases are compared to a closed form solution, and in almost every test case the alternative algorithm yields the most accurate one-step local truncation error.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP5

These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

DOE OSTI2023

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP3 and SSP5 [Updated simulations based on population-driven urban intensity transitions]

These data (v3) are updated from previous versions (1 and 2) in that they include consider the effects of population on transitions in urban land intensity. This leads to more reasonable differences in urban land projections under variant SSPs. For the present dataset, both SSP3 and SSP5 are provided. These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) and SSP 3 based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

NASA NTRS1997

Massively Parallel and Scalable Implicit Time Integration Algorithms for Structural Dynamics

Farhat, Charbel↗

NASA NTRS1995

Large-eddy simulations with wall models

The near-wall viscous and buffer regions of wall-bounded flows generally require a large expenditure of computational resources to be resolved adequately, even in large-eddy simulation (LES). Often as much as 50% of the grid points in a computational domain are devoted to these regions. The dense grids that this implies also generally require small time steps for numerical stability and/or accuracy. It is commonly assumed that the inner wall layers are near equilibrium, so that the standard logarithmic law can be applied as the boundary condition for the wall stress well away from the wall, for example, in the logarithmic region, obviating the need to expend large amounts of grid points and computational time in this region. This approach is commonly employed in LES of planetary boundary layers, and it has also been used for some simple engineering flows. In order to calculate accurately a wall-bounded flow with coarse wall resolution, one requires the wall stress as a boundary condition. The goal of this work is to determine the extent to which equilibrium and boundary layer assumptions are valid in the near-wall regions, to develop models for the inner layer based on such assumptions, and to test these modeling ideas in some relatively simple flows with different pressure gradients, such as channel flow and flow over a backward-facing step. Ultimately, models that perform adequately in these situations will be applied to more complex flow configurations, such as an airfoil.

Cabot, W.↗

NASA NTRS1995

Calculation of three-dimensional (3-D) internal flow by means of the velocity-vorticity formulation on a staggered grid

A method has been developed to accurately compute the viscous flow in three-dimensional (3-D) enclosures. This method is the 3-D extension of a two-dimensional (2-D) method developed for the calculation of flow over airfoils. The 2-D method has been tested extensively and has been shown to accurately reproduce experimental results. As in the 2-D method, the 3-D method provides for the non-iterative solution of the incompressible Navier-Stokes equations by means of a fully coupled implicit technique. The solution is calculated on a body fitted computational mesh incorporating a staggered grid methodology. In the staggered grid method, the three components of vorticity are defined at the centers of the computational cell sides, while the velocity components are defined as normal vectors at the centers of the computational cell faces. The staggered grid orientation provides for the accurate definition of the vorticity components at the vorticity locations, the divergence of vorticity at the mesh cell nodes and the conservation of mass at the mesh cell centers. The solution is obtained by utilizing a fractional step solution technique in the three coordinate directions. The boundary conditions for the vorticity and velocity are calculated implicitly as part of the solution. The method provides for the non-iterative solution of the flow field and satisfies the conservation of mass and divergence of vorticity to machine zero at each time step. To test the method, the calculation of simple driven cavity flows have been computed. The driven cavity flow is defined as the flow in an enclosure driven by a moving upper plate at the top of the enclosure. To demonstrate the ability of the method to predict the flow in arbitrary cavities, results will he shown for both cubic and curved cavities.

Stremel, Paul M.↗

DOE OSTI2024

Development of Decay Heat Sensitivity Analysis Capability in SCALE/ORIGEN

In this work, a decay heat sensitivity analysis capability was developed and implemented in the ORIGEN code of the SCALE nuclear modeling and simulation suite. This capability introduces improved numerical integration schemes, which overcome the challenges associated with accurately modeling the behavior of adjoint nuclide amounts during coarse time steps for both nuclide amount and decay heat sensitivity calculations. This capability significantly improves the accuracy of calculations without compromising computational efficiency compared to the existing method. Extensive verification was conducted for various benchmark problems, including a 238 Pu decay and an irradiation problem involving 135 Xe, evaluated with both coarse and fine time grids. The results show excellent agreement with reference direct perturbation solutions, reaffirming the computational accuracy of the newly proposed numerical integration methods. Furthermore, sensitivity analyses were performed for fission product inventories ( 147 Sm, 150 Sm, 155 Gd) in pressurized water reactor UO 2 and MOX fuel assemblies. These analyses demonstrated that the ORIGEN sensitivity analysis capability can capture detailed sensitivity coefficients and underlying physics in real applications. Additionally, a decay heat sensitivity analysis for high-assay low-enriched uranium fuel, including various initial 235 U enrichment and burnup points, highlights the extended capabilities of SCALE/ORIGEN in comprehensively assessing the factors influencing total decay heat. These advancements in ORIGEN offer valuable insights for reactor analysis, fuel design, and safety assessments, especially in the context of advanced nuclear fuel development and design changes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Numerical analyses of exponential time-differencing schemes for the solution of atmospheric models

In high-resolution numerical weather prediction models, fast-moving acoustic waves must be treated in a stable manner. Among the implicit–explicit (IMEX) schemes used for the solution of these models, horizontally explicit, vertically implicit (HEVI) methods show good stability and scalability on massively parallel machines. In this work, we present two classes of exponential time-differencing (ETD) methods for atmospheric models that use a HEVI splitting strategy, one being a three-stage method with the addition of artificial diffusion, the second based on a Strang splitting approach. Overall, the stability properties of the methods are analyzed and numerical examples are provided, which compare time-step restrictions and cost-to-accuracy ratios of the new methods with those for existing approaches.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1993

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

NASA NTRS1992

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

NASA NTRS1996

Solutions to Three-Dimensional Thin-Layer Navier-Stokes Equations in Rotating Coordinates for Flow Through Turbomachinery

The viscous, Navier-Stokes solver for turbomachinery applications, MSUTC has been modified to include the rotating frame formulation. The three-dimensional thin-layer Navier-Stokes equations have been cast in a rotating Cartesian frame enabling the freezing of grid motion. This also allows the flow-field associated with an isolated rotor to be viewed as a steady-state problem. Consequently, local time stepping can be used to accelerate convergence. The formulation is validated by running NASA's Rotor 67 as the test case. results are compared between the rotating frame code and the absolute frame code. The use of the rotating frame approach greatly enhances the performance of the code with respect to savings in computing time, without degradation of the solution.

Ghosh, Amrit Raj↗