Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generalization 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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
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

Quantum subspace expansion in the presence of hardware noise

Finding ground state energies on current quantum processing units (QPUs) using algorithms such as the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parameterized quantum circuits, limiting them to shallow depths in practice. Here, we demonstrate that both issues can be addressed by synergistically integrating VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs. We perform a systematic benchmark analysis of the iterative quantum-assisted eigensolver in the presence of hardware noise. We determine ground state energies of 1D and 2D mixed-field Ising spin models on noisy simulators and the IBM QPUs ibmq_quito (5 qubits) and ibmq_guadalupe (16 qubits). To maximize accuracy, we propose a suitable criterion to select the subspace basis vectors according to the trace of the noisy overlap matrix. Finally, we show how to systematically approach the exact solution by performing controlled quantum error mitigation based on probabilistic error reduction on the noisy backend fake_guadalupe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Minimization of Measurement Uncertainty in Optical Frequency Domain Reflectometry

Optical frequency domain reflectometry (OFDR) is a technique for interrogating optical fiber sensors to generate relative, quasi-distributed measurements. Although Optical frequency domain reflectometry (OFDR) is increasingly being adopted for aerospace, energy production, and structural monitoring applications, the quantification of uncertainty for OFDR measurements has not been developed beyond sparse empirical relationships. To address this knowledge gap, an uncertainty metric for OFDR measurements was developed. This uncertainty metric was applied to weight the edges between OFDR measurements on directed correlation graphs and analyzed to minimize the cumulative uncertainty. In conclusion, this work is the first to propose an uncertainty metric for OFDR and provides a generalized mathematical framework for optimizing OFDR hardware selection, optical fiber sensor selection, and postprocessing strategy.

42 ENGINEERING↗
DOE OSTI2024

Framework for a Digital Documented Safety Analysis

This framework is developed to progress the digital implementation of digital tools applied to the DOE authorization process, with future applications to NRC SAR development/review, to accelerate the design and review processes of advanced nuclear reactors. The engineering design and licensing process for nuclear reactors is currently burdened by a document-based approach that leads to duplications and errors due to a lack of traceability among numerous static documents. Changes to design information require labor-intensive manual tracing through these documents, creating a high potential for human error. The adoption of a digital ecosystem, utilizing a digital thread to link various aspects of project design and analysis, promises dynamic documentation generation, automatic updates, and error reduction. Model Based Definition (MBD) and Product Lifecycle Management (PLM) tools are central to this digital transformation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

Ferrari Dacrema, Maurizio [Milan Polytechnic] (ORC↗
DOE OSTI2024

Asymptotic-state prediction for fast flavor transformation in neutron star mergers

Neutrino flavor instabilities appear to be omnipresent in dense astrophysical environments, thus presenting a challenge to large-scale simulations of core-collapse supernovae and neutron star mergers (NSMs). Subgrid models offer a path forward, but require an accurate determination of the local outcome of such conversion phenomena. Focusing on “fast” instabilities, related to the existence of a crossing between neutrino and antineutrino angular distributions, we consider a range of analytical mixing schemes, including a new, fully three-dimensional one, and also introduce a new machine learning (ML) model. We compare the accuracy of these models with the results of several thousands of local dynamical calculations of neutrino evolution from the conditions extracted from classical NSM simulations. Our ML model shows good overall performance, but struggles to generalize to conditions from a NSM simulation not used for training. The multidimensional analytic model performs and generalizes even better, while other analytic models (which assume axisymmetric neutrino distributions) do not have reliably high performances, as they notably fail as expected to account for effects resulting from strong anisotropies. As a result, the ML and analytic subgrid models extensively tested here are both promising, with different computational requirements and sources of systematic errors.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures

Quantum Error Correction (QEC) codes are essential for achieving fault-tolerant quantum computing (FTQC). However, their implementation faces significant challenges due to disparity between required dense qubit connectivity and sparse hardware architectures. Current approaches often either underutilize QEC circuit features or focus on manual designs tailored to specific codes and architectures, limiting their capability and generality. In response, we introduce QECC-Synth, an automated compiler for QEC code implementation that addresses these challenges. We leverage the ancilla bridge technique tailored to the requirements of QEC circuits and introduces a systematic classification of its design space flexibilities. We then formalize this problem using the MaxSAT framework to optimize these flexibilities. Evaluation shows that our method significantly outperforms existing methods while demonstrating broader applicability across diverse QEC codes and hardware architectures.

Yin, Keyi [University of California, San Diego]↗
DOE OSTI2026

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗
DOE OSTI2025

Periodic GFN1-xTB Tight Binding: A Generalized Ewald Partitioning Scheme for the Klopman–Ohno Function

A novel formulation is presented for the treatment of electrostatics in the periodic GFN1-xTB tight-binding model. Periodic GFN1-xTB is hindered by the functional form of the second-order electrostatics, which only recovers Coulombic behavior at large interatomic distances and lacks a closed-form solution for its Fourier transform. We address this by introducing a binomial expansion of the Klopman–Ohno function to partition short- and long-range interactions, enabling the use of a generalized Ewald summation for the solution of the electrostatic energy. This approach is general and is applicable to any damped potential of the form |R n + c| –m . Benchmarks on the X23 molecular crystal dataset and a range of prototypical bulk semiconductors demonstrate that this systematic treatment of the electrostatics eliminates unphysical behavior in the equation of state curves. In the bulk systems studied, we observe a mean absolute error in total energy of 35 meV/atom, comparable to the machine-learned universal force field, M3GNet, and sufficiently precise for structure relaxation. These results highlight the promising potential of GFN1-xTB as a universal tight-binding parametrization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

The ballad of LLM agents: philosophical reasoning for chemistry

Large language models (LLMs) show remarkable potential for scientific reasoning but often produce unreliable or scientifically unactionable outputs when faced with multi-step logic, domain grounding, and interpretability challenges, especially in complex fields like chemistry and materials science. Here, we introduce a framework of philosophical reasoning agents, inspired by canonical thinkers such as Socrates, Descartes, Kant, and Hume, to guide LLM behavior via structured prompt engineering. These agents embody distinct reasoning paradigms (dialectical inquiry, deductive logic, rule-based judgment, and empirical validation) and are evaluated across multiple chemistry subdomains, physical, analytical, general, inorganic, and organic chemistry, using the ChemBench benchmark. Our agentic prompting approach yields substantial accuracy gains on open-ended numerical chemistry questions, with gains of +11.5 percentage points for GPT-4o with Hume, +4.5 percentage points for GPT-5 with Kant, and +21.8 percentage points for GPT-5.1 with Socrates at the strict 1% error threshold, relative to the corresponding base models. Beyond accuracy, we observe benchmark-level model–agent performance patterns, suggesting that different prompting styles interact differently with each base model. These findings demonstrate that embedding philosophy-of-science principles into multi-agent frameworks can improve and produce interpretable, adaptive, and domain-aligned scientific LLMs.

Harb, Hassan [Argonne National Laboratory (ANL), A↗
DOE OSTI2024

Tunable noninteracting free-energy density functionals for high-energy-density physics applications

In this work, we introduce the concept of a tunable noninteracting free-energy density functional and present two examples realized: (i) via a simple one-parameter convex combination of two existing functionals and (ii) via the construction of a generalized gradient approximation (GGA) enhancement factor that contains one free parameter and is designed to satisfy a set of incorporated constraints. Functional (i), constructed as a combination of the local Thomas–Fermi and a pseudopotential-adapted GGA for the noninteracting free-energy, has already demonstrated its practical usability for establishing the high temperature end of the equation of state of deuterium [Phys. Rev. B 104, 144104 (2021)] and CHON resin [Phys. Rev. E 106, 045207 (2022)] for inertial confinement fusion applications. Hugoniot calculations for liquid deuterium are given as another example of how the application of computationally efficient orbital-free density functional theory (OF-DFT) can be utilized with the employment of the developed functionals. Once the functionals have been tuned such that the OF-DFT Hugoniot calculation matches the Kohn–Sham solution at some low-temperature point, agreement with the reference Kohn–Sham results for the rest of the high temperature Hugoniot path is very good with relative errors for compression and pressure on the order of 2% or less.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Extending the computational reach of a superconducting qutrit processor

Quantum computing with qudits is an emerging approach that exploits a larger, more connected computational space, providing advantages for many applications, including quantum simulation and quantum error correction. Nonetheless, qudits are typically afflicted by more complex errors and suffer greater noise sensitivity which renders their scaling difficult. In this work, we introduce techniques to tailor arbitrary qudit Markovian noise to stochastic Weyl–Heisenberg channels and mitigate noise that commutes with our Clifford and universal two-qudit gate in generic qudit circuits. We experimentally demonstrate these methods on a superconducting transmon qutrit processor, and benchmark their effectiveness for multipartite qutrit entanglement and random circuit sampling, obtaining up to 3× improvement in our results. To the best of our knowledge, this constitutes the first-ever error mitigation experiment performed on qutrits. Our work shows that despite the intrinsic complexity of manipulating higher-dimensional quantum systems, noise tailoring and error mitigation can significantly extend the computational reach of today’s qudit processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Delocalization error poisons the density-functional many-body expansion

The many-body expansion is a fragment-based approach to large-scale quantum chemistry that partitions a single monolithic calculation into manageable subsystems. This technique is increasingly being used as a basis for fitting classical force fields to electronic structure data, especially for water and aqueous ions, and for machine learning. Here, we show that the many-body expansion based on semilocal density functional theory affords wild oscillations and runaway error accumulation for ion–water interactions, typified by F − (H 2 O) N with N ≳ 15. We attribute these oscillations to self-interaction error in the density-functional approximation. The effect is minor or negligible in small water clusters, explaining why it has not been noticed previously, but grows to catastrophic proportion in clusters that are only moderately larger. This behavior can be counteracted with hybrid functionals but only if the fraction of exact exchange is ≳50%, whereas modern meta-generalized gradient approximations including ωB97X-V, SCAN, and SCAN0 are insufficient to eliminate divergent behavior. Other mitigation strategies including counterpoise correction, density correction (i.e., exchange–correlation functionals evaluated atop Hartree–Fock densities), and dielectric continuum boundary conditions do little to curtail the problematic oscillations. In contrast, energy-based screening to cull unimportant subsystems can successfully forestall divergent behavior. These results suggest that extreme caution is warranted when the many-body expansion is combined with density functional theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Scientific Data Compression for Large Scale Computational Fluid Dynamics (CFD) Simulations

This Cooperative Research and Development Agreement (CRADA) between Oak Ridge National Laboratory (ORNL) and General Electric (GE) investigated methods for reducing the size of large computational fluid dynamics (CFD) simulation datasets using scientific data compression techniques. The work focused on adapting the MultiGrid Adaptive Reduction of Data (MGARD) compression framework and integrating it with high-performance I/O and visualization tools used in CFD workflows. MGARD uses hierarchical multilevel decomposition to enable error-controlled compression of floating-point scientific data while preserving quantities of interest. During the project, MGARD compression was integrated with the ADIOS I/O framework and visualization tools such as ParaView to enable efficient storage, transfer, and analysis of simulation data. The collaboration also explored approaches for improving compression performance for CFD data defined on unstructured meshes. Results demonstrate that scientific data compression can significantly reduce storage requirements and improve data management for large-scale CFD simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗
DOE OSTI2024

Data-Driven Digital Twin for Reliability Assessment of DC/DC Buck Converter

In commercial applications, the operation of DC/DC converters significantly impacts overall system performance and long-term reliability. This study introduces a data-driven digital twin (DT) approach for estimating critical degradation parameters of DC/DC BUCK converter under steady-state condition. Initially, a circuit-level MATLAB/Simulink digital model (DM C ) is refined against a hardware prototype’s switching model dataset using offline particle swarm optimization. The optimized digital model’s steady-state response is then verified with its average model response while varying the duty and load. Subsequently, degradation profiles are imposed on the inductor, capacitor, MOSFET in the DMC. A large dataset is generated from this model, allowing training, validation, and testing of machine learning (ML) models for component health regression tasks. The proposed method employs random forest ML models, achieving impressive regression results with a squared R value as high as 0.99978 and a root mean square error of 4.2× 10 –6 . The method is further validated on a medium power level DC/DC BUCK prototype with varying load conditions, and includes the analysis of MOSFET’s on-resistance under degradation conditions. This data-driven DT method shows promise for identifying parasitic degradation and ohmic loss parameters, enhancing converter reliability assessments in a non-invasive, generalized, and computationally efficient manner.

14 SOLAR ENERGY↗
DOE OSTI2026

Generalized Theory and Realization of Reconfigurable Bandpass Filtering Equalizers

Here, in this article, a generalized theory of bandpass filtering equalizers is proposed. A filtering equalizer is a device that combines the frequency-selective properties of a filter with the controllable slope of an equalizer into a single component. The equations used to design the function for a desired slope are provided, and the design methodology to determine the necessary filtering polynomials is also shown. The controllable slope of the dual-function component is realized using variable capacitors, which are used to tune both a transmission zero and a matching network to achieve the desired slope. A third-order bandpass filtering equalizer is designed, fabricated, and measured to verify the generalized theory. The component is designed to operate at 1 GHz with a slope that can be reconfigured from 1 to 3 dB along the passband. This proposed filtering equalizer demonstrates the feasibility of a tunable, low-cost, size, weight, and power (C-SWaP) solution to enable increased flatness in the overall system response and thereby decrease the error vector magnitude (EVM) of future radio frequency (RF) systems and a design process that allows for future development of filtering equalizers.

Filter↗