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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Testing of the Support Vector Machine for Binary-Class Classification

The Support Vector Machine is a powerful algorithm, useful in classifying data in to species. The Support Vector Machines implemented in this research were used as classifiers for the final stage in a Multistage Autonomous Target Recognition system. A single kernel SVM known as SVMlight, and a modified version known as a Support Vector Machine with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SMV as a method for classification. From trial to trial, SVM produces consistent results

autonomous target recognition systemr↗
DOE OSTI2026

Small-𝑥 behavior in QCD from maximal entanglement and conformal invariance

Recent evidence suggests that, at small Bjorken 𝑥, QCD evolution drives the proton into a state of maximal entanglement. If the evolution kernel is assumed to be conformally invariant—as is the case for the Balitsky-Fadin-Kuraev-Lipatov equation—we can describe it by a conformal field theory. Moreover, the central charge 𝑐 of the corresponding conformal field theory emerges as the key parameter governing the 𝑥 dependence of both the entanglement entropy and the structure function. Here we apply the exact Bethe ansatz methods to the quantum spin chain dual to Lipatov’s high energy effective action to extract the central charge of the theory, and find that 𝑐 = 1. This implies the ∼𝑥 −1/3 small 𝑥 behavior for the structure function—the prediction that can be tested at the forthcoming Electron-Ion Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Conformal Hierarchical Simulation-Based Inference with Local Validity

Trustworthy and interpretable uncertainty quantification is a long-standing challenge in artificial intelligence. Simulation-based inference (SBI) comprises a broad swath of approaches for estimating latent parameters with uncertainties. Although flexible neural density estimators in SBI can be remark- ably expressive capturing highly structured, high-dimensional posteriors their credible regions can be badly mis-calibrated and are often only accompanied by heuristic coverage checks. We present the first SBI framework that delivers finite-sample local valid coverage guarantees that hold in the neighborhood of each observation. Our framework can couple any off-the-shelf hierarchical SBI engine with a confor- mal Bayesian post-processing step that operates on the posterior predictive density. A kernel-weighted conformity score adapts the conformal quantile to the local geometry of the data, yielding prediction sets that are simultaneously (i) marginally calibrated, (ii) locally valid, and (iii) hierarchical, handling global and observation-specific parameters in a single pass. Through experiments on synthetic data and benchmarks from neuroscience and physics, we show that our approach attains 1 − α coverage, where prior SBI methods under- or over-cover. Our approach also maintains a competitive, credible set size with minimal computational overhead. Finally, our approach can be used to make predictions on real data and give valid credible regions modulo weight-initialization-based model mis-specification.

Trivedi, Shubhendu [Fermilab]↗
NASA NTRS2013

SpF: Enabling Petascale Performance for Pseudospectral Dynamo Models

Pseudospectral (PS) methods possess a number of characteristics (e.g., efficiency, accuracy, natural boundary conditions) that are extremely desirable for dynamo models. Unfortunately, dynamo models based upon PS methods face a number of daunting challenges, which include exposing additional parallelism, leveraging hardware accelerators, exploiting hybrid parallelism, and improving the scalability of global memory transposes. Although these issues are a concern for most models, solutions for PS methods tend to require far more pervasive changes to underlying data and control structures. Further, improvements in performance in one model are difficult to transfer to other models, resulting in significant duplication of effort across the research community.We have developed an extensible software framework for pseudospectral methods called SpF that is intended to enable extreme scalability and optimal performance. High-level abstractions provided by SpF unburden applications of the responsibility of managing domain decomposition and load balance while reducing the changes in code required to adapt to new computing architectures. The key design concept in SpF is that each phase of the numerical calculation is partitioned into disjoint numerical kernels that can be performed entirely in-processor. The granularity of domain-decomposition provided by SpF is only constrained by the data-locality requirements of these kernels. SpF builds on top of optimized vendor libraries for common numerical operations such as transforms, matrix solvers, etc., but can also be configured to use open source alternatives for portability. SpF includes several alternative schemes for global data redistribution and is expected to serve as an ideal testbed for further research into optimal approaches for different network architectures.In this presentation, we will describe the basic architecture of SpF as well as preliminary performance data and experience with adapting legacy dynamo codes. We will conclude with a discussion of planned extensions to SpF that will provide pseudospectral applications with additional flexibility with regard to time integration, linear solvers, and discretization in the radial direction.

Pseudospectral (PS)↗
DOE OSTI2025

Accurately simulating core-collapse self-interacting dark matter halos

The properties of satellite halos provide a promising probe for dark matter (DM) physics. Observations have motivated current efforts to explain surprisingly compact DM halos. If DM is not collisionless, but has strong self-interactions, halos can undergo gravothermal collapse, leading to higher densities in the central region of the halo. However, it is challenging to model this collapse phase from first principles. To improve on this, we sought to better understand the numerical challenges and convergence properties of self-interacting dark matter (SIDM) N-body simulations in the collapse phase. Especially, our aim was to better understand the evolution of satellite halos. To do so, we ran SIDM N-body simulations of a low-mass halo in isolation and within an external gravitational potential. The simulation set-up was motivated by the perturber of the stellar stream GD-1. We find that the halo evolution is very sensitive to energy conservation errors, and a SIDM kernel size that is too large can artificially speed up the collapse. Moreover, we demonstrate that the King model can describe the density profile at small radii for the late stages that we have simulated. Furthermore, for our most highly resolved simulation (N = 5 × 10 7 ) we have made the data public. It can serve as a benchmark. Overall, we find that the current numerical methods do not suffer from convergence problems in the late collapse phase and provide guidance on how to choose numerical parameters, for example that the energy conservation error is better kept well below 1%. This allows simulations to be run of halos that become concentrated enough to explain observations of GD-1-like stellar streams or strong gravitational lensing systems.

dark matter↗
NASA NTRS1991

Note on unit tangent vector computation for homotopy curve tracking on a hypercube

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and subsequent tracking of some smooth curve in the zero set of the homotopy map. Tracking a homotopy curve involves finding the unit tangent vector at different points along the zero curve, which amounts to calculating the kernel of the n x (n + 1) Jacobian matrix. While computing the tangent vector is just one part of the curve tracking algorithm, it can require a significant percentage of the total tracking time. This note presents computational results showing the performance of several different parallel orthogonal factorization/triangular system solving algorithms for the tangent vector computation on a hypercube.

Chakraborty, A.↗
DOE OSTI2025

Thermal relaxation and the complete set of second-order transport coefficients for the unitary Fermi gas from kinetic theory

We compute the complete set of second-order transport coefficients of the unitary Fermi gas, a dilute gas of spin-1/2 particles interacting via an 𝑠 -wave interaction tuned to infinite scattering length. The calculation is based on kinetic theory and the Chapman-Enskog method at second order in the Knudsen expansion. We take into account the exact two-body collision integral. We extend previous results on second-order coefficients related to shear stress by including terms related to heat flow and gradients of the fugacity. We confirm that the thermal relaxation time is given by the simple estimate 𝜏 𝜅 = 𝜅⁢𝑚/(𝑐 𝑃 ⁢𝑇) even if the full collision kernel is taken into account. Furthermore, 𝜅 is the thermal conductivity, 𝑚 is the mass of the particles, 𝑐𝑃 is the specific heat at constant pressure, and 𝑇 is the temperature.

Kinetic theory↗
DOE OSTI2025

Physics-Informed Gaussian Process Inference of Liquid Structure from Scattering Data

We present a nonparametric Bayesian framework to infer radial distribution functions from experimental scattering measurements with uncertainty quantification using nonstationary Gaussian processes. The Gaussian process prior mean and kernel functions are designed to mitigate well-known numerical challenges with the Fourier transform, including discrete measurement binning and detector windowing, while encoding fundamental yet minimal physical knowledge of the liquid structure. We demonstrate uncertainty propagation of the Gaussian process posterior to unmeasured quantities of interest. Experimental radial distribution functions of liquid argon and water with uncertainty quantification are provided as both a proof of principle for the method and a benchmark for molecular models.

Chemical structure↗
DOE OSTI2025

Machine learning force field model for kinetic Monte Carlo simulations of itinerant Ising magnets

Here, we present a scalable machine learning (ML) framework for large-scale kinetic Monte Carlo (kMC) simulations of itinerant electron Ising systems. As the effective interactions between Ising spins in such itinerant magnets are mediated by conducting electrons, the calculation of energy change due to a local spin update requires solving an electronic structure problem. Such repeated electronic structure calculations could be overwhelmingly prohibitive for large systems. Assuming the locality principle, a convolutional neural network (CNN) model is developed to directly predict the effective local field and the corresponding energy change associated with a given spin update based on Ising configuration in a finite neighborhood. As the kernel size of the CNN is fixed at a constant, the model can be directly scalable to kMC simulations of large lattices. Our approach is reminiscent of the ML force field models widely used in first-principles molecular dynamics simulations. Applying our ML framework to a square-lattice double-exchange Ising model, we uncover unusual coarsening of ferromagnetic domains at low temperatures. Our work highlights the potential of ML methods for large-scale modeling of similar itinerant systems with discrete dynamical variables.

machine learning↗
DOE OSTI2025

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗
NASA NTRS2008

EBSD and Nanoindentation-Correlated Study of Delamination Fracture in Al-Li Alloy 2090

Al-Li alloys offer attractive combinations of high strength and low density. However, a tendency for delamination fracture has limited their use. A better understanding of the delamination mechanisms may identify methods to control delaminations through processing modifications. A combination of new techniques has been used to evaluate delamination fracture in Al-Li alloys. Both high quality electron backscattered diffraction (EBSD) information and valid nanoindentation measurements were obtained from fractured test specimens. Correlations were drawn between nano-scale hardness variations and local texture along delaminating boundaries. Intriguing findings were observed for delamination fracture through the combined analysis of grain orientation, Taylor factor, and kernel average misorientation.

Tayon, Wesley A.↗
DOE OSTI2025

Liquid–Vapor Phase Equilibrium in Molten Aluminum Chloride (AlCl 3 ) Enabled by Machine Learning Interatomic Potentials

Molten salts are promising candidates in numerous clean energy applications, where knowledge of thermophysical properties and vapor pressure across their operating temperature ranges is critical for safe operations. Due to challenges in evaluating these properties using experimental methods, fast and scalable molecular simulations are essential to complement the experimental data. In this study, we developed machine learning interatomic potentials (MLIP) to study the AlCl 3 molten salt across varied thermodynamic conditions (T = 473–613 K and P = 2.7–23.4 bar), which allowed us to predict temperature-surface tension correlations and liquid–vapor phase diagram from direct simulations of two-phase coexistence in this molten salt. Two MLIP architectures, a Kernel-based potential and neural network interatomic potential (NNIP), were considered to benchmark their performance for AlCl 3 molten salt using experimental structure and density values. The NNIP potential employed in two-phase equilibrium simulations yields the critical temperature and critical density of AlCl 3 that are within 10 K (∼3%) and 0.03 g/cm 3 (∼7%) of the reported experimental values. An accurate correlation between temperature and viscosities is obtained as well. In doing so, we report that the inclusion of low-density configurations in their training is critical to more accurately represent the AlCl 3 system across a wide phase-space. The MLIP trained using PBE-D3 functional in the ab initio molecular dynamics (AIMD) simulations (120 atoms) also showed close agreement with experimentally determined molten salt structure comprising Al 2 Cl 6 dimers, as validated using Raman spectra and neutron structure factor. Furthermore, the PBE-D3 as well as its trained MLIP showed better liquid density and temperature correlation for AlCl 3 system when compared to several other density functionals explored in this work. Overall, the demonstrated approach to predict temperature correlations for liquid and vapor densities in this study can be employed to screen nuclear reactors-relevant compositions, helping to mitigate safety concerns.

Ab initio molecular dynamics↗
DOE OSTI2025

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗
NASA NTRS2022

Snow Microphysical Retrieval from the NASA D3R Radar During ICE-POP 2018

A method is developed to use both polarimetric and dual-frequency radar measurements to retrieve microphysical properties of falling snow. It is applied to the Ku- and Ka-band measurements of the NASA dual-polarization, dual-frequency Doppler radar (D3R) obtained during the International Collaborative Experiments for PyeongChang 2018 Olympic and Paralympic winter games (ICE-POP 2018) field campaign and incorporates the Atmospheric Radiative Transfer Simulator (ARTS) microwave singles cattering property database for oriented particles. The retrieval uses optimal estimation to solve for several parameters that describe the particle size distribution (PSD), relative contribution of pristine, aggregate, and rimed ice species, and the orientation distribution along an entire radial simultaneously. Examination of Jacobian matrices and averaging kernels shows that the dual-wavelength ratio (DWR) measurements provide information regarding the characteristic particle size, and to a lesser extent, the rime fraction and shape parameter of the size distribution, whereas the polarimetric measurements provide information regarding the mass fraction of pristine particles and their characteristic size and orientation distribution. Thus, by combining the dual-frequency and polarimetric measurements, some ambiguities can be resolved that should allow a better determination of the PSD and bulk microphysical properties (e.g., snowfall rate) than can be retrieved from single-frequency polarimetric measurements or dual-frequency, single-polarization measurements. The D3R ICE-POP retrievals were validated using Precipitation Imaging Package (PIP) and Pluvio weighing gauge measurements taken nearby at the May Hills ground site. The PIP measures the snow PSD directly, and its measurements can be used to derived the snowfall rate (volumetric and water equivalent), mean volume-weighted particle size, and effective density, as well as particle aspect ratio and orientation. Four retrieval experiments were performed to evaluate the utility of different measurement combinations: Kuonly, DWR-only, Ku-pol, and All-obs. In terms of correlation, the volumetric snowfall rate (r D 0:95) and snow water equivalent rate (r D 0:92) were best retrieved by the Ku-pol method, while the DWR-only method had the lowest magnitude bias for these parameters (-31% and -8 %, respectively). The methods that incorporated DWR also had the best correlation to particle size (r D 0:74 and r D 0:71 for DWR-only and All-obs, respectively), although none of the methods retrieved density particularly well (r D 0:43 for Allobs). The ability of the measurements to retrieve mean aspect ratio was also inconclusive, although the polarimetric methods (Ku-pol and All-obs) had reduced biases and mean absolute error (MAE) relative to the Ku-only and DWR-only methods. The significant biases in particle size and snowfall rate appeared to be related to biases in the measured DWR, emphasizing the need for accurate DWR measurements and frequent calibration in future D3R deployments.

S Joseph Munchak↗
DOE OSTI2024

Radiation Damage Mitigation in FeCrAl Alloy at Sub-Recrystallization Temperatures

Traditional defect recovery methods rely on high-temperature annealing, often exceeding 750 °C for FeCrAl. In this study, we introduce electron wind force (EWF)-assisted annealing as an alternative approach to mitigate irradiation-induced defects at significantly lower temperatures. FeCrAl samples irradiated with 5 MeV Zr 2+ ions at a dose of 10 14 cm −2 were annealed using EWF at 250 °C for 60 s. We demonstrate a remarkable transformation in the irradiated microstructure, where significant increases in kernel average misorientation (KAM) and low-angle grain boundaries (LAGBs) typically indicate heightened defect density; the use of EWF annealing reversed these effects. X-ray diffraction (XRD) confirmed these findings, showing substantial reductions in full width at half maximum (FWHM) values and a realignment of peak positions toward their original states, indicative of stress and defect recovery. To compare the effectiveness of EWF, we also conducted traditional thermal annealing at 250 °C for 7 h, which proved less effective in defect recovery as evidenced by less pronounced improvements in XRD FWHM values.

FeCrAl alloys↗
NASA NTRS1990

Using a multifrontal sparse solver in a high performance, finite element code

We consider the performance of the finite element method on a vector supercomputer. The computationally intensive parts of the finite element method are typically the individual element forms and the solution of the global stiffness matrix both of which are vectorized in high performance codes. To further increase throughput, new algorithms are needed. We compare a multifrontal sparse solver to a traditional skyline solver in a finite element code on a vector supercomputer. The multifrontal solver uses the Multiple-Minimum Degree reordering heuristic to reduce the number of operations required to factor a sparse matrix and full matrix computational kernels (e.g., BLAS3) to enhance vector performance. The net result in an order-of-magnitude reduction in run time for a finite element application on one processor of a Cray X-MP.

King, Scott D.↗
NASA NTRS2007

NASA Langley's Approach to the Sandia's Structural Dynamics Challenge Problem

The objective of this challenge is to develop a data-based probabilistic model of uncertainty to predict the behavior of subsystems (payloads) by themselves and while coupled to a primary (target) system. Although this type of analysis is routinely performed and representative of issues faced in real-world system design and integration, there are still several key technical challenges that must be addressed when analyzing uncertain interconnected systems. For example, one key technical challenge is related to the fact that there is limited data on target configurations. Moreover, it is typical to have multiple data sets from experiments conducted at the subsystem level, but often samples sizes are not sufficient to compute high confidence statistics. In this challenge problem additional constraints are placed as ground rules for the participants. One such rule is that mathematical models of the subsystem are limited to linear approximations of the nonlinear physics of the problem at hand. Also, participants are constrained to use these models and the multiple data sets to make predictions about the target system response under completely different input conditions. Our approach involved initially the screening of several different methods. Three of the ones considered are presented herein. The first one is based on the transformation of the modal data to an orthogonal space where the mean and covariance of the data are matched by the model. The other two approaches worked solutions in physical space where the uncertain parameter set is made of masses, stiffnesses and damping coefficients; one matches confidence intervals of low order moments of the statistics via optimization while the second one uses a Kernel density estimation approach. The paper will touch on all the approaches, lessons learned, validation 1 metrics and their comparison, data quantity restriction, and assumptions/limitations of each approach. Keywords: Probabilistic modeling, model validation, uncertainty quantification, kernel density

Horta, Lucas G.↗
DOE OSTI2025

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗