Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25

Efficient screening of rare large pit anomalies on polished surfaces using a minimalist sampling scheme

Lawrence Livermore National Laboratory (LLNL) has made significant strides in generating clean energy through its inertial confinement fusion (ICF) experiments. These experiments rely on high-density carbon (HDC) coated shells to encapsulate the fusion fuel. The success of these experiments is heavily dependent on the surface quality of these shells, as even minor imperfections, such as deep pits, can negatively impact fusion yield. Ensuring the required smoothness involves an extensive surface-finishing process that spans approximately 20 stages, making it both time-intensive and resource-demanding. A critical challenge in this process is the need for high-resolution scans to detect rare deep pits, which can be costly and impractical if performed on every shell. This highlights the necessity of developing more efficient scanning methods to optimize time and cost without compromising accuracy. To address these challenges, we introduce a novel approach that employs the multivariate Dvoretzky–Kiefer–Wolfowitz (DKW) inequality to provide a probabilistic upper bound on the error in estimating pit distribution characteristics via a Kernel Density Estimator (KDE). This error bound enables efficient and reliable estimation of pit distribution characteristics at a specified statistical confidence level using a minimal number of surface scans. The integrated DKW-KDE approach was validated through surface-finishing experiments across two batches of HDC-coated shells, demonstrating consistent and robust performance across multiple stages of the surface-finishing experiments. The validation studies suggest that the integrated DKW-KDE approach achieves comparable accuracy in estimating the risk of deleterious large pits with six scans, thus conserving time and resources. Further evaluations show that performance remains consistent across batches and over multiple polishing stages. In conclusion, based on these findings, one can leverage the minimal-scan insights to strategically improve the bottleneck inspection process, thus enhancing the productivity and quality of shell polishing and similar challenging manufacturing processes.

Inertial confinement fusion↗

The total neutron cross section of liquid and solid ammonia

Ammonia is a material of interest for future neutron moderators at high-power sources due to its high hydrogen density, low melting point, and resistance to polymerization in an intense radiation field. Its performance in such applications cannot currently be calculated due to the absence of suitable computer models for the interaction of neutrons with ammonia under relevant conditions. In an effort to develop suitable scattering kernels for computer simulations of moderator performance, we have conducted a series of Density Functional Theory and Molecular Dynamics calculations of the molecular-level thermal properties of ammonia at various temperatures within both the solid and liquid phases. In this paper, we compare computer calculations for the energy-dependent total neutron cross section of ammonia, based on these models, to experimental measurements of those cross sections at temperatures of 221 K, 180 K, and 35 K. The experimental data were collected over an energy range from 0.1 meV to 10 eV using time-of-flight techniques at the Low Energy Neutron Source (LENS) facility at Indiana University. This comparison provides a first validation in the development of thermal scattering libraries for Monte Carlo source design simulations based on liquid and solid ammonia. In conclusion, we also provide some insights into where additional development of tools for creating such models may be needed.

Ammonia↗

Feature learning and generalization in deep networks with orthogonal weights

Fully-connected deep neural networks with weights initialized from independent Gaussian distributions can be tuned to criticality, which prevents the exponential growth or decay of signals propagating through the network. However, such networks still exhibit fluctuations that grow linearly with the depth of the network, which may impair the training of networks with width comparable to depth. We show analytically that rectangular networks with tanh activations and weights initialized from the ensemble of orthogonal matrices have corresponding preactivation fluctuations which are independent of depth, to leading order in inverse width. Moreover, we demonstrate numerically that, at initialization, all correlators involving the neural tangent kernel (NTK) and its descendants at leading order in inverse width—which govern the evolution of observables during training—saturate at a depth of ~20, rather than growing without bound as in the case of Gaussian initializations. We speculate that this structure preserves finite-width feature learning while reducing overall noise, thus improving both generalization and training speed in deep networks with depth comparable to width. We provide some experimental justification by relating empirical measurements of the NTK to the superior performance of deep non-linear orthogonal networks trained under full-batch gradient descent on the MNIST and CIFAR-10 classification tasks.

97 MATHEMATICS AND COMPUTING↗

Methods in PES-Learn: Direct-Fit Machine Learning of Born–Oppenheimer Potential Energy Surfaces

The release of PES-L EARN version 1.0 as an open-source software package for the automatic construction of machine learning models of semi-global molecular potential energy surfaces (PESs) is presented. Improvements to PES-L EARN ’s interoperability are stressed with new Python API that simplifies workflows for PES construction via interaction with QCSchema input and output infrastructure. In addition, a new machine learning method is introduced to PES-L EARN : kernel ridge regression (KRR). The capabilities of KRR are emphasized with examination of select semi-global PESs. All machine learning methods available in PES-L EARN are benchmarked with benzene and ethanol datasets from the rMD17 database to illustrate PES-L EARN ’s performance ability. Fitting performance and timings are assessed for both systems. Finally, the ability to predict gradients with neural network models is presented and benchmarked with ethanol and benzene. PES-L EARN is an active project and welcomes community suggestions and contributions.

kernel ridge regression↗

Multiclass Reduced-Set Support Vector Machines

There are well-established methods for reducing the number of support vectors in a trained binary support vector machine, often with minimal impact on accuracy. We show how reduced-set methods can be applied to multiclass SVMs made up of several binary SVMs, with significantly better results than reducing each binary SVM independently. Our approach is based on Burges' approach that constructs each reduced-set vector as the pre-image of a vector in kernel space, but we extend this by recomputing the SVM weights and bias optimally using the original SVM objective function. This leads to greater accuracy for a binary reduced-set SVM, and also allows vectors to be 'shared' between multiple binary SVMs for greater multiclass accuracy with fewer reduced-set vectors. We also propose computing pre-images using differential evolution, which we have found to be more robust than gradient descent alone. We show experimental results on a variety of problems and find that this new approach is consistently better than previous multiclass reduced-set methods, sometimes with a dramatic difference.

reduced set methods↗

Historical Total Ozone Radiative Forcing Derived from CMIP6 Simulations

Radiative forcing (RF) time series for total ozone from 1850 up to present-day are calculated based on historical simulations of ozone from 10 climate models contributing to the Coupled Model Intercomparison Project Phase 6 (CMIP6). In addition, RF is calculated for ozone fields prepared as input for CMIP6 models without chemistry schemes and from a chemical transport model simulation. A radiative kernel for ozone is constructed and used to derive the RF. The ozone RF in 2010 (200530 -2014) relative to 1850 is 0.35 W m-2 [0.08 to 0.61] (5-95% uncertainty range) based on models with both tropospheric and stratospheric chemistry. One of these models has a negative present-day total ozone RF. Excluding this model, the present-day ozone RF increases to 0.39 W m-2 [0.27 to 0.51] (533 - 95% uncertainty range). The rest of the models have RF close to or stronger than the RF time series assessed by the Intergovernmental Panel on Climate Change in the fifth assessment report with the primary driver likely being the new precursor emissions used in CMIP6. The rapid adjustments beyond stratospheric temperature are estimated to be weak and thus the RF is a good measure of effective radiative forcing.

ozone↗

Assessments of S-NPP and N20 VIIRS DNB and M bands calibration stability and consistency using a homogeneous ground target

The S-NPP and N20 VIIRS Day-Night band (DNB) and M bands top-of-atmosphere (TOA) radiance and reflectance are calculated and a kernel-driven Bidirectional Reflectance Distribution Function (BRDF) correction model is used to correct the surface and atmosphere combined BRDF influence. Due to degradation in the DNB modulated Relative Spectral Response (RSR), the S-NPP VIIRS observed TOA DNB reflectance indicates a decrease of 1.89% and the SCIAMACHY spectra derived TOA DNB reflectance has a decrease of 1.63% for the past 8.5 years. The N20 VIIRSTOA DNB reflectance decreased 0.50% in the past 2.5 years. The DNB radiance is also compared with the integral of the M bands radiance from M4, M5, and M7. The fitting trends of DNB to the integral of M bands ratios indicate a0.48% decrease for S-NPP VIIRS and 0.14% increase for N20 VIIRS. The N20 VIIRS DNB to integral M bands ratios are closer to 1 than the S-NPP VIIRS data. The BRDF corrected reflectance comparisons show that the N20 VIIRS data is slightly lower than those of S-NPP VIIRS. The averages of the linear fit values of the N20 to S-NPP VIIRS from 2018to 2020 June are -1.97%, -4.99%, -3.36%, and -0.85% for M4, M5, M7, and DNB, respectively. Our results indicate that the S-NPP and N20 VIIRS DNB and M bands calibration have been stable. The cross-sensor differences in DNB and M bands are generally consistent with other independent studies using similar and different approaches.

Libya 4↗

Comparison of Clouds and Cloud Feedback between AMIP5 and AMIP6

We examine the changes in clouds and cloud feedback between Phase 5 (AMIP5) and Phase 6 (AMIP6) of the Atmospheric Model Intercomparison Project. Each model is perturbed by uniformly increasing the sea surface temperature by 4 K. The simulated cloud fraction, the perturbed states and cloud radiative kernels are used to derive cloud feedback in the shortwave (SW), longwave (LW) and their sum (Net). Compared to AMIP5, the cloud fraction in AMIP6 increases by 9.1%, while the perturbation leads to a 0.25% decrease. The Net cloud feedback at the top of the atmosphere (TOA) is almost double (174%). Statistical tests support that this change is mainly due to an increase in the surface SW cloud feedback caused by optically thick, middle and low clouds. The contribution of the atmospheric Net component (12%) stems from the increase in the atmospheric LW cloud feedback, likely to play a role in weakening (strengthening) the northward (southward) meridional atmospheric energy transport, while the opposite is true for the surface LW and Net cloud feedback in the meridional oceanic energy transport. The substantial increase in cloud feedback at the TOA primarily contributes to the higher climate sensitivity. The cloud feedback spread in AMIP6 is comparable to that in AMIP5.

Clouds↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

MatRIS: Addressing the Challenges for Portability and Heterogeneity Using Tasking for Matrix Decomposition (Cholesky)

The ubiquitous in-node heterogeneity of HPC and cloud computing platforms makes software portability and performance optimization extremely challenging. Described here, the MatRIS multilevel math library abstraction framework employs tasking to alleviate these difficulties. MatRIS includes the IRIS task-based runtime on the bottom level and exposes different layers of abstraction to render algorithms architecturally agnostic. MatRIS ensures the decomposition and creation of tasks that represent the necessary encapsulation of the optimized kernels from both vendor and open-source math libraries. Once built, MatRIS can select different combinations of accelerators at runtime, making it portable even on diverse heterogeneous architectures. By leveraging the IRIS runtime’s features for managing heterogeneity, MatRIS deploys algorithms that remove the need to specify orchestration and data transfer. This study describes how the serial task abstraction of a tiled Cholesky factorization is made portable and scalable in the case of multi-device and multi-vendor heterogeneity on a node with NVIDIA and AMD GPUs by using MatRIS. First, we demonstrate that Cholesky in MatRIS provides multi-GPU scalability that offers competitive performance versus cuSolverMG. Then, we present the challenges and opportunities for heterogeneous execution.

Monil, M. A. H.↗

Benchmarking Operators in Deep Neural Networks for Improving Performance Portability of SYCL

SYCL is a portable programming model for heterogeneous computing, so it is important to obtain reasonable performance portability of SYCL. Towards the goal of better understanding and improving performance portability of SYCL for machine learning workloads, we have been developing benchmarks for basic operators in deep neural networks (DNNs). These operators could be offloaded to heterogeneous computing devices such as graphics processing units (GPUs) to speed up computation. In this paper, we introduce the benchmarks, evaluate the performance of the operators on GPU-based systems, and describe the causes of the performance gap between the SYCL and Compute Unified Device Architecture (CUDA) kernels. We find that the causes are related to the utilization of the texture cache for read-only data, optimization of the memory accesses with strength reduction, use of local memory, and register usage per thread. We hope that the efforts of developing benchmarks for studying performance portability will stimulate discussion and interactions within the community.

Jin, Zheming [ORNL] (ORCID:000000027197780X)↗

Effects of threshold resummation for large-x PDF in large momentum effective theory

Parton distribution functions (PDFs) at large x are challenging to extract from experimental data, yet they are essential for understanding hadron structure and searching for new physics beyond the Standard Model. Within the framework of the large momentum P z expansion of lattice quasi-PDFs, we investigate large x PDFs, where the matching coefficient is factorized into the hard kernel, related to the active quark momentum xP z , and the threshold soft function, associated with the spectator momentum (1 − x)P z . The renormalization group equation of the soft function enables the resummation of the threshold double logarithms α k ln 2k (1 − x), which is crucial for a reliable and controllable calculation of large x PDFs. Our analysis with pion valence PDFs indicates that perturbative matching breaks down when the spectator momentum (1 − x)P z approaches Λ QCD , but remains valid when both xP z and (1 − x)P z are much larger than Λ QCD . Additionally, we incorporate leading renormalon resummation within the threshold framework, demonstrating good perturbative convergence in the region where both spectator and active quark momenta are perturbative scales.

factorization↗

Gaussian processes for inferring parton distributions

The extraction of parton distribution functions (PDFs) from experimental or lattice QCD data is an ill-posed inverse problem, where regularization strongly impacts both systematic uncertainties and the reliability of the results. We study a framework based on Gaussian Process Regression (GPR) to reconstruct PDFs from lattice QCD matrix elements. Within a Bayesian framework, Gaussian processes serve as flexible priors that encode uncertainties, correlations, and constraints without imposing rigid functional forms. We investigate a wide range of kernel choices, mean functions, and hyperparameter treatments. We quantify information gained from the data using the Kullback-Leibler divergence. Synthetic data tests demonstrate the consistency and robustness of the method. Our study establishes GPR as a systematic and non-parametric approach to PDF reconstruction, offering controlled uncertainty estimates and reduced model bias in lattice QCD analyses.

hadronic spectroscopy↗

A double copy from twisted (co)homology at genus one

We study the twisted (co)homology of a family of genus-one integrals — the so called Riemann-Wirtinger integrals. These integrals are closely related to one-loop string amplitudes in chiral splitting where one leaves the loop-momentum, modulus and all but one puncture un-integrated. While not actual one-loop string integrals, they share many properties and are simple enough that the associated twisted (co)homologies have been completely characterized [1]. Using intersection numbers — an inner product on the vector space of allowed differential forms — we derive the Gauss-Manin connection for two bases of the twisted cohomology providing an independent check of [2]. We also use the intersection index — an inner product on the vector space of allowed contours — to derive a double-copy formula for the closed-string analogues of Riemann-Wirtinger integrals (one-dimensional integrals over the torus). Similar to the celebrated KLT formula between open- and closed-string tree-level amplitudes, these intersection indices form a genus-one KLT-like kernel defining bilinears in meromorphic Riemann-Wirtinger integrals that are equal to their complex counterparts.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Resummation for lattice QCD calculation of generalized parton distributions at nonzero skewness

Large-momentum effective theory (LaMET) provides an approach to directly calculate the x-dependence of generalized parton distributions (GPDs) on a Euclidean lattice through power expansion and a perturbative matching. When a parton’s momentum becomes soft, the corresponding logarithms in the matching kernel become non-negligible at higher orders of perturbation theory, which requires a resummation. But the resummation for the off-forward matrix elements at nonzero skewness ξ is difficult due to their multi-scale nature. In this work, we demonstrate that these logarithms are important only in the threshold limit, and derive the threshold factorization formula for the quasi-GPDs in LaMET. We then propose an approach to resum all the large logarithms based on the threshold factorization, which is implemented on a GPD model. We demonstrate that the LaMET prediction is reliable for [−1 + x 0 , −ξ − x 0 ] ∪ [−ξ + x 0 , ξ − x 0 ] ∪ [ξ + x 0 , 1 − x 0 ], where x 0 is a cutoff depending on hard parton momenta. Through our numerical tests with the GPD model, we demonstrate that our method is self-consistent and that the inverse matching does not spread the nonperturbative effects or power corrections to the perturbatively calculable regions.

hadronic spectroscopy↗

An efficient second-order adaptive procedure for inserting CAD geometries into hexahedral meshes using volume fractions

Here, this paper is concerned with inserting three-dimensional computer-aided design (CAD) geometries into meshes composed of hexahedral elements using a volume fraction representation. An adaptive procedure for doing so is presented. The procedure consists of two steps. The first step performs spatial acceleration using a k-d tree. The second step involves subdividing individual hexahedra in an adaptive mesh refinement (AMR)-like fashion and approximating the CAD geometry linearly (as a plane) at the finest subdivision. The procedure requires only two geometric queries from a CAD kernel: determining whether or not a queried spatial coordinate is inside or outside the CAD geometry and determining the closest point on the CAD geometry’s surface from a given spatial coordinate. We prove that the procedure is second-order accurate for sufficiently smooth geometries and sufficiently refined background meshes. We demonstrate the expected order of accuracy is achieved with several verification tests and illustrate the procedure’s effectiveness for several exemplar CAD geometries.

Adaptive↗