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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A Semi-Analytical Approach for State-Space Electromagnetic Transient Simulation

Here, this paper proposes a semi-analytical approach for efficient and accurate electromagnetic transient (EMT) simulation of a power grid. The approach first derives a high-order semi-analytical solution (SAS) of the grid’s state-space EMT model using the differential transformation (DT), and then evaluates the solution over enlarged, variable time steps to significantly accelerate the simulations while maintaining its high accuracy on detailed fast EMT dynamics. The approach also addresses switches during large time steps by using a limit violation detection algorithm with a binary search-enhanced quadratic interpolation. Case studies are conducted on EMT models of the IEEE 39-bus system and large-scale systems to demonstrate the merits of the new simulation approach against traditional numerical methods.

electromagnetic transient↗
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Neural Network for Principle of Least Action

The principle of least action is the cornerstone of classical mechanics, theory of relativity, quantum mechanics, and thermodynamics. Here, we describe how a neural network (NN) learns to find the trajectory for a Lennard-Jones (LJ) system that maintains balance in minimizing the Onsager–Machlup (OM) action and maintaining the energy conservation. The phase-space trajectory thus calculated is in excellent agreement with the corresponding results from the “ground-truth” molecular dynamics (MD) simulation. Furthermore, we show that the NN can easily find structural transformation pathways for LJ clusters, for example, the basin-hopping transformation of an LJ 38 from an incomplete Mackay icosahedron to a truncated face-centered cubic octahedron. Unlike MD, the NN computes atomic trajectories over the entire temporal domain in one fell swoop, and the NN time step is a factor of 20 larger than the MD time step. The NN approach to OM action is quite general and can be adapted to model morphometrics in a variety of applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of T gates that grows as O ( N 5 ) per time step to calculate the impurity Green's function in the time domain, where N is the total number of energy levels in the AIM. Since the number of T gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires O ( N 6 ) computational resources per time step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A Deep Learning Pipeline for Optimizing Large-scale Phase Field Simulations

Phase field (PF) simulations are computationally expensive but remain a key analysis tool to understand the complex mechanisms of additive manufacturing (AM) processes. Each PF simulation-aided analysis requires thousands of node hours on leadership-class supercomputers. One of the main goals of these analyses is the study of microstructure evolution during the build process which begins with the onset of nucleation. Nucleation occurs under certain thermomechanical conditions which are not known a priori and many PF simulations are required to identify ranges of input thermo-mechanical parameters that can result in the onset of nucleation. Since many of the simulations do not result in nucleation, an analysis campaign often ends up wasting tremendous amounts of precious computing resources executing nucleation-absent simulations. The goal of this work is to design and train deep learning models to inform a PF simulation about the likelihood of the occurrence of nucleation in a future simulation time-step based on the state summary over a finite number of past time-steps of a running simulation. If the prediction determines that the running simulation is unlikely to reach nucleation in the allotted time, then its execution is stopped immediately ultimately resulting in vast reduction in wasted computations when accrued over all the PF simulations typically performed in a single or multiple analysis campaign(s). The paper presents the performance of a machine learning pipeline that uses a convolutional neural network (CNN) model to learn an embedding which is then used with a self-attention network to build a multi-task deep learning model to predict the likelihood of nucleation. The model also predicts the input parameters used in a simulation. Performance is compared with a baseline pipeline that uses an off-the-shelf LeNet-5 model to learn the initial embedding. Despite their smaller size, performance results indicate significant improvement in accuracy of the proposed models compared to the larger baseline models.

Kannan, Ramakrishnan {ramki}↗
DOE OSTI2021

Encoder–decoder neural network for solving the nonlinear Fokker–Planck–Landau collision operator in XGC

An encoder–decoder neural network has been used to examine the possibility for acceleration of a partial integro-differential equation, the Fokker–Planck–Landau collision operator. This is part of the governing equation in the massively parallel particle-in-cell code XGC, which is used to study turbulence in fusion energy devices. The neural network emphasizes physics-inspired learning, where it is taught to respect physical conservation constraints of the collision operator by including them in the training loss, along with the ℓ 2 loss. In particular, network architectures used for the computer vision task of semantic segmentation have been used for training. A penalization method is used to enforce the ‘soft’ constraints of the system and integrate error in the conservation properties into the loss function. During training, quantities representing the particle density, momentum and energy for all species of the system are calculated at each configuration vertex, mirroring the procedure in XGC. This simple training has produced a median relative loss, across configuration space, of the order of 10 –4 , which is low enough if the error is of random nature, but not if it is of drift nature in time steps. The run time for the current Picard iterative solver of the operator is O(n 2 ), where n is the number of plasma species. As the XGC1 code begins to attack problems including a larger number of species, the collision operator will become expensive computationally, making the neural network solver even more important, especially since its training only scales as O(n). Here, a wide enough range of collisionality has been considered in the training data to ensure the full domain of collision physics is captured. An advanced technique to decrease the losses further will be subject of a subsequent report. Eventual work will include expansion of the network to include multiple plasma species.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

An Orbital Basis Set for Double Photoionization of Atoms and Molecules

The ab initio theoretical treatment of one-photon double photoionization processes has been limited to atoms and diatomic molecules by the challenges posed by large grid-based representations of the double ionized continuum wave function. To provide a path for extensions to polyatomics, an energy-adapted orbital basis approach is demonstrated that reduces the dimensions of such representations and simultaneously allows larger time steps in time-dependent computational descriptions of double ionization. Additionally, an algorithm that exploits the diagonal nature of the two-electron integrals in the grid basis and dramatically accelerates the transformation between grid and orbital representations is presented. Excellent agreement between the present results and benchmark theoretical calculations is found for H – and Be atoms, as well as the hydrogen molecule, including for the triply differential cross sections that relate the angular distribution and energy sharing of all of the particles in the molecular frame.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Toward continuum gyrokinetic study of high-field mirrors

High-temperature superconducting (HTS) magnetic mirrors under development exploit strong fields with high mirror ratio to compress loss cones and enhance confinement and may offer cheaper, more compact fusion power plant candidates. This new class of devices could exhibit largely unexplored interchange and gradient-driven modes. Such instabilities, and methods to stabilize them, can be studied with gyrokinetics, given the strong magnetization and prevalence of kinetic effects. Our focus here is to (a) determine if oft-used gyrokinetic models for open field lines produce the electron-confining (Pastukhov) electrostatic potential and (b) examine and address challenges faced by gyrokinetic codes in studying HTS mirrors. Here, we show that a one-dimensional limit of said models self-consistently develops a potential qualitatively approaching the analytical Pastukhov level. Additionally, we describe the computational challenges of studying high mirror ratios with open field line gyrokinetic solvers and offer a force softening method to mitigate small time steps needed for time integration in colossal magnetic field gradients produced by HTS coils, providing a 19X speedup.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Hydroboost

HydroBoost is the most realistic revenue optimization tool for the hybridization of hydropower and battery energy storage systems to date. The innovative representation of how operators actually schedule hydropower in practice results in more realistic predictions of revenue and operations. Unlike other optimization tools, HydroBoost generates forecast energy prices with uncertainty to use in the optimization. This allows HydroBoost to give users a range of potential revenue with an upper bound using the perfect foresight pricing and a lower bound using a naive persistence forecast model. Additional forecast can be generated and used in the optimization, such as additive models, random forest, and neural networks to give further insight into potential revenue. HydroBoost has been designed to be applicable for both run-of-river and reservoir storage sites. The primary focus is on the day-ahead market and requires year-long data with an hour time-step. All time-series input and constraints are contained in an Excel worksheet for convince. The user will run the forecasting generation first with a Python script to give the optimization model the necessary requirements. Next the optimization is ran using Julia and results are generated and stored into a directory as csv files. HydroBoost includes an additional module to generate figures based on the results of the optimization simulation. The results help analyze the results and users to draw insights into how the hydro and battery systems are operated and the revenue each is producing. Additionally, the difference between the perfect foresight model and models that include forecast can easily be inspected.

Phillips, TylerB. [Idaho National Laboratory (INL)↗
DOE OSTI2025

time-resolved spectroscopy fit (trspecfit) v0.01

Analyze 2D time- and energy-resolved data, such as from a pump-probe spectroscopy experiment. User can select and input different peak shapes/ functions and background types to first fit a ground state/ unperturbed spectrum. This would be similar to how standard spectroscopy data is fit. Subsequently, to describe the time domain, users can choose functions that describe the temporal dynamics of one or more spectral features, such as a peak amplitude, peak position, etc. These time dynamics functions can be added or convoluted (e.g. describing an instrument response function) with each other. Functionality to integrate implicit variables leading to distributions of certain parameters/ functions is in development. Alternatively, 2D data can be analyzed one time step at a time to get an idea of the time dynamics of the system before deploying the global 2D fit described above. Typically people write custom software for this purpose. During my PhD I've seen five internal LBL and external researchers write one-off code in different languages to analyze time- and energy-resolved spectra. While this was specifically was for a laser pump - X-ray probe spectroscopy experiment, I'm trying to write a general package for the time-resolved spectroscopy community.

Mahl, Johannes [Lawrence Berkeley National Laborat↗
DOE OSTI2025

Semi-implicit continuum kinetic modeling of weakly collisional parallel transport in a magnetic mirror

We present implicit-explicit (IMEX) kinetic simulations of weakly collisional parallel plasma transport in magnetic mirror configurations using the continuum code COGENT. The numerical scheme employs a Jacobian-free Newton–Krylov method with algebraic multigrid preconditioning to overcome the severe time step limitations imposed by strong mirror forces in fully explicit schemes. Applied to parameters relevant to the Wisconsin HTS Axisymmetric Mirror experiment, the IMEX approach enables time steps up to 2.5×10 4 times larger than those permitted by explicit methods, resulting in a 2500× speedup in 1D–2V simulations of parallel transport with kinetic ions and Boltzmann electrons. Additionally, a reduced bounce-averaged model for a square mirror is implemented to support the computationally intensive fully kinetic simulations. The bounce-averaged formulation is used to evaluate the numerical convergence of the velocity-space discretization algorithms and to assess the role of the collision model by comparing simulations employing the nonlinear Fokker–Planck and the simplified Lenard–Bernstein–Dougherty collision operators.

Collision theories↗
DOE OSTI2025

Axisymmetric gyrokinetic simulation of ASDEX-Upgrade scrape-off layer using a conservative implicit BGK collision operator

Collisions play an important role in turbulence and transport of fusion plasmas. For kinetic simulations, as the collisionality increases in the domain of interest, the size of the time step to resolve the collisional physics can become overly restrictive in an explicit time integration scheme, leading to high computational cost. With the aim of overcoming such restriction, we have implemented an implicit Bhatnagar–Gross–Krook (BGK) collision operator for use in the discontinuous Galerkin full-f gyrokinetic solver within the Gkeyll framework, which, when combined with Gkeyll's traditional explicit time integrator for collisionless advection, can significantly increase the time step in gyrokinetic simulations of highly collisional regimes. To ensure conservation of density, momentum, and energy, we utilize an iterative scheme to correct the discretized approximation to the equilibrium Maxwellian distribution to which the BGK collision operator relaxes. We have further generalized the BGK infrastructure, both the implicit scheme and the correction routine, to handle cross-species collisions. This improved implicit and conservative BGK operator is benchmarked against the more accurate but more computationally expensive Lenard–Bernstein–Dougherty (LBD) operator, which has been utilized in prior studies with Gkeyll. The implicit BGK operator enables 2D axisymmetric simulations of the ASDEX-Upgrade scrape-off layer to run 56 times faster to completion than the simulations with the LBD operator, because the BGK operator is more robust and converges at a lower resolution than is required by the LBD operator. Additionally, in this more collisional limit, we demonstrate that the results of our simulations utilizing the implicit BGK operator agreed well with simulations utilizing the more computationally expensive LBD operator.

Gyrokinetic simulations↗
DOE OSTI2022

Weighted relaxation for multigrid reduction in time

Current trends in computer architectures now mean that faster computation speed must come primarily from increased concurrency, not faster clock speeds, which are stagnating. Thus, this situation creates bottlenecks for serial algorithms, including the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. Here, in this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that by choosing appropriate non-unitary relaxation weights, one can achieve faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%–20% saving in iterations, which is significant when using large high-performance computers. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Improving Solution Accuracy and Convergence for Stochastic Physics Parameterizations with Colored Noise

Stochastic parameterizations are used in numerical weather prediction and climate modeling to help capture the uncertainty in the simulations and improve their statistical properties. Convergence issues can arise when time integration methods originally developed for deterministic differential equations are applied naively to stochastic problems. In previous studies, it has been demonstrated that a correction term, known in stochastic analysis as the Itô correction, can help improve solution accuracy for various deterministic numerical schemes and ensure convergence to the physically relevant solution without substantial computational overhead. The usual formulation of the Itô correction is valid only when the stochasticity is represented by white noise. In this study, a generalized formulation of the Itô correction is derived for noises of any color. The formulation is applied to a test problem described by an advection–diffusion equation forced with a spectrum of fast processes. We present numerical results for cases with both constant and spatially varying advection velocities to show that, for the same time step sizes, the introduction of the generalized Itô correction helps to substantially reduce time integration error and significantly improve the convergence rate of the numerical solutions when the forcing term in the governing equation is rough (fast varying); alternatively, for the same target accuracy, the generalized Itô correction allows for the use of significantly longer time steps and, hence, helps to reduce the computational cost of the numerical simulation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Development of a Performance Portable Non-Equilibrium Plasma Fluid Solver on Adaptive Grids

This presentation will describe the numerical techniques, programming paradigms, verification, and performance of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures. Our plasma fluid model solves the conservation equations for self-consistent electrostatic Poisson, electron and heavy species transport, and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive mesh management library, AMReX (Zhang et al., JOSS, 4 (37) 1370, 2019), and can be built and run on widely available vendor specific GPU architectures (NVIDIA/AMD/Intel). We utilize a non-subcycled second order semi-implicit time-stepping method where all adaptive mesh refinement (AMR) levels are advanced with the same time step. The composite multi-level multigrid solver from within AMReX is used for each of the governing equations that are cast into a Helmholtz equation form. We have also developed a python based chemical mechanism parser framework that uses a similar format as CANTERA (Goodwin et al., Zenodo, 2018) yaml files as input. Our custom parser reads the yaml file and provides C++ files with transport and production rate functions that can be executed on both host (CPU) and device (GPU). We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on low-pressure capacitive and high-pressure streamer discharges. Our initial performance studies indicate 10X speed-up using 20 NVIDIA GPUs versus 200 CPUs for an atmospheric streamer discharge problem solved on a 512 x 1024 x 512 grid.

graphics processing units↗
DOE OSTI2023

PERKS: a Locality-Optimized Execution Model for Iterative Memory-bound GPU Applications

Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop on the host side that invokes the GPU kernel as much as time/algorithm steps there are. The termination of each kernel implicitly acts the barrier required after advancing the solution every time step. We propose an execution model for running memory-bound iterative GPU kernels: PERsistent KernelS (PERKS). In this model, the time loop is moved inside persistent kernel, and device-wide barriers are used for synchronization. We then reduce the traffic to device memory by caching subset of the output in each time step in the unused registers and shared memory. PERKS can be generalized to any iterative solver: they largely independent of the solver's implementation. We explain the design principle of PERKS and demonstrate effectiveness of PERKS for a wide range of iterative 2D/3D stencil benchmarks (geomean speedup of 2.12x for 2D stencils and 1.24x for 3D stencils over state-of-art libraries), and a Krylov subspace conjugate gradient solver (geomean speedup of 4.86x in smaller SpMV datasets from SuiteSparse and 1.43x in larger SpMV datasets over a state-of-art library). All PERKS-based implementations available at: https://github.com/neozhang307/PERKS.

Zhang, Lingqi↗
DOE OSTI2020

Stability Analysis of Interface Conditions for Ocean-Atmosphere Coupling

In this paper, we analyze the stability of different coupling strategies for multidomain PDEs that arise in general circulation models used in climate simulations. We focus on fully coupled ocean–atmosphere models that are needed to represent and understand the complicated interactions of these two systems, becoming increasingly important in climate change assessment in recent years. Numerical stability issues typically arise because of different time-stepping strategies applied to the coupled PDE system. In particular, the contributing factors include using large time steps, lack of accurate interface flux, and single-iteration coupling. We investigate the stability of the coupled ocean–atmosphere models for various interface conditions such as the Dirichlet–Neumann condition and the bulk interface condition, which is unique to climate modeling. By analyzing a simplified model, we demonstrate here how the parameterization of the bulk condition and other numerical and physical parameters affect the coupling stability and establish stability conditions for different coupling strategies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

GCAM v4.3 SSP-RCP-GCM Output Products

Supplemental dataset to: Graham N.T., M.I. Hejazi, M. Chen, E. Davies, J.A. Edmonds, S.H. Kim, and S. Turner, et al. 2020. "Humans drive future water scarcity changes across all Shared Socioeconomic Pathways." Environmental Research Letters 15, no. 1:Article No. 014007. PNNL-SA-151297. doi:10.1088/1748-9326/ab639b This analysis makes deterministic classifications of how, when water resources are limited and constrained, the human and climate systems interact. The relative effects of both systems on water scarcity are quantified at global and basin scales across 15 global futures that include five different socioeconomic conditions (the Shared Socioeconomic Pathways, SSPs) and four different climatic conditions (the Representative Concentration Pathways, RCPs). These 15 scenarios are used to first analyze a 'Human Alone' component by isolating the human impact on future scarcity. This is accomplished by holding all climate variables to their 2005 levels while altering socioeconomic growth and technological change. General circulation model (GCM) derived climate impacts for five models are applied to establish 75 'Human and Climate' scenarios which allows for the quantification of climate impacts. Climatic impacts to water supply, agricultural productivity and change, hydropower availability, and building energy demands are applied from 5 different bias-corrected GCMs to make a suite of 75 climate runs. By subtracting the human derived impacts from the 'Human Alone' scenarios, from the 'Human and Climate' scenarios the climate impact is isolated. First, the drivers of future water scarcity are evaluated by isolating the impacts that both humans and climate have while accounting for feedbacks between humans, energy, and land. Secondly, the simultaneous impacts that human and climate systems have on water scarcity are analyzed by determining whether each system is increasing or decreasing scarcity in all global water basins. Below we describe the GCAM model, the scenario components, climate derived impacts, and the calculations of scarcity changes and attribution. This study uses the global change assessment model (GCAM), with inclusions of water constraints to both renewable and nonrenewable sources of water, to investigate the relative contributions of climate and human systems on water scarcity regionally and globally under a wide range of scenarios. GCAM links socioeconomics, the energy system, land-use change, climate, and the water sector. GCAM is a market-equilibrium model that allows for prices to be adjusted within each time step to ensure that the supply and demand of goods and services remains equilibrated at each time step allowing for simultaneous market clearing across sectors. This study accounts for a limited supply of water by employing cost resource curves across all 235 basins that follow a logit formulation to determine the share of each water source (renewable surface water, nonrenewable groundwater, and desalinated water) needed to meet the water demands within all basins. As depletion of various water sources increases the extraction price increases, which leads to compounding price increases on the goods and services that require higher-priced water sources.

99 GENERAL AND MISCELLANEOUS↗