Search NASA⌕ Search

SEARCH · Search NASA

Results for “virtual time”

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

Virtual Time III, Part 1: Unified Virtual Time Synchronization for Parallel Discrete Event Simulation

Algorithms for synchronization of parallel discrete event simulation have historically been divided between conservative methods that require lookahead but not rollback, and optimistic methods that require rollback but not lookahead. In this paper we present a new approach in the form of a framework called Unified Virtual Time (UVT) that unifies the two approaches, combining the advantages of both within a single synchronization theory. Whenever timely lookahead information is available, a logical process (LP) executes conservatively using an irreversible event handler. When lookahead information is not available the LP does not block, as it would in a classical conservative execution, but instead executes optimistically using a reversible event handler. The switch from conservative to optimistic synchronization and back is decided on an event-by-event basis by the simulator, transparently to the model code. UVT treats conservative synchronization algorithms as optional accelerators for an underlying optimistic synchronization algorithm, enabling the speed of conservative execution whenever it is applicable, but otherwise falling back on the generality of optimistic execution. We describe UVT in a novel way, based on fundamental invariants, monotonicity requirements, and synchronization rules. UVT permits zero-delay messages and pays careful attention to tie-handling using superposition. We prove that under fairly general conditions a UVT simulation always makes progress in virtual time. This is Part 1 of a trio of papers describing the UVT framework for PDES, mixing conservative and optimistic synchronization and integrating throttling control.

97 MATHEMATICS AND COMPUTING↗

Virtual Time III, Part 3: Throttling and Message Cancellation

This is Part 3 of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called Unified Virtual Time (UVT). In this part, we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables, GVT, CVT, TVT, and LVT, which were defined in Part 1. Here we also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of TVT, including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on optimistic lookahead, defined in a way that is symmetric to what we now call the conservative lookahead information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.

throttling↗

Virtual Time III, Part 2: Combining Conservative and Optimistic Synchronization

This is Part 2 of a trio of works intended to provide a unifying framework in which conservative and optimistic synchronization for parallel discrete event simulations can be freely and transparently combined in the same logical process on an event-by-event basis. Here, in this article, we continue the outline of an approach called Unified Virtual Time (UVT) that was introduced in Part 1, showing in detail via two extended examples how conservative synchronization can be refactored and combined with optimistic synchronization in the UVT framework. We describe UVT versions of both a basic time windowing algorithm called Unified Simple Time Windows and a refactored version of the Chandy-Misra-Bryant Null Message algorithm called Unified CMB.

97 MATHEMATICS AND COMPUTING↗

From Atoms to Wheels: The Role of Multi-Scale Modeling in the Future of Transportation Electrification

Traditionally, prototype hardware is built for validation testing to ensure battery systems design changes meet vehicle-level requirements, which is expensive both in cost and time. Virtual engineering (VE) of battery systems for electric vehicle (EV) propulsion offers a reduced-cost alternative to the traditional development process and uses multi-scale modeling to virtually probe the impact of design changes in a particular part on the overall performance of the system. This allows for rapid iteration over multiple design spaces, without committing to build hardware. This perspective article discusses current trends in VE for EV applications and proposes improvements to accelerate EV adoption.

Garrick, Taylor R. (ORCID:0000000322518129)↗

Calculation of rf-induced temporal jitter in ultrafast electron diffraction

A significant contribution to the temporal resolution of an ultrafast electron diffraction (UED) instrument is arrival time jitter caused by amplitude and phase variation of radio-frequency (rf) cavities. In this paper, we present a semianalytical approach for calculating rf-induced temporal jitter from klystron and rf cavity parameters. Our approach allows fast estimation of temporal jitter for MeV-UED beamlines and can serve as a virtual timing tool when shot-to-shot measurements of rf amplitude and phase jitters are available. A simulation study for the SLAC MeV-UED instrument is presented, and the temporal resolution of several beamline configurations is compared.

47 OTHER INSTRUMENTATION↗

Machine learning surrogate for charged particle beam dynamics with space charge based on a recurrent neural network with aleatoric uncertainty

In this work, we develop a machine learning (ML) model with aleatoric uncertainty for the low energy beam transport (LEBT) region of the LANSCE linear accelerator in which we model the transport of a space-charge-dominated 750 keV proton beam through a lattice of 22 quadrupole magnets. Our ML model is developed based on data generated by a Kapchinsky–Vladimirsky (KV) envelope model of beam transport. We show that a recurrent neural network can be used as a dynamical surrogate model for fast prediction of the LEBT beam envelope. Furthermore, we endow the model with the prediction of aleatoric uncertainty and compare three different approaches. We demonstrate that the ML-based uncertainty quantification models are well calibrated and produce good estimates of the regions where the model is less certain about its predictions. This ML framework is a necessary step in the development of a real-time virtual diagnostic tool with uncertainty quantification that can be integrated into more complex downstream tasks (e.g., adaptive control or learning flexible control policies via reinforcement learning) for improved efficiency in beam operations. In future work, we plan to expand on this preliminary study by considering more realistic envelope models that include longitudinal momentum spread and dispersive effects in bending magnets, as well as particle tracking codes with 3D space charge (such as and ). Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Overview of SMART Initiative

The objective of the SMART Initiative, i.e., Science-informed Machine Learning (ML) for Accelerating Real-Time Decisions in Subsurface Applications, is to show how the utilization of ML can significantly improve efficiency and effectiveness of field-scale commercial carbon storage operations in three main areas: real-time visualization, virtual learning, and real-time forecasting. This presentation reports the status of SMART initiative for demonstrating: (a) virtual learning during the pre-injection permitting phase, and (b) ML-assisted operational decision making and visualization.

Siriwardane, Hema↗

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Virtual sensing-enabled digital twin framework for real-time monitoring of nuclear systems leveraging deep neural operators

Abstract Real-time monitoring is a foundation of nuclear digital twin technology, crucial for detecting material degradation and maintaining nuclear system integrity. Traditional physical sensor systems face limitations, particularly in measuring critical parameters in hard-to-reach or harsh environments, often resulting in incomplete data coverage. Machine learning-driven virtual sensors offer a transformative solution by complementing physical sensors in monitoring critical degradation indicators. This paper introduces the use of Deep Operator Networks (DeepONet) to predict key thermal-hydraulic parameters in the hot leg of pressurized water reactor. DeepONet acts as a virtual sensor, mapping operational inputs to spatially distributed system behaviors without requiring frequent retraining. Our results show that DeepONet achieves low mean squared and Relative L2 error, making predictions 1400 times faster than traditional CFD simulations . These characteristics enable DeepONet to function as a real-time virtual sensor, synchronizing with the physical system to track degradation conditions and provide insights within the digital twin framework for nuclear systems.

Hossain, Raisa↗

Data Projection of the High Temperature Electrolysis System in the Dynamic Energy Transport and Integration Laboratory using Dynamic System Scaling

For nuclear power to be flexible in a functioning Integrated Energy System (IES), excess produced heat must be stored or utilized during times of low power demand to ensure a load factor of 1 while load balancing. The Dynamic Energy Transport and Integration Laboratory (DETAIL) is one facility that is under development to emulate IES conditions on the engineering-scale, planned to conduct virtual real time operations with industry-scale facilities, and is currently testing thermal storage and high temperature electrolysis. As part of the study to develop a method to preprocess input signals or postprocess output signals between systems of different scales via Dynamical System Scaling (DSS), the current research is one of the continued efforts branching from the data projection activity conducted for the Thermal Energy Distribution System and currently engages the High Temperature Electrolysis (HTE) System in DETAIL. The HTE SOEC electrical, fluid, and thermal dynamics Figure of Merits (FOM) were identified, governing equations and closure relations were successfully scaled, and relations between FOM scaling ratios were determined. Setting the scaling objectives to reform existing data to project a data set that doubly accelerated the electrolysis process while preserving the produced amount of hydrogen was generated for the full transient. The calculated boundary conditions were inlet temperature, stack current, and inlet steam mass flow rate at 1470 K, 121.1 A, and 1.886 g/s, respectively. The research outcomes demonstrated an output signal postprocessing case accelerating the hydrogen production without changing geometry, number of cells, and partial pressures.

08 HYDROGEN↗

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗

Critical Clearing Time for Droop-Controlled Grid-Forming Inverters With Circular Current Limiting and Virtual Impedance Current Limiting

The critical clearing time is a crucial parameter for assessing the large-signal stability of grid-forming (GFM) inverters. Variations in current limiters can significantly impact an inverter's transient behavior during large disturbances. Here, this letter introduces a method based on the power-angle relationship to evaluate the fault recovery of a droop-controlled GFM inverter under a three-phase bolted fault scenario, considering both the circular current limiter and the virtual impedance method. High-fidelity simulations validate the accuracy of the proposed formulas in estimating the critical clearing time of the GFM inverter.

42 ENGINEERING↗

Quasi-Steady Simulation of Glaze Ice Accretion and Heat Transfer in the Supercooled Large Droplet Regime in Atmospheric Turbulent Air Flow

Abstract To avoid the use of a computationally intensive full unsteady simulation while providing an accurate solution, a quasi-steady simulation has been performed to study glaze and mixed ice accretion in the supercooled large droplet (SLD) regime in turbulent flow of atmospheric air. We have attempted to find the minimum time-step necessary to adequately simulate the icing process on an airfoil surface. Based on node displacement, a mesh morphing scheme has been adopted in the computations to account for the moving boundaries that are caused by the continuous ice buildup. We have modeled ice accretion on an airfoil surface for a time period of 232 s using several time steps. At each time-step we solved the steady-state conservation equations for the air and droplet phases and then used the results as initial conditions for the next time position. The magnitude of the time-step ranged from a least accurate two-shot simulation (where the time-step is 116 s) to a most accurate 2320-shot simulation (where the time-step is 0.1 s). In-between these two extreme time steps, we have performed a three-shot simulation (where the time-step is 77.33 s), a four-shot simulation (where the time-step is 58 s), a six-shot simulation (where the time-step is 38.67 s), a 46-shot simulation (where the time-step is 5 s), and a 232-shot simulation (where the time-step is 1 s). We have done so to find out the degree of accuracy (or inaccuracy) of the multishot simulation approach and to find out the appropriate time-step needed for a successful and valid quasi-steady simulation. A valid quasi-steady simulation needs to use a time-step that is small enough to reproduce the full time-dependent solution within a very small error band. We have found that both the 1 s and the 0.1 s time steps produce virtually identical results. This is the primary litmus test that proves the validity of the quasi-steady-state assumption. The results adopted in this paper are thus all based on the more conservative 0.1 s time-step. In the process of performing the simulations, remeshing was required in order to maintain the grid density in zones of high curvature to be able to capture the full physics in those zones. After successfully modeling glaze ice accretion over the airfoil surface using the 0.1 s quasi-steady simulation approach, the effects of supercooled large droplets (SLDs) impacting the surface have been examined and presented in terms of the variation of the local collection efficiency, the water film thickness, and the heat transfer rate. Examination of the variation of the angle that the ice horn makes with the airfoil chord line demonstrated a 20% improvement in angle prediction when the time-step is reduced from 116 s to 0.1 s. The analysis also reveals a 12% or 8.5% increase in the maximum collection efficiency, βmax, depending on whether the value of the liquid water content (LWC) has been doubled from 0.5 g/m3 to 1 g/m3, or the value of the freestream velocity has been doubled from 75 m/s to 150 m/s, respectively. Because of the need to monitor the local collection efficiency and convective heat fluxes at each shot (regardless of the number of shots employed), the approach adopted here was found to be effective in successively and successfully reproducing the curvature of the glaze ice horn.

Engineering↗

Virtual tower measurements during the American WAKE ExperimeNt (AWAKEN)

Dual-Doppler lidar measurements were made during the American WAKE ExperimeNt to provide height-resolved measurements of wind speed and direction at multiple locations immediately south of the leading row turbines in the King Plains wind farm in Oklahoma. These so-called virtual tower measurements were performed to characterize the inflow into the wind farm and to assess possible upwind blockage effects due to the collective action of the wind farm. The campaign was conducted from 12 November 2022 to 17 October 2023, during which time 14 unique virtual tower locations were sampled with heights ranging from 240 to 490 m AGL. The wind retrieval algorithm provided estimates of the horizontal winds and their uncertainties with a vertical resolution of about 10 m, while also accounting for the tilt of the lidar platform. The virtual tower results are compared to collocated lidar wind profiling data at the A1 site, which was located roughly 2.4 rotor diameters south of the nearest turbine. The wind speed difference between the wind profiler and the virtual tower was found to be quite sensitive to atmospheric stability and wind direction below 250 m AGL. The largest differences were observed for inflow under stable conditions, where the profiler wind speeds were observed to be about 22% lower than the virtual tower near hub height. These results suggest that there are persistent horizontal gradients in the flow upwind of the wind farm which result in biased estimates using standard ground-based lidar wind profiling methods.

17 WIND ENERGY↗

A computational modeling framework for pre-clinical evaluation of cardiac mapping systems

There are a variety of difficulties in evaluating clinical cardiac mapping systems, most notably the inability to record the transmembrane potential throughout the entire heart during patient procedures which prevents the comparison to a relevant “gold standard”. Cardiac mapping systems are comprised of hardware and software elements including sophisticated mathematical algorithms, both of which continue to undergo rapid innovation. The purpose of this study is to develop a computational modeling framework to evaluate the performance of cardiac mapping systems. The framework enables rigorous evaluation of a mapping system’s ability to localize and characterize (i.e., focal or reentrant) arrhythmogenic sources in the heart. The main component of our tool is a library of computer simulations of various dynamic patterns throughout the entire heart in which the type and location of the arrhythmogenic sources are known. Our framework allows for performance evaluation for various electrode configurations, heart geometries, arrhythmias, and electrogram noise levels and involves blind comparison of mapping systems against a “silver standard” comprised of computer simulations in which the precise transmembrane potential patterns throughout the heart are known. A feasibility study was performed using simulations of patterns in the human left atria and three hypothetical virtual catheter electrode arrays. Activation times (AcT) and patterns (AcP) were computed for three virtual electrode arrays: two basket arrays with good and poor contact and one high-resolution grid with uniform spacing. The average root mean squared difference of AcTs of electrograms and those of the nearest endocardial action potential was less than 1 ms and therefore appears to be a poor performance metric. In an effort to standardize performance evaluation of mapping systems a novel performance metric is introduced based on the number of AcPs identified correctly and those considered spurious as well as misclassifications of arrhythmia type; spatial and temporal localization accuracy of correctly identified patterns was also quantified. This approach provides a rigorous quantitative analysis of cardiac mapping system performance. Proof of concept of this computational evaluation framework suggests that it could help safeguard that mapping systems perform as expected as well as provide estimates of system accuracy.

59 BASIC BIOLOGICAL SCIENCES↗

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗