Search NASA⌕ Search

SEARCH · Search NASA

Results for “fast time simulation”

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 19 records

Fast Quasi-Static Time-Series Simulation for Accurate PV Inverter Semiconductor Fatigue Analysis with a Long-Term Solar Profile

Power system simulations with long-term data typically have large time steps varying from one second to a few minutes. However, for PV inverter semiconductors, the minimum thermal stress cycle occurs over the fundamental grid frequency (50 or 60 Hz). This requires the time step of the fatigue simulation to be around 100 µs. This small time step requires long computation times to process yearly power production profiles. This paper proposes a fast fatigue simulation for inverter semiconductors using the quasi-static time series (QSTS) simulation concept. The proposed simulation calculates the steady state of the semiconductor junction temperature by using a Fast Fourier Transform (FFT). The small thermal cycling during a switching period and even over the fundamental waveform is disregarded to further accelerate the simulation speed. The resulting time step of the fatigue simulation is 15 minutes, which is consistent with the solar dataset. The error of the proposed simulation is 0.16% compared to the fatigue simulation results using the complete thermal stress profile. A PV inverter that responds to a Transactive Energy System (TES) is simulated to demonstrate the use of the proposed fatigue simulation. The proposed simulation has the potential to co-simulate with system level simulation tools that also adopt the QSTS concept.

Liu, Yunting↗

Charaterization of Emerging Computing Architectures for Dynamic Simulation of Future Power Grids with Large-Scale Power Electronics

The increasing penetration of power electronics in power grids significantly raises the computing requirements in a real-time (and/or fast) simulation of the power grid. The real-time simulation is an enabler for evaluating controllers, protection systems, new equipment, and twinning. In this paper, emerging computing architectures such as tensor processing units (TPU), neural/neuromorphic processing units (NPU), and quantum processing units (QPU) are introduced and characterized for the real-time (and/or fast) simulation of power electronics-dominated power grids. The metrics and the process to characterize emerging computing architectures to perform real-time (and/or fast) simulations of future power grids with power electronics are discussed. Three of the emerging computing units are characterized based on these metrics and the process developed. This characterization will enable identification and comparison of emerging computing architectures that can perform real-time (and/or fast) simulation of future power grids.

Choi, Jongchan↗

Variational fast forwarding for quantum simulation beyond the coherence time

Abstract Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.

97 MATHEMATICS AND COMPUTING↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Control and Real-Time Simulation of Microgrids with EV Fast-Charging and Grid-Forming Resources

Fast charging stations (FCSs) for electric vehicles (EVs) can behave as constant power loads, which is problematic for the operation of grid-forming (GFM) inverter-based resources (IBRs). To tackle this problem, this paper proposes a control suite that makes FCSs responsive to ac voltage and frequency disturbances. To test the performance of the FCS controls, the paper also sets forth theory to compensate for time-delays appearing in the real-time simulation of microgrid models divided into several central processing units (CPUs). Furthermore, these contributions are showcased via multi-CPU real-time simulations of a faulted microgrid having EV FCSs and GFM IBRs powered by photovoltaic solar arrays as well as power hardware-in-the-loop experiments. These contributions are significant to address NERC recommendations and IEEE standards.

14 SOLAR ENERGY↗

APOLLO: a facility-scale differentiable virtual accelerator at Fermilab FAST/IOTA

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or yield additional insights like gradients. The FAST/IOTA facility has been working on implementing and experimentally validating an end-to-end digital twin that is both fast and gradient-aware, allowing for rapid prototyping of new software and experiments with minimal beam time costs. Our framework integrates physics and ML codes for linac and ring simulation through a set of generic interfaces between surrogate and physics-based sections. To reproduce device inputs and outputs, system state is exposed as a deterministic event loop in a specialized discrete event simulator architecture. Because Fermilab is undergoing control system transition, several APIs were implemented as final user interfaces - a fully asynchronous EPICS soft IOC, a gRPC-based Data Pool Manager (DPM), and legacy ACNET protocols. We discuss implementation details as well as challenges handling live data assimilation and future plans to extend modelling to main complex proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗

Towards fast, accurate predictions of RF simulations via data-driven modeling: Forward and lateral models

Three machine learning techniques (multilayer perceptron, random forest, and Gaussian process) provide fast surrogate models for lower hybrid current drive (LHCD) simulations. A single GENRAY/CQL3D simulation without radial diffusion of fast electrons requires several minutes of wall-clock time to complete, which is acceptable for many purposes, but too slow for integrated modeling and real-time control applications. More accurate simulations with fast electron diffusion are even slower, requiring multiple hours of run time with parallel processing. The machine learning models use a database of 16,000+ GEN-RAY/CQL3D simulations for training, validation, and testing. Latin hypercube sampling methods implemented in πScope ensure that the database covers the range of 9 input parameters (n e0 , T e0 , I p , B t , R 0 , n ∥︀ , Z e f f , V loop , P LHCD ) with sufficient density in all regions of parameter space. The surrogate models reduce the computation time from minutes-hours to ms with high accuracy across the input parameter space. Data-driven surrogate models also allow for solving inverse and “lateral” problems. A surrogate model for the inverse problem maps from a desired current drive or power deposition profile to a set of input parameters that would result in such a profile, while a surrogate model for the lateral problem maps from a measured experimental quantity such as hard x-ray emission to a current drive or power deposition profile. In conclusion, the πScope database creation workflow is flexible and applicable to other RF simulation codes such as TORIC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

APOLLO: a facility-scale differentiable virtual accelerator for Fermilab

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or yield additional insights like gradients. The FAST/IOTA facility has been working on implementing and experimentally validating an end-to-end digital twin that is both fast and gradient-aware, allowing for rapid prototyping of new software and experiments with minimal beam time costs. Our framework integrates physics and ML codes for linac and ring simulation through a set of generic interfaces between surrogate and physics-based sections. To reproduce device inputs and outputs, system state is exposed as a deterministic discrete event simulator. Because Fermilab is undergoing control system transition, both EPICS and ACNET frontends are supported. Recently, we have begun transitioning to a new community lattice standard, PALS, as well as developing standardized infrastructure for data ingest and normalization to prepare for model calibration during FAST proton injector commissioning. We discuss implementation details as well as challenges, and future plans to extend modelling to main complex proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗

Unified differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or produce insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate a unified start-to-end differentiable digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes, the development of generic interfaces between device models and surrogate or physics-based sections, and the export of the parameters through either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to support larger proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗

End-to-end differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using controllable-fidelity simulations that have fast execution time or can yield additional insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate an end-to-end digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes for linac and ring simulation, the development of generic interfaces between surrogate and physics-based sections, and presenting the control interface as either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to implement larger proton accelerators like PIPII and Booster.

Kuklev, N. [Fermilab]↗

Orbit-following simulations of fast-ion transport and losses due to the Alfvén eigenmode burst in the Large Helical Device

Orbit-following simulations of fast-ion transport and losses with time-dependent electromagnetic perturbations are performed to clarify the roles of Alfvén eigenmodes (AEs) and the low-frequency magnetohydrodynamic (MHD) mode observed in the kinetic-MHD hybrid simulation of AE bursts in the Large Helical Device. Fast-ion pressure profile flattening in the kinetic-MHD hybrid simulation can be reproduced by an orbit-following simulation with only the primary single AE of the time-dependent amplitude following the kinetic-MHD hybrid simulation result, while orbit-following simulations with constant AE amplitude of average level during AE burst cannot reproduce the fast-ion pressure profile flattening observed. The effects of other modes are negligible on the fast-ion pressure profile flattening. The fast-ion losses in kinetic-MHD hybrid simulation can be reproduced by an orbit-following simulation with time-dependent amplitude when the low-frequency MHD mode is considered in addition to multiple AEs. This indicates the synergetic effect of multiple AEs and the low-frequency MHD mode on fast-ion losses.

Seki, Ryohsuke↗

A Fast and Accurate Transient Stability Assessment Method Based on Deep Learning: WECC Case Study

Transient stability is one of the critical aspects of power system stability assessment. The increasing integration of inverter-based resources and the retirement of conventional synchronous generators result in the decreasing system inertia and growing complexity of system operating conditions. Using a few selected typical operating conditions cannot guarantee system transient stability in all operating conditions, and the time-domain simulation of all operating conditions requires tremendous time and is often infeasible. This paper proposes a more efficient transient stability assessment method based on deep learning. The binary search method is used to determine the critical clearing time (CCT) in creating training databased by time-domain simulation. This method is fast and accurate with 1 ms resolution. The buses whose CCTs are lower than 200 ms are considered critical buses. Buses close to each other are grouped based on their mutual admittance matrix to reduce the search space of the critical buses. This paper also proposes the generator feature normalization based on the physical model. Case study on the reduced 240-bus WECC system model demonstrates that the proposed method can predict CCT accurately and efficiently.

critical clearing time↗

Multifrequency eddy-current detection of fast transient thermal signatures for in situ monitoring applications

Eddy-current (EC) nondestructive evaluation has a long history of use in a variety of ex situ defect monitoring applications because of its exquisite sensitivity to local material variations. Due to the relationship between a material's conductivity and its temperature, EC methods have also been used to investigate quasistatic, long-range temperature variations in casting applications. However, these techniques remain underutilized for the measurement of rapidly varying, spatially nonuniform temperature distributions. In this work, we construct a model system capable of generating repeatable temperature transients in steel plates and measure real-time eddy-current signals with millisecond time resolution and spatial resolution of the order of 1 mm. Using a combination of Multiphysics simulations, fast thermal imaging, and time-resolved holographic interferometry, we tease apart contributions to the eddy-current signals arising from temperature variations and transient plate deformation. Finally, we perform a systematic study in which we vary the plate thickness and the eddy-current excitation frequency to demonstrate that eddy-current techniques can provide information about a three-dimensional, time-varying, subsurface thermal distribution, which is inaccessible to the traditional thermal imaging techniques.

Rosenberg, Ethan R. [Lawrence Livermore National L↗

Rapid Simulation of Unconventional Reservoirs by Multidomain Multiresolution Modeling Based on the Diffusive Time of Flight

Summary The fast marching method (FMM)-based rapid flow simulation has been shown to accelerate simulation efficiency by orders of magnitude by transforming 3D simulation to equivalent 1D simulation using the concept of the “diffusive time of flight” (DTOF). However, the 1D transformation does not directly apply to multiwell problems. In this paper, we propose a novel DTOF-based multidomain multiresolution discretization scheme to accelerate multiwell simulation of unconventional reservoirs. Our method formulates multiwell simulation problems based on the DTOF which displays the pressure front propagation in unconventional reservoirs. The DTOF contours are used to partition the reservoir into local and shared domains. A local domain is where the flow is dominated by a single well, and the shared domain is where the fluid flow is influenced by multiple wells. The DTOF contours expand independently in local domains and interfere in the shared domain. After the partitioning, each domain is discretized using a multiresolution scheme whereby the original 3D fine mesh is preserved near the wells to account for detailed physics including gravity, and the rest of the domain is discretized into 1D mesh based on the DTOF contours to alleviate the simulation workload. The power and efficacy of our approach are demonstrated using synthetic and field-scale simulation models with different degrees of geologic and well-completion complexity. The simulation results, number of active cells, and computation time for the proposed discretization scheme are compared with the original high-fidelity 3D model for each case. The results show that the proposed method is suitable for multiwell simulation problems in unconventional reservoirs and can accelerate flow simulations by orders of magnitude with minimal loss of accuracy. The novelty of this work is the creation of DTOF-derived multiresolution discretization with local and shared domains to simplify and accelerate the calculation of subsurface flow problems, especially in unconventional reservoirs. Our workflow can be easily interfaced with commercial simulators, making it suitable for large-scale field applications.

Engineering↗

Application of a temporal multiscale method for efficient simulation of degradation in PEM Water Electrolysis under dynamic operating conditions

Hydrogen is emerging as a vital energy carrier, driven by the need to reduce carbon emissions. Proton Electrolyte Membrane Water Electrolysis (PEMWE) enables hydrogen production under fluctuating renewable power conditions but requires improved understanding and stability of the anode catalyst layer under dynamic operating conditions, especially with low noble metal loadings. Long-term degradation experiments are both time-consuming and costly; therefore, a systematic, model-aided approach is essential. In the present work, a temporal multiscale method is applied to reduce the computational effort of simulating long-term degradation processes in PEMWE, with an exemplary focus on catalyst dissolution. A mechanistic model incorporating the oxygen evolution reaction, catalyst dissolution, and hydrogen permeation from the cathode to the anode was hypothesized and implemented. In this way, the local periodicity of transport and reaction processes in dynamic PEMWE operation, which influence the gradual degradation of the catalyst layer, is captured. The temporal multiscale method significantly reduces the computational effort of simulation, decreasing processing time from hours to mere minutes. This efficiency gain is attributed to the limited evolution of Slow-Scale variables during each period of time P of the Fast-Scale variables. Consequently, simulation is required only until local periodicity is achieved within each Slow-Scale time step. Hence, the fully resolved dynamic problem is decoupled into these two scales, employing a heterogeneous multiscale technique. The developed approach effectively accelerates parameter estimation and predictive simulations, supporting systematic modeling of PEMWE degradation under dynamic conditions.

08 HYDROGEN↗

Quasi-Static Time Series Fatigue Simulation for PV Inverter Semiconductors with Long-Term Solar Profile

Power system simulations with long-term data tend to have large time steps varying from one second to a few minutes. However, for PV inverter semiconductors, the minimum thermal stresses cycle is with line frequency. This requires the time step of the fatigue simulation to be much smaller than the line period. This small time step results in poor simulation speed, especially for long-term simulations. This paper proposes a fast fatigue simulation for inverter semiconductors using the quasi-static time series (QSTS) simulation concept. The fatigue analysis typically focuses on the peak and valley values of a strain and neglect the transients from peaks to valleys. The proposed simulation utilizes this property of fatigue analysis and calculates the steady state of the semiconductor junction temperature only. The resulting time step of the fatigue simulation is 15 minutes, which is consistent with the solar dataset without losing accuracy.

fast simulation↗

Geant4 Simulation of Cherenkov Photons in Perovskite CsPbBr 3 Gamma-Ray Detectors

Perovskite materials have recently attracted significant attention for hard X-ray and gamma-ray detection. Cherenkov light generated by fast electrons due to gamma-ray interaction with the material can be used to provide fast timing information. Here, in this study, we report Geant4 simulation results of Cherenkov photon generation, transport, and detection within perovskite CsPbBr3. The Cherenkov photon yield, energy spectrum and temporal distribution are investigated under different gamma-ray energy deposition within CsPbBr3. CsPbBr 3 has a similar Cherenkov photon yield as of TlBr that has demonstrated fast-timing capability based on Cherenkov light. The effect of crystal volume, surface finish and SiPM photon detection efficiency on the Cherenkov detection is also discussed. This work provides insights into Cherenkov processes of CsPbBr3.

Cherenkov photon↗