Search NASA⌕ Search

SEARCH · Search NASA

Results for “interpolating methods”

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 73 records · Page 4

Beyond interpolation: Physics-inspired gating transformers for extrapolating irradiation conditions to novel nuclear fuels

The qualification of advanced nuclear fuels relies on irradiation experiments in test reactors that emulate commercial conditions. Designing these tests requires accurate prediction of key irradiation quantities, particularly heat generation rate and burnup, yet obtaining them typically involves computationally expensive multi-step simulation workflows. We propose a physics-inspired gating transformer (PIGT) that integrates an inverse-square, distance-based attenuation into the encoder representation to bias attention toward physically relevant spatial relationships while retaining data-driven flexibility. Using MiniFuel irradiation data from the High Flux Isotope Reactor at Oak Ridge National Laboratory, we benchmark against ensemble methods, feedforward and recurrent networks, convolutional models, and standard transformers. While baseline models perform well under interpolation, they exhibit a pronounced generalization gap when evaluated on fuels not included in the training set. The proposed model consistently improves extrapolative accuracy and stability, yielding the strongest performance on unseen fuel configurations. These results indicate that a lightweight physics structure embedded within attention mechanisms can substantially improve robustness, enabling more reliable surrogate predictions to accelerate the design of nuclear fuel irradiation experiments.

Fuel qualification↗

Deep learning‑based metal artefact reduction in X-ray computed tomography of TRISO fuel compacts

TRISO (TRi-structural ISOtropic) – compact-type micro-particle fuels – are next generation nuclear fuel compacts designed with safety in mind. Structural integrity and characterisation before and after irradiation are important to determine the performance of the fuel compacts under real reactor conditions. X-ray computed tomography can be an important tool for non-destructive evaluation of these fuel compacts. The fuel particles are highly attenuating for X-rays which creates metal artefact, rendering the images unusable. Our artefact correction can mitigate these artefacts significantly. The proposed method works by first segmenting highly-attenuating structures (metal) and forward projecting to localise the source of artefacts in the projection domain, then, using a traditional or U-net-based deep learning architecture, contextually interpolating those regions to remove the artefacts. Finally the reconstruction from the modified projection is fused with the segmented metal. The proposed method shows a significant improvement in the image quality while significantly reducing the reconstruction time compared to the standard technique.

Rahman, Obaid [ORNL] (ORCID:0000000277810840)↗

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗

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↗

DK/Dπ scattering and an exotic virtual bound state at the SU(3) flavour symmetric point from lattice QCD

Abstract ElasticS-wave scattering of a charm meson with a light pseudoscalar meson inJ P = 0 + is investigated in the flavour$$ \overline{\textbf{3}} $$ 3 ¯ ,6and$$ \overline{\textbf{15}} $$ 15 ¯ sectors at the SU(3) f flavour point using lattice QCD, working on three volumes withm π ≈ 700 MeV. Large bases of interpolating operators are employed to extract finite-volume spectra, which are subsequently used with the Lüscher method to provide constraints on infinite-volume scattering amplitudes. Examining the singularities of the amplitudes, theS-wave amplitude in the flavour$$ \overline{\textbf{3}} $$ 3 ¯ sector is found to contain a deeply bound state, strongly coupled to elastic threshold, corresponding to the$$ {J}^P={0}^{+}\ {D}_{s0}^{\ast }(2317) $$ J P = 0 + D s 0 ∗ 2317 . In the exotic flavour6sector a virtual bound state is found at$$ \sqrt{s_{\textrm{pole}}} $$ s pole = 2510 – 2610 MeV, roughly 40 – 140 MeV below threshold, whereas the$$ \overline{\textbf{15}} $$ 15 ¯ channel shows weak repulsion.

Physics↗

Data-driven high-dimensional statistical inference with generative models

Crucial to many measurements at the LHC is the use of correlated multi-dimensional information to distinguish rare processes from large backgrounds, which is complicated by the poor modeling of many of the crucial backgrounds in Monte Carlo simulations. In this work, we introduce HI-SIGMA, a method to perform unbinned high-dimensional statistical inference with data-driven background distributions. In contradistinction to many applications of Simulation Based Inference in High Energy Physics, HI-SIGMA relies on generative ML models, rather than classifiers, to learn the signal and background distributions in the high-dimensional space. These ML models allow for interpretable inference while also incorporating model errors and other sources of systematic uncertainties. We showcase this methodology on a simplified version of a di-Higgs measurement in the bbγγ final state, where the di-photon resonance allows for background interpolation from sidebands into the signal region. We demonstrate that HI-SIGMA provides improved sensitivity as compared to standard classifier-based methods, and that systematic uncertainties can be straightforwardly incorporated by extending methods which have been used for histogram based analyses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient continuous Energy-Multigroup hybrid depletion scheme using the Shift Monte Carlo code. Part I: Energy condensation sensitivity analysis

Monte Carlo (MC) codes coupled to depletion solvers are increasingly used to provide high fidelity fuel cycle modeling capabilities. Here, these coupled depletion-MC tools produce accurate results in general but can experience nonphysical spatial oscillations when time steps are large or when a system’s dominance ratio approaches unity. Two substepping techniques have been developed previously to remedy and dampen these spatial oscillations without needing to reduce step sizes. The first approach relied on higher-order techniques to account for spectral changes within steps (extrapolation and interpolation techniques). The second approach used the first order perturbation (FOP) theory to account for the change in the one-group spatial flux distribution within steps. This paper develops a hybrid depletion methodology which, in a way, combines how the flux is handled in both substepping techniques. Specifically, the multigroup (MG) MC Shift code is used to update the flux distribution within steps rather than a one-group FOP solver. A fully reflected pincell is investigated, which is not spatially dependent in the MG representation. Thus, the analysis in this paper is an initial demonstration of hybrid depletion. An upcoming companion paper will focus on how the hybrid depletion dampens spatial oscillations. The hybrid depletion approach is verified to be consistent with previous constant extrapolation depletion (CED) methods. This paper finds that the hybrid CED exhibits some error in the eigenvalue and one group constants within macro steps. To address this discrepancy, a simple interpolation scheme (CELI) is investigated. This work found that CELI sufficiently addresses the discrepancy in spectrum for macro steps up to 100 days. Overall, this work demonstrates that the hybrid depletion method can significantly reduce the number of high fidelity MC executions in a MC-coupled depletion with an acceptable eigenvalue error.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Bayesian inference of anisotropic 2D small-angle scattering from sparse measurement

Here, we present a Bayesian inference framework for reconstructing anisotropic two-dimensional small-angle scattering (2D SAS) patterns from sparse, noisy, or partially missing data. The method combines a symmetry-aware angular basis with radial Gaussian process priors to enable accurate, training-free interpolation and denoising. Computational benchmarks demonstrate reliable recovery of both isotropic and high-order anisotropic features under severe data reduction. Experimental validations on stretched polymers, sheared wormlike micelles, and carbon fibers show improved fidelity and resolution compared to raw measurements, achieving comparable accuracy with up to 50-fold fewer detected neutrons. This approach enables quantitative structural analysis under low-flux, time-limited, or single-shot conditions, extending the applicability of 2D SAS techniques to compact neutron sources and mechanically driven soft matter systems undergoing transient structural changes.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN↗

WINDPROF: Merged Best-Estimate Wind Profile Data – Site A1 (AWAKEN Campaign)

WINDPROF provides 10-minute wind and turbulence profiles, integrating Doppler lidars and anemometers during the AWAKEN campaign. Key data include wind speed, direction, vertical velocity, and turbulence parameters, with standardized quality control (e.g., instrument-specific thresholds and inter-instrument validation). Profiles are interpolated to a height grid (20 m spacing below 100 m; 30 m above) and include uncertainty estimates, offering reproducible methods for atmospheric research, model validation, and wind energy studies.

17 WIND ENERGY↗

WINDPROF: Merged Best-Estimate Wind Profile Data – Site A2 (AWAKEN Campaign)

WINDPROF provides 10-minute wind and turbulence profiles, integrating Doppler lidars and anemometers during the AWAKEN campaign. Key data include wind speed, direction, vertical velocity, and turbulence parameters, with standardized quality control (e.g., instrument-specific thresholds and inter-instrument validation). Profiles are interpolated to a height grid (20 m spacing below 100 m; 30 m above) and include uncertainty estimates, offering reproducible methods for atmospheric research, model validation, and wind energy studies.

17 WIND ENERGY↗

WINDPROF: Merged Best-Estimate Wind Profile Data – Site H (AWAKEN Campaign)

WINDPROF provides 10-minute wind and turbulence profiles, integrating Doppler lidars and anemometers during the AWAKEN campaign. Key data include wind speed, direction, vertical velocity, and turbulence parameters, with standardized quality control (e.g., instrument-specific thresholds and inter-instrument validation). Profiles are interpolated to a height grid (20 m spacing below 100 m; 30 m above) and include uncertainty estimates, offering reproducible methods for atmospheric research, model validation, and wind energy studies.

17 WIND ENERGY↗

Improving the precision of forces in real-space pseudopotential density functional theory

The high-order finite difference real-space pseudopotential density functional theory (DFT) approach is a valuable method for large-scale, massively parallel DFT calculations. A significant challenge in the approach is the oscillating “egg-box” error introduced by aliasing associated with a coarse grid spacing. To address this issue while minimizing computational cost, we developed a finite difference interpolation (FDI) scheme [Roller et al., J. Chem. Theory Comput. 19, 3889 (2023)] as a means of exploiting the high resolution of the pseudopotential to reduce egg-box effects systematically. Here, we show an implementation of this method in the PARSEC code and examine the practical utility of the combination of FDI with additional methods for improving force precision and/or reducing its computational cost, including orbital-based forces, compensating charges (namely, adding and subtracting a judiciously chosen charge density such that the total density is unaltered), and a modified spatial domain in which the real-space grid is defined. Using selected small molecules, as well as metallic Li, as test cases, we show that a combination of all four aspects leads to a significant reduction in computational cost while retaining a high level of precision that supports accurate structures and vibrational spectra, as well as stable and accurate molecular dynamics runs.

Chemistry↗

Single Grid Error Estimation for Neutron Transport Solvers

The method of nearby problems (MNP) is a solution verification technique that does not require the use of multiple spatial grids. To estimate spatial discretization error without requiring a high-fidelity spatial grid, an analytical curve fit is interpolated from the numerical solution. The residual between the curve fit solution and numerical solution is calculated and added as an additional source term to the governing equation. The nearby solution is estimated using the updated source term and boundary conditions to remain consistent with the curve fit interpolation. The nearby solution can be compared to the curve fit solution as a discretization error estimation while using a single spatial grid. Without the use of higher fidelity spatial grids, the MNP is able to approximate the spatial discretization error, a facet of solution verification. The application of the method of nearby problems is presented for one- and two-dimensional neutron transport problems for both fixed source and criticality problems on the spatial variable. The fixed source results demonstrate the effectiveness of nearby problems for spatial error identification using the discrete ordinates method. Criticality results are shown to identify area of high spatial error for the C5G7 problem as well as for the discrete ordinates solver. A novel approach of combining the capabilities of Monte Carlo with the discrete ordinates nearby problems is presented for one- and two-dimensional fixed source problems. In conclusion, the MNP demonstrates its effectiveness at identifying spatial error on a single structured grid with a wide variety of neutron transport problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Offline Maximizing Minimally Invasive Proper Orthogonal Decomposition for Reduced-Order Modeling of S n Radiation Transport

Deterministic solutions to the Sn radiation transport equation can be computationally expensive to calculate. Reduced-order modeling enables efficient approximation of the full-order model (FOM) solution. We propose a novel method for constructing reduced-order models (ROMs) of the S n radiation transport equation, offline maximizing minimally invasive (OMMI) proper orthogonal decomposition (POD). POD uses the method of snapshots to create a reduced-order basis for constructing an ROM. Minimally invasive POD leverages the sweep infrastructure existing in deterministic transport codes to create a POD-based ROM, even when infeasible by traditional methods. Offline maximizing minimally invasive proper orthogonal decomposition (OMMI-POD) extends minimally invasive POD by performing sweeps offline, therefore maximizing the potential speedup. OMMI-POD does so by creating a library of reduced systems from a training set. This library of reduced systems is then interpolated to provide a rapid approximate solution of the S n radiation transport equation. The model is evaluated on a set of test problems, achieving a low error with a 466 times speedup over the FOM. Also presented is a study of the effect of sampling method on the performance of OMMI-POD, specifically comparing naive uniform sampling to the more accurate and computationally expensive greedy sampling.

97 MATHEMATICS AND COMPUTING↗

Reduce-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which usually consists of a database of tabulated values, used to calculate the cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of micro cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. To address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multi-group cross section data across isotopes, reaction types and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs for have been trained for all isotopes in this work and systematic Griffin testing is ongoing at this moment to ensure the feasibility of this ROM technique for cross section predictions.

42 - ENGINEERING↗

Reduced-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

Advanced Cross Section Library Generation using Reduced Order Models

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

Excited-state uncertainties in lattice-QCD calculations of multi-hadron systems

Excited-state effects lead to hard-to-quantify systematic uncertainties in lattice quantum chromodynamics (LQCD) spectroscopy calculations when computationally accessible imaginary times are smaller than inverse excitation gaps, as often arises for multi-hadron systems with signal-to-noise problems. Lanczos residual bounds address this by providing two-sided constraints on energies that do not require assumptions beyond Hermiticity, but often give very conservative systematic uncertainty estimates. Here, a more-constraining set of gap bounds is introduced for hadron spectroscopy. These bounds provide tighter constraints whose validity requires an explicit assumption about an energy gap. Exactly solvable lattice field theory correlators are used to test the utility of residual and gap bounds at finite and infinite statistics. Two-sided bounds and other analysis methods are then applied to a high-statistics LQCD calculation of nucleon-nucleon scattering at $m_π\sim 800$ MeV. Generalized eigenvalue problem (GEVP) and Lanczos energy estimators are compatible when applied to the same correlator data, but analyses including different interpolating operators show statistically significant inconsistencies. However, two-sided bounds from all operators are consistent. Under the assumption that the number of energy levels below $NΔ$ and $ΔΔ$ thresholds is the same as for non-interacting nucleons, gap bounds are sufficient to constrain nucleon-nucleon scattering amplitudes at phenomenologically relevant precision. Lanczos methods further reveal that energy-eigenstate estimates from previously studied asymmetric correlators have not converged over accessible imaginary times. Nevertheless, data-driven examples demonstrate why assumptions are required to draw conclusions about the natures of two-nucleon ground states at these masses.

Detmold, William [MIT, Cambridge, CTP]↗