Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Measurement of the muon anomalous precession frequency in runs 2 \& 3 of the Muon $g-2$ Experiment at Fermilab

This dissertation presents a measurement of the muon anomalous precession frequency for the Runs 2 \& 3 data of the E989 Muon $g-2$ Experiment at Fermilab. The muon anomalous precession frequency is one of two key inputs, the other being the magnetic field, used to precisely determine the muon magnetic anomaly, $a_{\mu}$. In April 2021, the E989 collaboration reported its first measurement of $a_{\mu}$ to an unprecedented precision of 460 parts-per-billion (ppb). This result is in agreement with the previous measurement performed by the E821 collaboration at Brookhaven National Laboratory, and the combined experimental value is in tension with the Standard Model prediction at 4.2$\sigma$, a possible hint of new physics. The first result from E989 was based on the Run-1 data, which was collected in 2018 and comprises 6\% of the experiment’s target statistics; the Run-1 result was statistics-limited. The Runs 2 \& 3 data were collected in 2019-2020 and constitute a four-fold increase i n statistics compared to Run-1 and consequently, a factor of two reduction in the measurement’s statistical uncertainty. This reduced statistical uncertainty, as well as continued understanding of systematic effects, will result in an even more precise measurement of $a_{\mu}$ and will help clarify the observed tension between theory and experiment. The precession frequency analysis presented in this dissertation includes a number of improvements compared to Boston University's Run-1 analysis: the implementation of a more robust pileup-subtraction procedure, the implementation of a kernel ratio method, the adoption of the statistically optimal asymmetry-weighted method, and investigations that led to an improved understanding of an outstanding residual slow effect. This dissertation motivates a measurement of the muon magnetic anomaly, describes the experimental principle, gives an overview of the E989 experiment, and presents a precession frequency analysis with full systematic unc ertainty evaluation for the Runs 2 \& 3 data. The combined precession frequency measurement, using the ratio asymmetry-weighted method, has a statistical uncertainty of 201 ppb and a systematic uncertainty of 25 ppb, constituting the most precise determination of the muon anomalous precision frequency to date.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2023

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Kernel-based global sensitivity analysis obtained from a single data set

Results from global sensitivity analysis (GSA) often guide the understanding of complicated input–output systems. Kernel-based GSA methods have recently been proposed for their capability of treating a broad scope of complex systems. In this paper, we develop a new set of kernel GSA tools when only a single set of input–output data is available. Three key advances are made: (1) A new numerical estimator is proposed that demonstrates an empirical improvement over previous procedures. (2) A computational method for generating inner statistical functions from a single data set is presented. (3) A theoretical extension is made to define conditional sensitivity indices, which reveal the degree that the inputs carry shared information about the output when inherent input–input correlations are present. Utilizing these conditional sensitivity indices, a decomposition is derived for the output uncertainty based on what is called the optimal learning sequence of the input variables, which remains consistent when correlations exist between the input variables. Further, while these advances cover a range of GSA subjects, a common single data set numerical solution is provided by a technique known as the conditional mean embedding of distributions. The new methodology is implemented on benchmark systems to demonstrate the provided insights.

42 ENGINEERING↗
DOE OSTI2023

Fault Detection via Occupation Kernel Principal Component Analysis

Reliable operation of automatic systems is heavily dependent on the ability to detect faults in the underlying dynamics. While traditional model-based methods have been widely used for fault detection, data-driven approaches have garnered increasing attention due to their ease of deployment and minimal need for expert knowledge. In this letter, we present a novel principal component analysis (PCA) method that uses occupation kernels. Occupation kernels result in feature maps that are tailored to the measured data, have inherent noise-robustness due to the use of integration, and can utilize irregularly sampled system trajectories of variable lengths for PCA. The occupation kernel PCA method is used to develop a reconstruction error approach to fault detection and its efficacy is validated using numerical simulations.

42 ENGINEERING↗
DOE OSTI2024

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗
DOE OSTI2022

Advanced stationary and nonstationary kernel designs for domain-aware Gaussian processes

Gaussian process regression is a widely-applied method for function approximation and uncertainty quantification. The technique has gained popularity recently in the machine learning community due to its robustness and interpretability. The mathematical methods we discuss in this paper are an extension of the Gaussian-process framework. We are proposing advanced kernel designs that only allow for functions with certain desirable characteristics to be elements of the reproducing kernel Hilbert space (RKHS) that underlies all kernel methods and serves as the sample space for Gaussian process regression. These desirable characteristics reflect the underlying physics; two obvious examples are symmetry and periodicity constraints. In addition, non-stationary kernel designs can be defined in the same framework to yield flexible multi-task Gaussian processes. We will show the impact of advanced kernel designs on Gaussian processes using several synthetic and two scientific data sets. The results of our research show that including domain knowledge, communicated through advanced kernel designs, has a significant impact on the accuracy and relevance of the function approximation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Measurement of the muon anomalous precession frequency in runs 4, 5, and 6 of the muon ${g}-2$ Experiment at Fermilab

The Fermilab E989 Muon $g-2$ experiment measures the muon's anomalous magnetic moment to a precision of 127 parts per billion, as reported in June 2025. The value is proportional to the difference between the muon's cyclotron frequency and the spin precession frequency in the presence of a uniform magnetic field, for muons contained within the $g-2$ storage ring. Spin precession frequency is extracted from the time distribution of the muon's decay positrons recorded by 24 electromagnetic calorimeters positioned around the inner circumference of the storage ring. The anomalous precession frequency is one of the primary experimental inputs necessary to estimate the anomalous magnetic moment, the other being the measurement of the magnetic field. This dissertation details the anomalous precession frequency extraction, including reconstruction, time-distribution fitting, and treatment of systematic uncertainties for the final three data-collection runs: Run-4, Run-5, and Run-6. This data represents a fourfold increase in statistics over the previous analysis release, halving the statistical uncertainty. The residual slow term from previous analyses is now well understood and documented in a systematic treatment. As of the writing of this dissertation, the theoretical prediction for the SM estimate of the muon's anomalous magnetic moment is under debate, with two competing prediction methods, so a definitive comparison with theory is not available. The results submitted for experimental release use the kernel-ratio asymmetry method, contributing 115 parts per billion to the statistical uncertainty and 34 parts per billion to the systematic uncertainty. When combined with the previous analyses in earlier data runs, this thereby improves the measurement beyond the experimental goal and sets the world's most precise measurement of the muon's anomalous magnetic moment.

Israel, Scott Nathan [Boston U.]↗
DOE OSTI2025

Measurement of the muon anomalous precession frequency in runs 4, 5, and 6 of the muon ${g}-2$ Experiment at Fermilab

The Fermilab E989 Muon $g-2$ experiment measures the muon's anomalous magnetic moment to a precision of 127 parts per billion, as reported in June 2025. The value is proportional to the difference between the muon's cyclotron frequency and the spin precession frequency in the presence of a uniform magnetic field, for muons contained within the $g-2$ storage ring. Spin precession frequency is extracted from the time distribution of the muon's decay positrons recorded by 24 electromagnetic calorimeters positioned around the inner circumference of the storage ring. The anomalous precession frequency is one of the primary experimental inputs necessary to estimate the anomalous magnetic moment, the other being the measurement of the magnetic field. This dissertation details the anomalous precession frequency extraction, including reconstruction, time-distribution fitting, and treatment of systematic uncertainties for the final three data-collection runs: Run-4, Run-5, and Run-6. This data represents a fourfold increase in statistics over the previous analysis release, halving the statistical uncertainty. The residual slow term from previous analyses is now well understood and documented in a systematic treatment. As of the writing of this dissertation, the theoretical prediction for the SM estimate of the muon's anomalous magnetic moment is under debate, with two competing prediction methods, so a definitive comparison with theory is not available. The results submitted for experimental release use the kernel-ratio asymmetry method, contributing 115 parts per billion to the statistical uncertainty and 34 parts per billion to the systematic uncertainty. When combined with the previous analyses in earlier data runs, this thereby improves the measurement beyond the experimental goal and sets the world's most precise measurement of the muon's anomalous magnetic moment.

Israel, Scott Nathan [Boston U.]↗
DOE OSTI2026

Measurement of the muon anomalous precession frequency in Runs 4, 5, and 6 of the Muon g-2 experiment at Fermilab

The Fermilab E989 Muon g − 2 experiment measures the muon’s anomalous magnetic moment to a precision of 127 parts per billion, as reported in June 2025. The value is proportional to the difference between the muon’s cyclotron frequency and the spin precession frequency in the presence of a uniform magnetic field, for muons contained within the g − 2 storage ring. Spin precession frequency is extracted from the time distribution of the muon’s decay positrons recorded by 24 electromagnetic calorimeters positioned around the inner circumference of the storage ring. The anomalous precession frequency is one of the primary experimental inputs necessary to estimate the anomalous magnetic moment, the other being the measurement of the magnetic field. This dissertation details the anomalous precession frequency extraction, including reconstruction, time-distribution fitting, and treatment of systematic uncertainties for the final three data-collection runs: Run-4, Run-5, and Run-6. This data represents a fourfold increase in statistics over the previous analysis release, halving the statistical uncertainty. The residual slow term from previous analyses is now well understood and documented in a systematic treatment. As of the writing of this dissertation, the theoretical prediction for the SM estimate of the muon’s anomalous magnetic moment is under debate, with two competing prediction methods, so a definitive comparison with theory is not available. The results submitted for experimental release use the kernel-ratio asymmetry method, contributing 115 parts per billion to the statistical uncertainty and 34 parts per billion to the systematic uncertainty. When combined with the previous analyses in earlier data runs, this thereby improves the measurement beyond the experimental goal and sets the world’s most precise measurement of the muon’s anomalous magnetic moment.

Israel, Scott Nathan [Boston U.]↗
DOE OSTI2022

Advanced Finite-Volume Numerics and Source Term Assumptions for Kernel and G-Equation Modelling of Propane/Air Flames

Here G-Equation models represent propagating flame fronts with an implicit two-dimensional surface representation (level-set). Level-set methods are fast, as transport source terms for the implicit surface can be solved with finite-volume operators on the finite-volume domain, without having to build the actual surface. However, they include approximations whose practical effects are not properly understood. In this study, we improved the numerics of the FRESCO CFD code’s G-Equation solver and developed a new method to simulate kernel growth using signed distance functions and the analytical sphere-mesh overlap. We analyzed their role for simulating propane/air flames, using three well-established constant-volume configurations: a one-dimensional, freely propagating laminar flame; a disc-shaped, constant-volume swirl combustor; and torch-jet flame development through an orifice from a two-chamber device. We tested the explicit (sub-cycled) vs. implicit formulation for the standard transport operators (advection, diffusion, compressibility). In addition to the accurate flame swept-volume method for chemistry and species source term, we developed a more accurate estimator for the burnt/unburnt split cell composition. Then, we developed a signed-distance-function (SDF) based method which provides a more stable reinitialization of the level-set field at every time-step. We found that simplifying assumptions common to several G-Equation implementations, for straightforward terms such as compressibility and advection, lead to large errors in predicting the propagation of even laminar flames, with deviations up to ~300% in simulated vs. formulated flame speed. Conversely, the enhanced numerics enabled through the SDF field reinitialization and improved chemistry source term improve simulation stability and smooth flame propagation even with significantly larger solver time-steps.

42 ENGINEERING↗
DOE OSTI2021

Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells

The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Kernel learning backward SDE filter for data assimilation

In this paper, we develop a kernel learning backward SDE filter method to estimate the state of a stochastic dynamical system based on its partial noisy observations. A system of forward backward stochastic differential equations is used to propagate the state of the target dynamical model, and Bayesian inference is applied to incorporate the observational information. Further, to characterize the dynamical model in the entire state space, we introduce a kernel learning method to learn a continuous global approximation for the conditional probability density function of the target state by using discrete approximated density values as training data. Numerical experiments demonstrate that the kernel learning backward SDE is highly effective.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bayesian High-Rank Hankel Matrix Completion for Nonlinear Synchrophasor Data Recovery

Phasor measurement units (PMUs) provide high temporal-resolution synchrophasor measurements for power system monitoring and control. The frequent data quality issues, such as missing and bad data, prevent the incorporation of synchrophasor data in real-time operations. Most existing data-driven data recovery methods assume the power system dynamics can be approximated by a linear dynamical system, and the recovery performance degrades significantly when the power system is experiencing nonlinear dynamics during significant events. Here, this paper proposes a data-driven Bayesian nonlinear synchrophasor data recovery method (Ba-NSDR) that can recover a consecutive time period of simultaneous data losses or errors across all channels, even when the underlying system is highly nonlinear. The idea is to lift the Hankel matrix of the spatial-temporal synchrophasor data to a higher dimension such that the lifted Hankel matrix is low-rank in that space and can be processed with the kernel trick. Our proposed Bayesian method then infers the probabilistic distributions of synchrophasor from the partial observations. Some distinctive features of Ba-NSDR include an uncertainty index to measure the accuracy of the recovery result and the robustness to parameter selections. Our method is verified on both synthetic and recorded event datasets.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗