SEARCH · Search NASA

Results for “deterministic”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

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

Leveraging Inequality-Constrained Data for Enhanced Liquidus Temperature Prediction in Nuclear Waste Glass Melts

Inequality-constrained data are frequently discarded in engineering, leading to significant information loss in data-scarce domains like glass characterization in nuclear waste vitrification. This paper presents a nonparametric censored-data regression framework based on an l1-norm optimization criterion that leverages slack variables to integrate left-, right-, and interval-constrained observations into training without distributional assumptions. Validated on synthetic data and a Physics-Informed Neural Network (PINN) for predicting liquidus temperature (TL), the method improved R2 from 0.60 to 0.89 and reduced Mean Absolute Error (MAE) by 48% (51.46 to 26.89?rC) on deterministic values. The traditional models failed to satisfy any inequality constraints while the proposed l1-norm PINN satisfies 81.25% of the constraints. The proposed framework effectively extracts actionable information from previously unusable data to enhance predictive accuracy, reduce epistemic uncertainty, and ensure physical consistency in complex industrial applications.

Garcia-Morado, Erick↗

DOE OSTI2026

Boron Coordination in Multicomponent Glasses: Analytical Models and Machine Learning With Uncertainty

Borosilicate glasses are extensively used in a variety of applications from kitchenware to nuclear waste immobilization due to the strong network formed by the Si-O-B bond that makes it resistant to chemical corrosion and gives it a low thermal expansion. Boron, however, exists in both trigonal BO3 and tetrahedral BO4 bonds in glass systems, which impacts the chemical durability and thermal resistance of the glass, amongst other properties. Boron coordination (N4), or the ratio of the amount of BO4 to BO3 within a glass, may aid in predicting these properties but is difficult to derive without experimental data due to the complexity of impacts from varied glass compositions and processing factors. For this reason, compositional models have been developed to predict boron coordination, but the models typically include a limited number of glass components. To help fill this gap in the models, in this work, a diverse multicomponent glass dataset of 809 glasses is compiled from a literature search, and then a number of analytical and machine learning (ML) models are trained on the dataset. Previously developed modified Bernstein and modified Du Stebbins analytical models were fitted to update parameters with the new dataset. Then, partially Bayesian neural networks, Gaussian process regressor, and heteroskedastic deterministic neural networks were evaluated. The ML models examined all have different strategies to overcome the potential for overfitting as a result of a limited training dataset, and return results that account for model uncertainty, which can be valuable for understanding model reliability. For the first time, cooling rate is introduced as an input parameter for ML models, showing consistent improvements in performance and solidifying the importance of including parameters outside of composition alone for N4 prediction. The machine learning models examined here show promise in accurate predictions of boron coordination in borosilicate glasses, all achieving R2 values of 0.91.

boron coordination↗

DOE OSTI2025

Advancements in Constitutive Model Calibration: Leveraging the Power of Full‐Field DIC Measurements and In Situ Load Path Selection for Reliable Parameter Inference

Accurate material characterization and model calibration are essential for computationally supported high-consequence engineering decisions. Historically, characterization and calibration methods (1) use simplified test specimen geometries and global data, (2) cannot guarantee that sufficient characterization data are collected for a specific model of interest, (3) use deterministic methods that provide best-fit parameter values with no uncertainty quantification, and (4) are sequential, inflexible, and time-consuming. This work brings together several recent advancements into an improved workflow called interlaced characterization and calibration (ICC) that advances the state-of-the-art in constitutive model calibration. The ICC paradigm (1) employs tools to efficiently use full-field data to calibrate high-fidelity material models, (2) aligns the data needed with the data collected by adopting an optimal experimental design protocol, (3) quantifies parameter uncertainty through Bayesian inference and (4) incorporates these advancements into a quasi real-time feedback loop. The ICC framework is demonstrated here on the calibration of a material model using simulated full-field data for an aluminium cruciform specimen being deformed biaxially. The cruciform is actively driven through the myopically preferred load path using Bayesian optimal experimental design, which selects load steps that yield the maximum expected information gain (EIG). Principal component analysis (PCA) is performed on the model predictions of full-field displacements, and fast surrogate models are built to approximate the input-output relationships of the expensive finite element model. Furthermore, the tools developed and demonstrated here show that high-fidelity constitutive models can be efficiently and reliably calibrated with quantified uncertainty, thus supporting credible decision-making and potentially increasing the agility of solid mechanics modelling by enabling utilization of computational simulations at earlier stages of the design cycle.

Bayesian optimal experimental design↗

DOE OSTI2025

Rapid Commissioning of Large Machine Tools Using Finite Element-Based Correction of Geometric Errors

Large computer numerical control (CNC) machine tools derive their stiffness from monolithic cast iron bases or weldments that are sometimes integral to machine motion systems like box ways or guideways. However, the sheer size of castings and even floor flatness deviations result in dimensional errors in these systems, which manifest as machine motion errors. Typical geometric alignment processes rely on an iterative approach, where measurements are taken to assess alignment (straightness, squareness, and parallelism), followed by adjustment of the machine supports (fixators or leveling pads), which can take weeks even for an experienced operator. Conversely, a novel method is proposed to shorten the correction time by eliminating the trial-and-error process in favor of a more deterministic approach guided by a finite element (FE) method. A feasibility study is conducted on a CNC polymer hybrid machine, with a steel weldment frame, supported by six leveling pads. An FE model of the frame is utilized to obtain recommended leveling pad adjustments, based on measurement of machine errors taken using a laser tracker. After a single adjustment cycle, measurements reveal that geometric errors of the machine tool are reduced from 2.22 mm of flatness deviation to 0.32 mm, achieving an 85.6% reduction. Furthermore, the entire process including measurement, adjustment, and assessment is completed in just 6 h by two operators who are not professional service engineers. In conclusion, this methodology demonstrates feasibility for scaling up, especially to large, high-precision CNC machine tools with bases mounted by fixators, offering the capability for bidirectional adjustment.

42 ENGINEERING↗

DOE OSTI2024

Polarization–frequency hyperentangled photons: generation, characterization, and manipulation

Frequency-bin encoding is massively parallelizable and robust for optical fiber transmission. When coupled with an additional degree of freedom (DoF), the expansion of the Hilbert space allows for deterministic controlled operations between two DoFs within a single photon. Such capabilities, when combined with photonic hyperentanglement, are of great value for quantum communication protocols, including dense coding and single-copy entanglement distillation. In this talk, we present an all-fiber-coupled, ultrabroadband polarization–frequency hyperentangled source and conduct comprehensive quantum state tomography across multiple dense wavelength division multiplexing channels spanning the optical C+L-band (1530–1625 nm). In addition, we design and implement a high-fidelity controlled-NOT (cnot) operation between polarization and frequency DoFs by exploiting electro-optic phase modulation within a fiber Sagnac loop. Collectively, our hyperentangled source and two-qubit gate should unlock new opportunities for harnessing polarization–frequency resources in established telecommunication fiber networks for future quantum applications.

Lu, Hsuan-Hao↗

DOE OSTI2024

Binary pseudo-random array standards for calibration of 3D optical surface profilers used for metrology with significantly curved x-ray optics

High-accuracy metrology is vitally important in manufacturing ultra-high-quality free-form mirrors designed to manipulate X-ray light with nanometer-scale wavelengths. The current capabilities and possibility for improvements in X-ray mirror manufacturing are limited by inherent imperfections of the integrated metrology tools. In the case of Fizeau interferometry, metrology tools are currently calibrated with super-polished flat test-standard/reference mirrors. This is acceptable for measuring slightly curved X-ray optics. However, for even moderately curved aspherical X-ray mirrors the flat-reference calibration is not sufficiently accurate and stitching Fizeau interferometer-based surface metrology is used to mitigate the problem. But still, the retrace and aberration errors, as well as the limited spatial resolution, described with the instrument transfer function (ITF), can be transferred into the optical surface topography of X-ray mirrors obtained in stitching metrology. For ITF calibration, we have developed an original technique, based on test standards structured as two-dimensional (2D) highly-randomized (HR) binary pseudo-random arrays (BPRAs). The technique employs the unique properties of the HR BPRA patterns in the spatial frequency domain., i.e. the inherent 2D power spectral density of the HR BPRA pattern has a deterministic white-noise-like character that allows direct determination of the ITF with uniform sensitivity over the entire spatial frequency range and field-of-view of an instrument. Here, we explore technological, metrological, and analytical aspects essential for calibration of the retrace and aberration errors of Fizeau interferometers using different types of tilted test samples, including a super-polished reference mirror for the re-trace calibration and the uniformly redundant array (URA) BPRA standards for the geometrical distortion (aberration) calibration. While the first method was previously demonstrated by researchers at DIAMOND Light Source, a method based on the URA BPRA is described and demonstrated here for the first time. We outline the design and fabrication process used in fabrication of URA BPRA test standards, and present the results of application of the URA BPRA standards demonstrating the high efficacy of our approach to geometrical distortion calibration of Fizeau interferometers. We also discuss the possible sources of unexpected peculiarities of the systematic errors, including an astigmatic character of the retrace error, observed with Fizeau interferometers at the Advanced Light Source X-Ray Optics Laboratory.

Munechika, Keiko↗

DOE OSTI2026

BRCore: an R package implementing flexible selection of core taxa using contribution to Bray-Curtis dissimilarity and neutral model fitting

Identifying core taxa in microbial ecology highlights groups likely to participate in a broad range of potential ecological interactions. Here, we present BRCore, an R package to identify core taxa using abundance-occupancy distributions and beta-diversity contributions across ecological niches, and predict stochastic and deterministic taxa.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Data-Driven Closures and Assimilation for Stiff Multiscale Random Dynamics

Here, we introduce a data-driven and physics-informed framework for propagating uncertainty in stiff, multiscale random ordinary differential equations (RODEs) driven by correlated (colored) noise. Unlike systems subjected to Gaussian white noise, a deterministic equation for the joint probability density function (PDF) of RODE state variables does not exist in closed form. Moreover, such an equation would require as many phase-space variables as there are states in the RODE system. To alleviate this curse of dimensionality, we instead derive exact, albeit unclosed, reduced-order PDF (RoPDF) equations for low-dimensional observables/quantities of interest. The unclosed terms take the form of state-dependent conditional expectations, which are directly estimated from data at sparse observation times. However, for systems exhibiting stiff, multiscale dynamics, data sparsity introduces regression discrepancies that compound during RoPDF evolution. This is overcome by introducing a kinetic-like defect term to the RoPDF equation, which is learned by assimilating in sparse, low-fidelity RoPDF estimates. Two assimilation methods are considered, namely nudging and deep neural networks, which are successfully tested against Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

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 OSTI2024

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

EVI-EnSitePy (Electric Vehicle Infrastructure – Energy Estimation and Site Optimization Tool in Python) [EVI-X Modeling Suite] [SWR-25-07]

EVI-EnSitePy is a comprehensive agent-based tool designed for the analysis and design of high-power charging sites, encompassing a wide array of site agents including Electric Vehicles (EVs), chargers, energy storage units (ESS), renewable energy resources (DER), and loads. This versatile tool offers diverse functionalities and a modular modeling approach, allowing detailed configuration of agents based on power ratings, port numbers, energy capacities, demand requirements, charger interfaces, and flexibility to customize the tool for project specific goals. By simulating agent interactions and employing various metrics, EVI-EnSitePy enables the assessment of site performance, exploration of energy management systems (EMS), and implementation of innovative EV charging policies. Utilizing EV charge schedules and arrival states, the tool performs thorough charging site simulations, with outputs consisting of agent and site-level power profiles and statistical metrics. Employing a tree graph structure, EVI-EnSitePy supports nested site structures and power distribution modeling. The tool's ability to generate charging schedules deterministically or via stochastic analysis further enhances its versatility. Through its features and capabilities, EVI-EnSitePy offers a powerful platform for informed decision-making in the realm of high-power charging site design and operation.

Jackson, Derek [National Renewable Energy Laborato↗

DOE OSTI2025

RFSoC based digital low level RF control firmware and software suite (mimo_llrf) v1.0

It features a framework of a firmware and software architecture in support of building a digital low-level RF control system for accelerators, where precised digital RF generation and measurement are needed across many RF channels. It primarily supports the Xilinx RFSoC chips (xczu48dr, xczu47dr, xczu29dr) and their evaluation boards (zcu208, zcu216), for a highly integrated solution enabling the need for synchronous low-level RF systems, including: multi-tile synchronization, external reference for sampling clocks, deterministic delay, aligned NCO phase for digital mixers, and built-in EPICS IOC.

Du, Qiang [Lawrence Berkeley National Laboratory (↗

DOE OSTI2025

fortfmt-fix

SF-25-126 **fortfmt‑fix** is a small, deterministic codemod that rewrites these descriptors to explicit, standard‑conforming forms (e.g., `I12`, `F25.16`), enabling clean builds on modern compilers without vendor‑specific options. The tool is designed to be idempotent and conservative, preserving semantics while reducing maintenance burden in research codebases.

Bross, David [Argonne National Laboratory (ANL), A↗

DOE OSTI2026

Consist v0.1.0

A Python library for provenance tracking, intelligent caching, and data virtualization in scientific simulation workflows. It automatically records code, configuration, and input data to skip redundant computations and enables querying results across many runs without manual bookkeeping. Designed to support multi-model simulation workflows like the BEAM CORE toolset at LBL, but designed to be extensible to a wide range of research workflows. Combines lineage tracking features as provided by OpenLineage with deterministic hashing like SnakeMake, and adds powerful analysis tools on model outputs.

Needell, Zachary [Lawrence Berkeley National Labor↗

DOE OSTI2026

allium

High-performance library for deterministic thermal radiative transfer

Olivier, Sam↗