Search NASA⌕ Search

SEARCH · Search NASA

Results for “Deterministic approach”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Uncertainty quantification of a physics-informed model based on sparse identification of a Thermal Energy Distribution System

Integrated energy systems (IES)s are crucial for enhancing the economy and efficiency of power generation sources (e.g., nuclear energy) necessary to unleash American energy dominance. These systems can be integrated with thermal energy storage (TES) and intermittent renewable energies to optimize overall energy use, peak-load regulation, and demand-side responses. However, the stabilization of energy generation, transport, and utilization introduces operational complexities that exceed the challenges of managing each sub-component individually. Currently, though IESs rely on human operators for efficiency and stability, reducing human error risk and enhancing performance through automation is highly desirable. Recent advances at Idaho National Laboratory have demonstrated successful control of the Thermal Energy Distributed System (TEDS). However, the automatic control system depends on a deterministic Sparse Identification of Nonlinear Dynamics with Control (SINDyC) model, which are trained based on simulation data from physics-based simulations. Because of uncertainties in physics-based simulation, SINDyC model results in large discrepancies against experimental data and cannot be reliably used in automatic control. In this paper, we present an innovative approach to address these discrepancies by quantifying uncertainties and developing a more robust model. We first generated trajectories by using first-principles physics codes to encapsulate the experiment. Next, we trained thousands of models by randomly sampling these trajectories. We then collapsed all those models into one probabilistic SINDyC by fitting a multivariate Gaussian distribution onto the resulting coefficient’s distribution. Despite its simplicity, our approach successfully produced 95% confidence intervals that captured the experimental trajectories. It even did so with a higher probability and better U-pooling score across six of the seven relevant quantities of interest (QoIs), as compared to other classical approaches. In conclusion, ongoing research is focusing on generating new experimental trajectories to validate this approach, and on employing Bayesian calibration to refine parametric uncertainties and guide future model development efforts.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications

Run to run variability in parallel programs caused by floating-point non-associativity has been known to significantly affect reproducibility in iterative algorithms, due to accumulating errors. Non-reproducibility can critically affect the efficiency and effectiveness of correctness testing for stochastic programs. Recently, the sensitivity of deep learning training and inference pipelines to floating-point non-associativity has been found to sometimes be extreme. It can prevent certification for commercial applications, accurate assessment of robustness and sensitivity, and bug detection. New approaches in scientific computing applications have coupled deep learning models with high-performance computing, leading to an aggravation of debugging and testing challenges. Here we perform an investigation of the statistical properties of floating-point non-associativity within modern parallel programming models, and analyze performance and productivity impacts of replacing atomic operations with deterministic alternatives on GPUs. We examine the recently-added deterministic options in PyTorch within the context of GPU deployment for deep learning, uncovering and quantifying the impacts of input parameters triggering run to run variability and reporting on the reliability and completeness of the documentation. Finally, we evaluate the strategy of exploiting automatic determinism that could be provided by deterministic hardware, using the Groq LPUTM accelerator for inference portions of the deep learning pipeline. We demonstrate the benefits that a hardware-based strategy can provide within reproducibility and correctness efforts.

Shanmugavelu, Sanjif↗
DOE OSTI2026

Selecting Critical Scenarios of DER Adoption in Distribution Grids Using Bayesian Optimization

We develop a new methodology to select scenarios of DER adoption most critical for distribution grids. Anticipating risks of future voltage and line flow violations due to additional PV adopters is central for utility investment planning but continues to rely on deterministic or ad hoc scenario selection. We propose a highly efficient search framework based on multi-objective Bayesian Optimization. We treat underlying grid stress metrics as computationally expensive black-box functions, approximated via Gaussian Process surrogates and design an acquisition function based on probability of scenarios being Pareto-critical across a collection of line- and bus-based violation objectives. Our approach provides a statistical guarantee and offers an order of magnitude speed-up relative to a conservative exhaustive search. Case studies on realistic feeders with 200-400 buses demonstrate the effectiveness and accuracy of our approach.

Mulkin, Olivier↗
DOE OSTI2026

Integral Kernel Methods for Nonlinear Parabolic-Elliptic Systems

Nonlinear parabolic-elliptic systems arise in many physical, biological, and chemical phenomena such as chemotaxis, ion transport, self-gravitating particles, and Brownian vortices. Existing methods struggle with the strong coupling and high nonlinearity and nonlocality of some of these systems, especially the ill-conditioned, convection-dominated problems. To overcome numerical difficulties, current approaches rely on initial guesses, preconditioning, or iterative techniques with no convergence guarantees. They might suffer from poor scalability, large memory usage, and difficulty to parallelize. Inspired by the connection of parabolic-elliptic systems to stochastic processes, we introduce a novel meshless, monolithic, and fully explicit method that naturally encapsulates the elliptic and parabolic operators into a single step which updates each node deterministically with global information. By being fully quadrature-based, it avoids solving systems of discretized equations and does not utilize initial guesses or preconditioning, while requiring little memory and being easy to parallelize. We first derive the method in an integral kernel formulation with quadratic complexity in the number of integration nodes and then leverage kernel-independent fast multipole methods (FMM) to present a scalable algorithm with linear complexity. We provide numerical examples for the Poisson-Nernst-Planck equations in one, two, and three dimensions, together with the derivation of the integral kernel for each case. Furthermore, the examples demonstrate the fast convergence and scalability of the FMM-accelerated algorithm, as well as its suitability for convection-dominated problems, making it competitive against traditional PDE solvers.

PDE systems↗
DOE OSTI2026

A Hybrid Molecular–Nanophotonic Platform for On-Chip Cavity Quantum Electrodynamics and Collective Interactions

We present a hybrid solid-state cavity quantum electrodynamics (QED) platform that integrates a high density of coherent organic molecules with high-quality-factor nanophotonics. Thin anthracene crystals doped with dibenzoterrylene (DBT) are mechanically transferred onto prefabricated silicon nitride photonic crystal cavities, preserving both the cavity quality and molecular coherence. This approach decouples emitter synthesis from nanofabrication, providing a pathway for integrating other types of emitters. The high density of molecular emitters results in up to ten molecules being coupled to a single cavity. By tuning pairs of molecules into resonance within a single cavity mode, we observe cavity-mediated interactions in both dispersive and dissipative regimes. Furthermore, these results establish an accessible route to deterministic on-chip single- and multiphoton sources.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2024

Distributed Order Recording Techniques for Efficient Record-and-Replay of Multi-threaded Programs

After all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-level replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating ReOMP into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead.

Fu, Xiang↗
DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2026

Deterministic Fabrication of Large-Area, High-Crystallinity Oxide Moiré Superlattices

Oxide twistronics extends moiré engineering beyond van der Waals materials, offering a promising platform for accessing emergent interfacial phenomena arising from the strong coupling of lattice, charge, and orbital degrees of freedom in complex oxides. However, deterministic fabrication of high-crystallinity oxide moiré superlattices over large lateral dimensions remains challenging due to the three-dimensional bonding network of oxides. Here, we demonstrate a scalable, generalized fabrication strategy that enables the formation of high-crystallinity oxide moiré superlattices with clean, chemically bonded interfaces and precisely controlled twist angles down to nominal values of 0.1°, achieving subdegree twist-angle accuracy across large contiguous lateral dimensions approaching the millimeter scale. Using NaNbO3 as a model system, we show that the resulting interlayer coupling drives pronounced structural reconstruction that modifies both the phase structure and ferroelectric domain configuration. Synchrotron-based X-ray 3D reciprocal space mapping reveals the emergence of a single-phase state in twisted bilayers, in contrast to the mixed-phase structure observed in single-layer membranes prior to twist assembly. The structural signatures are further consistent with gradual lattice rotation distributed along the thickness direction that may accommodate interfacial shear strain, distinct from reconstruction observed in van der Waals moiré systems which primarily occurs through in-plane stacking rearrangement. This collective lattice response is correlated with twist-dependent nanoscale electromechanical modulations observed by piezoresponse force microscopy. These results establish a scalable materials platform for oxide twistronics and support the implementation of twist-engineered functionalities in practical, macroscale device architectures.

Ghanbari, Reza [North Carolina State University (N↗
DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗
DOE OSTI2025

CUDO: closed-form universal dwell-time optimization for computer-controlled optical surfacing

Precision optical figuring demands fast and accurate dwell time optimization to reach nanometer- and sub-nanometer-level accuracy in next-generation optical systems. We introduce CUDO (closed-form universal dwell-time optimization), the first, to the best of our knowledge, unified closed-form analytical framework that supports both function-form and matrix-form dwell time models in computer-controlled optical surfacing (CCOS). In contrast to traditional methods, which rely on iterative optimization and hyperparameter tuning, our framework derives direct analytical solutions with no adjustable parameters. This approach unifies the solution principles of existing methods within a single mathematical model, delivering three key advantages: (1) accuracy on par with, or superior to, iterative solvers, (2) substantial reduction in computation time, and (3) numerical robustness. Comparative studies with prior art confirm that closed-form solutions achieve equivalent residual error while removing runtime bottlenecks. By simplifying the implementation and enabling real-time, scalable deployment, CUDO establishes a practical foundation for future deterministic fabrication of large-aperture and high-performance optics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Mapping Local Dissipation and Entropy Production in Complex and Active Fluids

While global entropy production provides a measure of irreversibility, its partitioning into contributions from local regions is key to understanding the mechanisms underlying time-reversal symmetry breaking in complex systems and active matter. Here, by analyzing local heat flows and fluxes, we propose a framework that enables the mapping of local dissipation and entropy production in a nonequilibrium system. We test this approach in simulations of fluids driven through complex environments and active systems. We connect the results across the local and global scales by showing that local dissipation and entropy production satisfy a local version of the usual (global) fluctuation theorem, which accounts for the correlations between the local region and its surroundings. Interestingly, in the case of the active fluid, our analysis reveals that these correlations are of opposite signs for the active (stochastic) and passive (deterministic) contributions to local dissipation.

Entropy↗
DOE OSTI2026

Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems

Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1/f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.

Albash, Tameem [Sandia National Lab. (SNL-NM), Alb↗
DOE OSTI2024

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

A hybrid Monte Carlo-deterministic second moment method with efficient variance reduction

In this work, we present a hybrid method that combines Monte Carlo with deterministic finite element methods to solve a linear Boltzmann transport equation. Our hybrid method runs orders of magnitude faster than Monte Carlo, without sacrificing accuracy, for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material. We believe that this is the first demonstration of a hybrid Second Moment Method in more than one spatial dimension, the first to consider more than one material, and the first to use variance reduction. Our variance reduction approach arises from an asymptotic analysis in which we show that the magnitude of the scattering source grows without bound. We transform the problem to compute the deviation of the radiation intensity from isotropy. The magnitude of the source in the transformed problem is bounded, and the quality of the hybrid method solution is dramatically improved by a substantial reduction in the variance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Binary Quantum Control Optimization with Uncertain Hamiltonians

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.

conditional value-at-risk (CVaR)↗
DOE OSTI2026

ClassNMSW- a real-time classification approach for non-recycled municipal solid waste using hyperspectral imaging

Real-time classification of non-recycled municipal solid waste (NMSW) is essential for efficient valorization. This study introduces ClassNMSW, a comprehensive framework for classifying 22 NMSW subclasses under industrial constraints by using hyperspectral imaging (HSI). A primary innovation of this work is the development of a variance-controlled spectral extraction algorithm. Unlike traditional methods that rely on simple averaging, this approach systematically investigates the extent of pixel extraction to minimize the loss of critical chemical information while maximizing data reduction thus ensuring high spectral fidelity with low computational cost. The approach developed in this work integrates automated, computer-vision-based background removal, eliminating the need for the manual thresholding common in current literature. To resolve ambiguities among chemically similar subclasses, a tiered classification and multi-camera fusion strategy (NIR17 and NIR22) is implemented. Results demonstrate that ClassNMSW achieves an object-wise weighted accuracy of 98.70% for single-sensor configurations and 100% under sensor fusion. A novel rolling-window strategy satisfies desired end-to-end latency of <2 s, satisfying the strict deterministic requirements of high-speed industrial sorting environments. The ClassNMSW framework provides a scalable foundation for advancing circularity and resource recovery in large-scale waste valorization operations.

99 - GENERAL AND MISCELLANEOUS↗
DOE OSTI2025

Multi-head physics-informed neural networks for learning functional priors and uncertainty quantification

In numerous applications, the integration of prior knowledge and historical information is essential, particularly for tasks requiring the solution of ordinary or partial differential equations (ODEs/PDEs) in data-sparse or noisy environments. For instance, achieving accurate solutions to time-dependent PDEs with limited initial condition measurements necessitates an effective strategy for embedding prior knowledge. Hard-parameter sharing architectures in neural networks (NNs) have demonstrated success in both traditional and scientific machine learning domains, facilitating the learning of informative representations. Here, in this study, we introduce a novel, yet efficient, method to enhance physics-informed neural networks (PINNs) by incorporating a multi-head structure that enables the learning of functional priors from both empirical data and governing physical laws. This prior information can then be used to address data sparsity and high-level noise in solving ODE/PDE problems with uncertainty quantification (UQ). The approach, termed Multi-Head PINN (MH-PINN), consists of a shared body NN and multiple head NNs, each corresponding to an individual PINN instance. Our framework for functional prior learning is carried out in two stages: (1) training the MH-PINNs to develop a shared body NN alongside multiple head NNs, and (2) employing these trained head NNs to estimate a prior distribution through a normalizing flow-based density estimator. The learned functional prior can then be applied as a regularization mechanism in deterministic contexts or as an informative prior within a Bayesian inference framework, aiding in the resolution of subsequent ODE/PDE tasks. We evaluate the efficacy of MH-PINNs across five benchmark problems, including a high-dimensional parametric PDE, all characterized by data sparsity or substantial noise levels. Our findings reveal that MH-PINNs deliver accurate solutions and robust UQ, demonstrating adaptability across a range of complex and challenging scenarios.

Bayesian inference↗
DOE OSTI2025

Direct Observations of Solute Dispersion in Rocks With Distinct Degree of Sub‐Micron Porosity

Abstract The transport of chemical species in rocks is affected by their structural heterogeneity to yield a wide spectrum of local solute concentrations. To quantify such imperfect mixing, advanced methodologies are needed that augment the traditional breakthrough curve analysis by probing solute concentration within the fluids locally. Here, we demonstrate the application of asynchronous, multimodality imaging by X‐ray computed tomography (XCT) and positron emission tomography (PET) to the study of passive tracer experiments in laboratory rock cores. The four‐dimensional concentration maps measured by PET reveal specific signatures of the transport process, which we have quantified using fundamental measures of mixing and spreading. We observe that the extent of solute spreading correlate strongly with the strength of subcore‐scale porosity heterogeneity measured by XCT, while dilution is enhanced in rocks containing substantial sub‐micron porosity. We observe that the analysis of different metrics is necessary, as they can differ in their sensitivity to the strength and forms of heterogeneity. The multimodality imaging approach is uniquely suited to probe the fundamental difference between spreading and mixing in heterogeneous media. We propose that when multi‐dimensional data is available, mixing and spreading can be independently quantified using the same metric. We also demonstrate that one‐dimensional transport models have limited predictive ability toward the internal evolution of the solute concentration, when the model is solely calibrated against the effluent breakthrough curves. The data set generated in this study can be used to build realistic digital rock models and to benchmark transport simulations that account deterministically for rock property heterogeneity.

Kurotori, Takeshi [Department of Chemical Engineer↗