Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation 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 1,135 records · Page 63

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

Learning turbulent flows with generative models for super resolution and sparse flow reconstruction

Neural operators are promising surrogates for dynamical systems but when trained with standard L 2 losses they tend to oversmooth fine-scale turbulent structures. Here, we show that combining operator learning with generative modeling overcomes this limitation. We consider three practical turbulent-flow challenges where conventional neural operators fail: spatio-temporal super-resolution, forecasting, and sparse flow reconstruction. For Schlieren jet super-resolution, an adversarially trained neural operator (adv-NO) reduces the energy-spectrum error by 15 × while preserving sharp gradients at neural operator-like inference cost. For 3D homogeneous isotropic turbulence, adv-NO trained on only 160 timesteps from a single trajectory forecasts accurately for five eddy-turnover times and offers 114 × wall-clock speed-up at inference than the baseline diffusion-based forecasters, enabling near-real-time rollouts. For reconstructing cylinder wake flows from highly sparse Particle Tracking Velocimetry-like inputs, a conditional generative model infers full 3D velocity and pressure fields with correct phase alignment and statistics. These advances enable accurate reconstruction and forecasting at low compute cost, bringing near-real-time analysis and control within reach in experimental and computational fluid mechanics.

Fluid dynamics↗

A high-throughput and low-waste viability assay for microbes

Abstract Counting viable cells is a universal practice in microbiology. The colony-forming unit (CFU) assay has remained the gold standard to measure viability across disciplines, but it is time-intensive and resource-consuming. Here we describe the geometric viability assay (GVA) that replicates CFU measurements over 6 orders of magnitude while reducing over 10-fold the time and consumables required. GVA computes a sample’s viable cell count on the basis of the distribution of embedded colonies growing inside a pipette tip. GVA is compatible with Gram-positive and Gram-negative planktonic bacteria ( Escherichia coli, Pseudomonas aeruginosa and Bacillus subtilis ), biofilms and fungi ( Saccharomyces cerevisiae ). Laborious CFU experiments such as checkerboard assays, treatment time-courses and drug screens against slow-growing cells are simplified by GVA. The ease and low cost of GVA evinces that it can replace existing viability assays and enable viability measurements at previously impractical scales.

59 BASIC BIOLOGICAL SCIENCES↗

Bottomonium suppression and elliptic flow using Heavy Quarkonium Quantum Dynamics

We introduce a framework called Heavy Quarkonium Quantum Dynamics (HQQD) which can be used to compute the dynamical suppression of heavy quarkonia propagating in the quark-gluon plasma using real-time in-medium quantum evolution. Using HQQD we compute large sets of real-time solutions to the Schrödinger equation using a realistic in-medium complex-valued potential. We sample 2 million quarkonia wave packet trajectories and evolve them through the QGP using HQQD to obtain their survival probabilities. The computation is performed using three different HQQD model parameter sets in order to estimate our systematic uncertainty. After taking into account final state feed down we compare our results to existing experimental data for the suppression and elliptic flow of bottomonium states and find that HQQD predictions are good agreement with available data for R AA as a function of N part and p T collected at \( \sqrt{s_{\mathrm{NN}}} \) = 5 . 02 TeV. In the case of v 2 for the various states, we find that the path-length dependence of ϒ(1 s ) suppression results in quite small v 2 for ϒ(1 s ). Our prediction for the integrated elliptic flow for ϒ(1 s ) in the 10 – 90% centrality class, which now includes an estimate of the systematic error, is v 2 [ϒ(1 s )] = 0 . 003 ± 0 . 0007 ± \( {}_{0.0013}^{0.0006} \) . We also find that, due to their increased suppression, excited bottomonium states have a larger elliptic flow. Based on this observation we make predictions for v 2 [ϒ(2 s )] and v 2 [ϒ(3 s )] as a function of centrality and transverse momentum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards real-time forecasting of natural gas production by harnessing graph theory for stochastic discrete fracture networks

In this work, we compare hydrocarbon production curves obtained from a graph-based reduced-order model with the high-fidelity Discrete Fracture Network (DFN) predictions for a fracture network created using data from a real shale site. We observe that the bounds for the high fidelity DFN model lie within the bounds for the reduced order model, implying that the reduced-order model provides a conservative estimate. Moreover, we found that except for first-passage times and late arriving mass, the production curves from the reduced-order model predict transport accurately. However, it is to be noted that the results are inspite of trading a three-dimensional geometry for a reduced system in the form of a graph, one that is 500–1000 times faster in terms of computational efficiency (for this particular application). In addition, we also compare the production curves for large drawdown and small drawdown using our graph approach. The reduced-order model is successful in showing that the long term productivity is higher in case of small drawdown although the initial productivity is higher for large drawdown. Thus, this reduced-order model offers great potential in uncertainty quantification for production, as well as in providing operators with information to make real-time decisions for optimal production.

03 NATURAL GAS↗

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗

Computational Analysis and Optimized Modeling of Geomagnetically Induced Currents in Power Transformers

In this project we aim to better understand the effect of geomagnetically induced currents (GIC) on power transformers. Expanding upon our previous work focused on producing a methodology for accuracy-enhanced computation of GIC signatures (i.e., time-domain current magnitude variation for the event duration) from a combination of physics-based and data-driven computational tools, we propose the use of these GIC signatures as inputs for a physically-detailed and optimized model of the power transformer to investigate how GIC determination and transformer modeling influence the evaluation of GIC effects on the transformer operation, as well as in its interaction with the power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A trait-based framework for linking microbial communities with carbon transformations under precipitation change

Droughts are common throughout the world. As the climate changes, droughts may become more frequent and intense. Still, scientists are uncertain about how drought will affect the natural world, particularly the bacteria, fungi, and other microbes that live in soils. These tiny life forms are crucial because they control the Earth’s flows of carbon and essential nutrients. Researchers at the University of California, Irvine, and Lawrence Berkeley National Laboratory teamed up to study how the microbiome, or collection of bacteria and fungi in the soil, deals with drought. Since 2007, the researchers have used shelters with retractable roofs to prevent nearly half of normal rainfall from reaching grass and shrub ecosystems, and their soil microbiomes, in Southern California. The study team discovered that microbes have some clever tricks up their sleeve for surviving drought. When growing on dead grass as a food source, microbes ramp up production of specialized chemicals called osmolytes that keep their cells from drying out. But microbes growing on dead shrubs face another problem. Unlike grass, shrub leaves are a lousy food source. To digest and consume shrub leaves, microbes have to exude more enzymes, which act like biochemical chef knives that chop complex leaf molecules into bite-sized pieces. Carbon is the coin of the microbial realm, earned via enzyme action or slurping up dead plant juices. Microbes growing under normal conditions on tasty dead grass have it easy: they can spend most of their carbon currency on growth. With drought, life gets harder as microbes need to pay up for osmolytes and ramp down their growth. It gets worse with shrub leaves because microbes have to multi-task among growth, enzyme secretion, and osmolyte production. When drought hits, microbes on shrub leaves forgo the osmolytes, probably because losing the carbon revenue from enzyme investment would be a deal-breaker for survival. The next question tackled by the researchers asked how the genes controlling microbial lifestyles sort out across the tree of life. Most microbiologists thought these lifestyles would correspond to rather large branches on the tree. But the study team found that in fact, very closely related microbes differ in important and interesting ways. For example, bacteria that have nearly identical housekeeping genes respond distinctively to warming, rainfall, and plant chemistry. As a result, soil microbiomes are much richer in diversity than originally thought. And studying microbial diversity in much greater detail could open up many more possibilities for how microbial life deals with changing environmental conditions. Trying to understand microbial life without the fine details of genetic diversity is like trying to stream Netflix on a dial-up connection. By looking across the landscape, the researchers revealed that microbial diversity is absolutely critical for maintaining the planet’s flows of carbon and nutrients. The study team designed a new technology—microbial cages—for transplanting intact microbiomes. With the cages, the researchers could move microbiomes to novel environments and compare their ability to cycle carbon and nutrients. In some cases, performance tailed off when microbiomes found themselves in a new environment, but in other cases, performance rivaled or even exceeded that of the resident microbiome. And even the low performers eventually caught up to the native microbiomes if given sufficient time. These findings mean that microbiomes—at least in Southern California—may be resilient to climate shifts due to a high diversity of microbial lifestyles. Coping with heat and drought may literally be in their DNA. The last piece of the research puzzle, and a “Holy Grail” for microbial ecologists, is to forecast the behavior of diverse microbiomes. To meet this challenge, the study team developed new theory and computer models. For the first time, these models account for hundreds of different microbes and how their intricate lifestyles cope with drought. The models are starting to connect the tiniest microbes with the global cycles that sustain Earth’s farms, fields, and forests. With that connection, it will be easier for society to plan for a world with more droughts and other climate disruptions.

54 ENVIRONMENTAL SCIENCES↗

MoE-Inference-Bench: Performance Evaluation of Mixture of Expert Large Language and Vision Models

Mixture of Experts (MoE) models have enabled the scaling of Large Language Models (LLMs) and Vision Language Models (VLMs) by achieving massive parameter counts while maintaining computational efficiency. However, MoEs introduce several inference-time challenges, including load imbalance across experts and the additional routing computational overhead. To address these challenges and fully harness the benefits of MoE, a systematic evaluation of hardware acceleration techniques is essential. We present MoE-Inference-Bench, a comprehensive study to evaluate MoE performance across diverse scenarios. We analyze the impact of batch size, sequence length, and critical MoE hyperparameters such as FFN dimensions and number of experts on throughput. We evaluate several optimization techniques on Nvidia H100 GPUs, including pruning, Fused MoE operations, speculative decoding, quantization, and various parallelization strategies. Our evaluation includes MoEs from the Mixtral, DeepSeek, OLMoE and Qwen families. The results reveal performance differences across configurations and provide insights for the efficient deployment of MoEs.

Chitty-Venkata, Krishna Teja↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

Fast GPU 3D diffeomorphic image registration

3D image registration is one of the most fundamental and computationally expensive operations in medical image analysis. Here, we present a mixed-precision, Gauss–Newton–Krylov solver for diffeomorphic registration of two images. Our work extends the publicly available CLAIRE library to GPU architectures. Despite the importance of image registration, only a few implementations of large deformation diffeomorphic registration packages support GPUs. Our contributions are new algorithms to significantly reduce the run time of the two main computational kernels in CLAIRE: calculation of derivatives and scattered-data interpolation. Additionally, we deploy (i) highly-optimized, mixed-precision GPU-kernels for the evaluation of scattered-data interpolation, (ii) replace Fast-Fourier-Transform (FFT)-based first-order derivatives with optimized 8th-order finite differences, and (iii) compare with state-of-the-art CPU and GPU implementations. As a highlight, we demonstrate that we can register clinical images in less than 6 s on a single NVIDIA Tesla V100. This amounts to over 20 speed-up over the current version of CLAIRE and over 30 speed-up over existing GPU implementations.

97 MATHEMATICS AND COMPUTING↗

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↗

Scalable In Situ Computation of Lagrangian Representations via Local Flow Maps

In situ computation of Lagrangian flow maps to enable post hoc time-varying vector field analysis has recently become an active area of research. However, the current literature is largely limited to theoretical settings and lacks a solution to address scalability of the technique in distributed memory. To improve scalability, we propose and evaluate the benefits and limitations of a simple, yet novel, performance optimization. Our proposed optimization is a communication-free model resulting in local Lagrangian flow maps, requiring no message passing or synchronization between processes, intrinsically improving scalability, and thereby reducing overall execution time and alleviating the encumbrance placed on simulation codes from communication overheads. To evaluate our approach, we computed Lagrangian flow maps for four time-varying simulation vector fields and investigated how execution time and reconstruction accuracy are impacted by the number of GPUs per compute node, the total number of compute nodes, particles per rank, and storage intervals. Our study consisted of experiments computing Lagrangian flow maps with up to 67M particle trajectories over 500 cycles and used as many as 2048 GPUs across 512 compute nodes. In all, our study contributes an evaluation of a communication-free model as well as a scalability study of computing distributed Lagrangian flow maps at scale using in situ infrastructure on a modern supercomputer.

Sane, Sudhanshu↗

Validation of Thermal Scattering Laws for Light Water at Elevated Temperatures with Diffusion Experiments

Light water is the most important neutron moderator in many reactor applications. Thermal neutron scattering kernels for H bound in H 2 O are represented by ENDF-format thermal scattering laws (TSLs) evaluated at discrete temperatures T . Nuclear data evaluations are conventionally validated utilizing a combination of critical benchmarks and experimental cross section data. Existing public critical benchmarks may be inadequate for testing water TSLs over the full range of T of interest in reactor applications, and experimental thermal scattering cross section data for water is sparse at elevated T . In this work, MC21 is used to simulate the decay of the equilibrium thermal neutron flux in light-water spheres of several radii. The fundamental-mode time eigenvalue $\mathcal{a}$ is calculated at 22 °C and 227 °C (at saturation pressure) for each sphere using three different H-H 2 O TSLs. Fitting $\mathcal{a}$ to a polynomial function of geometric buckling allows calculation of the thermal neutron diffusion length L . Extrapolation lengths are treated as a function of the transport mean free path and geometry. Experimental L data from 25 publications at 49 temperatures (from 10 °C to 295 °C), computed by several different time-dependent and space-dependent decay methods, is used to develop an empirical fit of L vs. T . The MC21-calculated L for the TSLs tested are within ±1% of the predicted values at 22 °C and 227 °C. This validation approach, which may be repeated at arbitrary T , constitutes an integral benchmark specific to and characterizing the detailed physics of the thermal scattering kernel applied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗

Analog Computing for Science

Conventional digital computing faces fundamental physical limits: large scale computing systems already con sume tens of Megawatts of power, Dennard scaling has ended, and data movement costs dominate application performance. Next generation experimental facilities generate data at rates that overwhelm conventional pro cessing and demand real-time analysis at the source. Analog computing, which exploits the continuous dynamics of physical systems to perform computation, promises a transformative path toward orders-of-magnitude gains in energy efficiency and time-to-solution for scientific workloads.

97 MATHEMATICS AND COMPUTING↗

Real-time process monitoring and automated control for direct ink write 3D printing of frontally polymerizing thermosets

Additive manufacturing (AM) enables the fabrication of complex geometries, yet its application to thermosets remains limited by post-processing requirements. Frontal ring-opening metathesis polymerization (FROMP) offers a promising alternative, enabling energy-efficient, in situ curing of freestanding thermoset structures. This study presents a real-time process monitoring and automated control system for direct ink writing (DIW) of FROMP thermosets. By integrating thermochromic leuco dyes and computer vision, we enable real-time polymerization front tracking, allowing autonomous printing parameter adjustments for consistent geometries across resin formulations. The system’s accuracy was validated against manual tracking, demonstrating precise front velocity detection. Its adaptability was confirmed by printing freestanding mechanical springs with different resins, achieving consistent geometries and mechanical properties despite front velocity variations. These findings highlight the potential of automated DIW control for scalable, repeatable, and material-agnostic 3D printing of thermosets.

Mejia, Edgar Brian [Sandia National Laboratories (↗