Search NASA⌕ Search

SEARCH · Search NASA

Results for “Error”

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

Electron-Proton Scattering Event Generation using Structured Tokenization

Recent work such as Omnijet-$\alpha$ has demonstrated that effective tokenization combined with transformer-based architectures can produce effective foundation models for jet physics. While tokenization may help models capture generalizable event characteristics, it also introduces discretization errors that may compromise the precision required for downstream physics analyses. As the number and complexity of the particle features grow, these errors are likely to grow proportionally. In this study, we investigate new tokenization strategies to improve the application of generative transformer models to \textsc{Pythia8} simulations of electron-proton scattering at the Electron-Ion Collider. Specifically, we propose a feature-based structured tokenization approach that utilizes multiple tokens per particle, improving expressivity, while reducing the total number of unique tokens needed. We evaluate this method against grid-based binning, K-means clustering, and vector-quantized variational auto-encoders on the event simulations. Our results show that feature-based structured tokenization reduces discretization error, leading to more accurate generative modeling of particle-level events.

Goldenberg, Steven [Thomas Jefferson National Acce↗
DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

On the Speed-up of Wave-like Dark Matter Searches with Entangled Qubits

Qubit-based sensing platforms offer promising new directions for wave-like dark matter searches. Recent proposals demonstrate that entangled qubits can achieve quadratic scaling of the signal in the number of qubits. In this work we expand on these proposals to analyze the bandwidth and scan rate performance of entangled qubit protocols across different error regimes. We find that the phase-based readout of entangled protocols preserves the search bandwidth independent of qubit number, in contrast to power-based detection schemes, thereby achieving a genuine scan-rate advantage. We derive coherence time and error rate requirements for qubit systems to realize this advantage. Applying our analysis to dark photon searches, we find that entangled states of approximately 100 qubits can become competitive with benchmark photon-counting cavity experiments for masses $\gtrsim 30{-}40~μ{\rm eV}$, provided sufficiently low error rates are achieved. The advantage increases at higher masses where cavity volume scaling becomes less favorable.

Bodas, Arushi [Fermilab; Chicago U.] (ORCID:000000↗
DOE OSTI2024

An Approach to Dynamic Human Reliability Analysis and Its Data Collection Framework

Human reliability analysis (HRA) is a method for evaluating human errors in a variety of complex systems such as nuclear power plants, military systems, aircraft, and chemical plants. Most HRA methods currently used by regulatory institutes or utilities are called static HRA and are carried out by simple worksheets or simple calculators. To date, there are many unsolved or intrinsic challenges in static HRA. For example, existing static HRA does not realistically model and evaluate human actions as they would be performed at actual systems. There is no method with HRA to objectively estimate the time required for human actions despite being essential to HRA processes. In addition, many HRA methods still rely on a dataset generated prior to the 1980s, from unrelated industry experience or simply from expert judgment. Accordingly, this study attempted to research how to overcome the challenges of existing HRA via dynamic risk assessment (a.k.a., simulation-based or computation-based risk assessment) techniques. First, this study developed a dynamic HRA method, named as PRocedure-based Investigation Method of EMRALD Risk Assessment – HRA (PRIMERA-HRA). The PRIMERA-HRA mainly concentrates on providing HRA analysts with specific guidelines on how to reasonably model human actions, assign human reliability data and evaluate output of simulation within a dynamic probabilistic risk assessment tool, called as Event Modeling Risk Assessment using Linked Diagrams (EMRALD). Second, this study also developed a module for performance shaping factors (i.e., the key concept in HRA quantification) applicable to dynamic HRA, then implemented it based on PRIMERA-HRA within the EMRALD tool. Third, this study developed an HRA data collection framework to support dynamic HRA, called as Simplified Human Error Experimental Program (SHEEP). Originally, the SHEEP study aimed to support static HRA and its data collection, but recently extended the scope to the new technologies such as dynamic HRA or HRA for advanced reactors. SHEEP focuses on the use of data collected from simplified simulators to complement—but not replace—data collection studies using full-scope simulators and actual operators. To date, many experiments were conducted under the SHEEP framework. Multiple analyses, such as human performance analysis, human error analysis, task complexity analysis, learning effect analysis and time distribution analysis, were also carried out using the collected data. Then, based on the major insights, an approach to inferring full-scope data based on simplified simulator data was proposed. The PRIMERA-HRA and SHEEP research are expected to evaluate human actions more realistically than existing static HRA, provide an opportunity to collect more HRA data with reasonable cost and labor, then contribute to enhance the quality of HRA.

99 - GENERAL AND MISCELLANEOUS↗
DOE OSTI2026

SPT-3G D1: Maps of the millimeter-wave sky from 2019 and 2020 observations of the SPT-3G Main field

Maps of the sky in millimeter wavelengths contain rich information on cosmology through anisotropies of the cosmic microwave background (CMB). Creating multifrequency sky maps of anisotropies in the $I$, $Q$, and $U$ Stokes parameters is one of the first steps of CMB cosmology analyses. In this work, we describe the production and validation of a set of sky maps from the South Pole Telescope's third-generation camera, SPT-3G. The maps are from data taken in frequency bands centered at 95, 150, and 220 GHz and taken during the first two years, 2019 and 2020, of the SPT-3G Main survey, which covers $4\%$ of the sky. We applied high-pass filters to time series of individual detectors and binned the filtered time series samples into map pixels. After that, we calibrated and cleaned the maps to reduce known systematic errors. In addition, we searched for other systematic errors through null tests and mitigated a significant systematic error detected therein. The white noise levels of the full-depth maps of the $I$ Stokes parameter are $5.4$, $4.4$, and $16.2$$\mathrm{μK}$-$\mathrm{arcmin}$ in the 95, 150, and 220 GHz bands, respectively, and $8.4$, $6.6$, and $25.8$$\mathrm{μK}$-$\mathrm{arcmin}$ for $Q/U$. These maps are the deepest to date used for measurements of mid-to-high-$\ell$ primary temperature and $E$-mode polarization CMB anisotropies, and reconstructions of the CMB gravitational lensing potential. We make these maps and supporting data products publicly accessible.

Quan, W. [Argonne (main); Chicago U., EFI; Chicago↗
DOE OSTI2026

Higher-order space-charge stability in anisotropic beams: Vlasov-Poisson derivation, refined dispersion relations, and stability charts

The Hofmann stability chart is used to screen working points in space-charge-dominated linacs. We identify two errors in its published higher-order dispersion relations: missing $(1\mp2\hatη^2/α)$ factors in the third-order $S^4$ coupling residues, and a sign error in the stated isotropic reduction of the fourth-order relation. Both corrections follow from Hofmann's Vlasov-Poisson equations without fitted parameters. They reproduce coherent tune-shift coefficients in the author's later monograph that the printed forms miss by 24% and 127%. Mode-resolved figures from a published application agree with the corrected relations and reject the printed forms, indicating an inconsistency between the 1998 equations and the calculations underlying those tested figures. We quantify the effect on the non-oscillatory stability chart. Inside the adopted $S^2\le10$ comparison domain, printed and corrected forms disagree on 0.73-2.11% of cells, with no preferred direction. Among excluded cells, disagreement reaches 22%, and the printed relation over-predicts instability at every sampled anisotropy. This concentration may help explain why the errors persisted, although it does not establish their historical cause. For PIP-II, the corrected chart flags four of thirty-two evaluable periods, including one on a third-order odd branch missed by a second-order screen. This count covers non-oscillatory modes only and remains conditional on an unresolved factor-five disagreement between two codes on transverse emittance growth.

Pathak, Abhishek [Fermilab] (ORCID:000000021704208↗
DOE OSTI2025

10-th order of accuracy for numerical solution of 3-D elasticity equations for heterogeneous materials on unfitted Cartesian meshes

We have developed the Optimal Local Truncation Error Method (OLTEM) with 10-th order of accuracy on unfitted Cartesian meshes for a system of 3-D elasticity equations with smooth irregular interfaces. 5 x 5 x 5 = 125-point stencils (similar to those for quadratic finite elements) for elastic heterogeneous materials are used for OLTEM. There are no unknowns at the interface points between different materials; the structure of the global discrete equations is the same for homogeneous and heterogeneous materials. The calculation of unknown stencil coefficients is based on the minimization of the local truncation error of the stencil equations and yields the optimal 10-th order of accuracy for OLTEM on unfitted Cartesian meshes, i.e., the increase by 7 orders in accuracy compared to quadratic finite elements on conformal meshes. A new post-processing procedure provides the 9-th order of accuracy for stresses in the 3-D case. Similar to basic computations it uses OLTEM with the 125-point stencils, the interface conditions and the elasticity equations. It was shown that the use of the elasticity equations for post-processing improves the accuracy of 0.1% stresses by 6 orders compared to post-processing without the use of PDEs. At an accuracy of for stresses, OLTEM with the new post-processing procedure reduces the number of degrees of freedom by 360 - 8000 times compared to quadratic finite elements with similar stencils. OLTEM with the 125-point stencils yields even more accurate results than high-order finite elements with much wider stencils. OLTEM provides accurate numerical results for compressible and nearly incompressible materials.

elasticity equations↗
DOE OSTI2026

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗
DOE OSTI2025

More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing

Quantum sensing is one of the most promising applications for quantum technologies. However, reaching the ultimate sensitivities enabled by the laws of quantum mechanics can be a challenging task in realistic scenarios where noise is present. While several strategies have been proposed to deal with the detrimental effects of noise, these come at the cost of an extra shot budget. Given that shots are a precious resource for sensing – as infinite measurements could lead to infinite precision – care must be taken to truly guarantee that any shot not being used for sensing is actually leading to some metrological improvement. In this work, we study whether investing shots in error-mitigation, inference techniques, or combinations thereof, can improve the sensitivity of a noisy quantum sensor on a (shot) budget. We present a detailed bias–variance error analysis for various sensing protocols. Our results show that the costs of zero-noise extrapolation techniques outweigh their benefits. We also find that pre-characterizing a quantum sensor via inference techniques leads to the best performance, under the assumption that the sensor is sufficiently stable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A proposed high-intensity radiometer calibration method using concentrated solar radiation

Accurate calibration of irradiance measurement devices, or radiometers, is essential for ensuring the reliability of measurements in high heat applications such as concentrating solar power (CSP), aerospace, defense, and pulsed power systems. Despite the critical need, existing calibration standards and service providers are limited to irradiance levels below 100 kW/m 2 and specific radiation sources, which is insufficient for many applications. For instance, CSP technologies, particularly those under the Department of Energy’s Solar Energy Technologies Office (SETO) Gen 3 program, require accurate measurements of broadband irradiance at levels exceeding 2000 kW/m 2 . In even more extreme scenarios, such as re-entry vehicles, heat levels can surpass 10000 kW/m 2 . Current ISO standards, specifically ISO 14934–2 and ISO 14934–3, are constrained to lower irradiance levels and dependent on black body heat sources, limiting their applicability for high-intensity broadband irradiance measurements, particularly in concentrated solar applications. Here, to address this shortfall, the National Solar Thermal Test Facility (NSTTF) at Sandia National Laboratories (SNL) proposes a calibration method and facility capable of characterizing radiometers up to 2750 kW/m 2 using concentrated solar irradiance. Calibrating with concentrated sunlight is important for solar applications as it aligns the calibration process with the solar spectrum. This alignment is crucial for minimizing systematic errors and avoiding the need for additional corrections that may arise when radiometers designed for solar applications are calibrated using black-body or electrical sources. This paper presents the present day NSTTF characterization facility and procedure, detailing the proposed calibration method and uncertainty quantification. The presented method builds upon 1980′s NSTTF methodology and involves both theoretical and empirical methods to establish a robust relationship between gauge voltage output and irradiance intensity, quantifying both measurement and fitting errors. By addressing the limitations of existing standards and extending the characterization range, this work provides an advancement in the field of high-intensity irradiance measurement and instrumentation characterization.

Gardon gauge↗
DOE OSTI2025

On infinite tensor networks, complementary recovery and type II factors

We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with complementary recovery, a property that features prominently in the bulk-to-boundary maps intrinsic to holographic quantum error-correcting codes. In this case, we decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network. As a specific example, we describe this inductive limit for the holographic Harlow-Pastawski-Preskill-Yoshida code model and relate its algebraic and error-correction features. We find that the local algebras in this model are given by the hyperfinite type II$_\infty$ factor. Next, we discuss other networks that build upon this framework and comment on a connection between type II factors and stabilizer circuits. We conclude with a discussion of multiscale entanglement renormalization ansatz networks in which complementary recovery is broken. We argue that this breaking possibly permits a limiting type III von Neumann algebra, making them more suitable ansätze for approximating subregions of quantum field theories.

holographic dualities↗
DOE OSTI2025

Digital quantum simulation of cavity quantum electrodynamics: insights from superconducting and trapped ion quantum testbeds

We explore the potential for hybrid development of quantum hardware where currently available quantum computers simulate open cavity quantum electrodynamical (CQED) systems for applications in optical quantum communication, simulation and computing. Our simulations make use of a recent quantum algorithm that maps the dynamics of a singly excited open Tavis–Cummings model containing N atoms coupled to a lossy cavity. We report the results of executing this algorithm on two noisy intermediate-scale quantum computers: a superconducting processor and a trapped ion processor, to simulate the population dynamics of an open CQED system featuring N = 3 atoms. By applying technology-specific transpilation and error mitigation techniques, we minimize the impact of gate errors, noise, and decoherence in each hardware platform, obtaining results which agree closely with the exact solution of the system. These results can be used as a recipe for efficient and platform-specific quantum simulation of cavity–emitter systems on contemporary and future quantum computers.

cavity QED↗
DOE OSTI2025

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗
DOE OSTI2026

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗
DOE OSTI2024

Entropy-Infused Deep Learning Loss Function for Capturing Extreme Values in Wind Power Forecasting

Extreme scenarios in wind power generation occur with higher frequency and larger magnitude in the recent years due to the ever-increasing extreme meteorological factors. Accurate forecasting of the occurrence of extreme values in wind power generation is of great concern to ensure reliable power system operation. Recently, deep learning models have surged in popularity for wind power forecasting, with the mean squared error (MSE) loss function being commonly used. However, the MSE loss function, being sensitive to extreme values, disproportionately penalizes larger errors, cannot adequately capture the extreme values present in wind energy data, and novel loss functions have seldom been tailored for wind power forecasting. To this end, in this paper, we introduce a novel loss function specifically crafted to capture extreme values in wind power forecasting. The experimental results with four fundamental deep learning methods on open source wind power dataset validate that the new loss function is efficient and superior in all cases compared to MSE in capturing extreme values while maintaining forecasting performance.

17 WIND ENERGY↗
DOE OSTI2026

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗
DOE OSTI2024

Correction to: Imaging Light–Induced Migration of Dislocations in Halide Perovskites with 3D Nanoscale Strain Mapping

Owing to an error in properly normalizing the reconstruction phase data into atomic displacements, the strain values that we used to calculate the root mean squared local strain, ε rms , and to calculate the fraction of the crystals more strain than 1%, f, quoted in the original paper, are roughly one order of magnitude too large. This error was only discovered recently whilst performing further analysis.

36 MATERIALS SCIENCE↗