Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Large language model evaluation for high–performance computing software development

We apply AI-assisted large language model (LLM) capabilities of GPT-3 targeting high-performance computing (HPC) kernels for (i) code generation, and (ii) auto-parallelization of serial code in C ++, Fortran, Python and Julia. Our scope includes the following fundamental numerical kernels: AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG, and language/programming models: (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). Kernel implementations are generated using GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code given simple + + prompt variants. To quantify and compare the generated results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. For auto-parallelization, we use ChatGPT interactively giving simple prompts as in a dialogue with another human including simple “prompt engineering” follow ups. Results suggest that correct outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding language keywords, while Julia prompts perform acceptably well for its Threads and CUDA.jl programming models. Finally, we expect to provide an initial quantifiable point of reference for code generation in each programming model using a state-of-the-art LLM. Overall, understanding the convergence of LLMs, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Renormalon cancellation and linear power correction to threshold-like asymptotics of space-like parton correlators

Abstract In this paper, we show that the common hard kernel of double-log-type or threshold-type factorization for certain space-like parton correlators that arise in the context of lattice parton distributions, theheavy-light Sudakov hard kernel, has linear infrared (IR) renormalon. We explicitly demonstrate how this IR renormalon correlates with ultraviolet (UV) renormalons of next-to-leading power operators in two explicit examples: threshold asymptotics of space-like quark-bilinear coefficient functions and transverse momentum dependent (TMD) factorization of quasi wave function amplitude. Theoretically, the pattern of renormalon cancellation complies with general expectations to marginal asymptotics in the UV limit. Practically, this linear renormalon explains the slow convergence of imaginary parts observed in lattice extraction of the Collins-Soper kernel and signals the relevance of next-to-leading power contributions. Fully factorized, fully controlled threshold asymptotic expansion for space-like quark-bilinear coefficient functions in coordinate and moment space has also been proposed.

Physics↗
DOE OSTI2023

Measurement of the angle between jet axes in pp collisions at $ \sqrt{s}$ = 5.02 TeV

This article reports measurements of the angle between differently defined jet axes in pp collisions at $\sqrt{s}$ = 5.02 TeV carried out by the ALICE Collaboration. Charged particles at midrapidity are clustered into jets with resolution parameters R = 0.2 and 0.4. The jet axis, before and after Soft Drop grooming, is compared to the jet axis from the Winner-Takes-All (WTA) recombination scheme. The angle between these axes, ΔR axis , probes a wide phase space of the jet formation and evolution, ranging from the initial high-momentum-transfer scattering to the hadronization process. The ΔR axis observable is presented for 20 < $p^{ch jet}_{T}$ < 100 GeV/c, and compared to predictions from the PYTHIA 8 and Herwig 7 event generators. The distributions can also be calculated analytically with a leading hadronization correction related to the non-perturbative component of the Collins-Soper-Sterman (CSS) evolution kernel. Comparisons to analytical predictions at next-to-leading-logarithmic accuracy with leading hadronization correction implemented from experimental extractions of the CSS kernel in Drell-Yan measurements are presented. The analytical predictions describe the measured data within 20% in the perturbative regime, with surprising agreement in the non-perturbative regime as well. These results are compatible with the universality of the CSS kernel in the context of jet substructure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Taming nuclear mass models with Gaussian processes

We propose a new set of nuclear mass predictions based on multiple theoretical mass models. By employing Gaussian process regression with the Matérn kernel, we achieved root-mean-square (rms) deviations below 100 keV for the training dataset. The best-performing mass models achieved rms deviations below 150 keV for the new precise mass data from AME2020, whereas the ensemble average showed robust performance across the nuclear chart. Our approach uniquely combines: (1) systematic refinement of eight mass models through their residuals, (2) physics-informed features, including magic numbers, nucleon parity numbers, neutron excess, and nuclear collectivity, and (3) theory-to-theory validation demonstrating robust extrapolation capability. We find that the Matérn kernel provides superior uncertainty quantification compared to the RBF kernel, with a length-scale analysis revealing enhanced inter-nuclei correlations. We provide complete mass predictions for all unknown nuclides in AME2020, offering valuable constraints for nuclear structure studies and astrophysical modeling when used with proper uncertainty propagation.

Gaussian processes↗
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 OSTI2025

Accelerating magnonic simulations with the pseudospectral Landau-Lifshitz equation

The pseudospectral Landau-Lifshitz (PS-LL) model can describe atomic-scale magnetic exchange interactions within a continuum framework. This is achieved by employing a convolution kernel that models the nonlocal interaction in a grid-independent manner. Even though the PS-LL was originally introduced to address atomic exchange, any nonlocal kernel can be modeled. In the field of magnonics, the dipole field is fundamental to describe the dispersion relation of magnons, the quasiparticle representation of angular momentum. Because dipole-dipole interactions are long-range, numerical approaches typically rely on convolutions. Here, we demonstrate that the PS-LL model can be used to perform magnonic simulations with a single convolution kernel derived from analytical solutions. We demonstrate a twofold increase in computational speed compared with the full dipole calculation. This approach is valid insofar as the excitations are linear, which is typically the case for magnons. Our results have the potential to accelerate magnonic research, particularly for the inverse design method, where several simulations must be performed to achieve the desired outcome.

Mathematics and computing↗
DOE OSTI2021

Are you using the right probe molecules for assessing the textural properties of metal–organic frameworks?

Textural properties—such as the surface area, pore size distribution, and pore volume—are at the forefront of characterization for porous materials. Therefore, it is essential to accurately and reproducibly report a material's textural properties as they could ultimately dictate its applicability. This work aims to provide insightful and comprehensive studies of textural properties for a set of metal–organic frameworks (MOFs), a class of porous materials, using various gases to equip researchers in the field with a helpful guide and reference. Here, we selected a series of nine MOFs with different surface areas, pore sizes, shapes, and chemical environments to represent a wide range of materials. We probed the textural properties of these MOFs using traditional and distinctive gases: N 2 , Kr and O 2 at 77 K, Ar at 87 K, and CO 2 at 195 and 273 K. With regard to surface area, we discuss the validity and challenges associated with the current BET method, the importance of utilizing the Rouquerol et al. consistency criteria to ensure accuracy and reproducibility, and the recommended gas probes for certain materials. For pore size distribution, we discuss the efficacy of each probe for determining the pore sizes within a porous material relative to the calculated distribution from its crystal structure, the limitations of current computational kernels used to calculate pore size distributions, and the need for advanced kernels to envelope the diversity of porous materials. Finally, for pore volume, we discuss the use of the Gurvich rule to obtain the total pore volume in comparison with calculated values from crystal structures and its consistency as a metric for porous materials. Ultimately, we hope that this article will aid researchers in characterizing the textural properties of porous materials and encourage the development of new kernels capable of encompassing the complexity of MOFs and other porous materials.

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

On the discretization error of the discrete generalized quantum master equation

The transfer tensor method (TTM) [Cerrillo and Cao, Phys. Rev. Lett. 112 , 110401 (2014)] can be considered a discrete-time formulation of the Nakajima–Zwanzig quantum master equation (NZ-QME) for modeling non-Markovian quantum dynamics. A recent paper [Makri, J. Chem. Theory Comput. 21 , 5037 (2025)] raised concerns regarding the consistency of the TTM discretization, particularly a spurious term at the initial time t = 0. Here, this work presents a detailed analysis of the discretization structure of the TTM, clarifying the origin of the initial-time correction and establishing a consistent relationship between the TTM discrete-time memory kernel K N and the continuous-time NZ-QME kernel $\mathscr{K}$( N Δ t ). This relationship is validated numerically using the spin-boson model, demonstrating convergence of reconstructed memory kernels and accurate dynamical evolution as Δ t → 0. While the TTM provides a consistent discretization, we note that alternative schemes are also viable, such as the midpoint derivative/midpoint integral scheme proposed in Makri’s work. The relative performance of various schemes for either computing accurate $\mathscr{K}$( N Δ t ) from exact dynamics or obtaining accurate dynamics from exact $\mathscr{K}$( N Δ t ) warrants further investigation.

Density-matrix↗
DOE OSTI2020

Collinear dual-pulse laser optical breakdown and energy deposition

A non-equilibrium model for laser-generated plasmas is used to represent collinear dual nano-second-pulse interactions. In the specific case considered, the breakdown is initiated with an ultraviolet (UV) laser pulse at 266 nm, which pre-ionizes the gas, and it is followed by a near-infrared (NIR) pulse at 1064 nm, which deposits significant energy into the ionized mixture. The model is validated against corresponding experiments, and simulation results are interrogated to understand key features of the plasma-kernel dynamics and the post-discharge hydrodynamics. The hydrodynamics of the non-equilibrium plasma is governed by the two-temperature Navier–Stokes equations accounting for both multiphoton ionization and inverse bremsstrahlung. The interaction between the laser beam and the plasma is modeled based on the radiative transfer equation. The temporal and spatial offsets of the two pulses can generate ionization kernels with different topology and dynamics. It is shown that the UV pre-ionization pulse can tailor the plasma region, leading to a larger ionized volume than would occur for a single-pulse breakdown, and it increases the efficiency of the energy deposition for the following NIR discharge. Vorticity in the early post-discharge phase is generated via baroclinic torque from the misalignment of the radial gradient of density (sudden gas expansion) and the strong pressure gradient (initiated by energy deposition from the laser beam). It is predicted that the collinear dual pulse can be designed to specify the plasma kernel size, shape, and maximum temperature in the breakdown phase, and the initial post-breakdown vorticity and plasma-core decay.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Filamentary surface plasma discharge flow length and time scales

Nanosecond surface dielectric barrier discharges (ns-SDBDs) are a class of plasma actuators that utilize a high-voltage pulse of nanosecond duration between two surface-mounted electrodes to create an electrical breakdown of air, along with rapid heating. These actuators usually produce multiple filaments when operated at high pulse frequencies, and the rapid heating leads to the formation of shock waves and complex flow fields. In this work we replicate a single filament of the ns-SDBDs and characterize the induced flow using velocity measurements from particle image velocimetry and density measurements from background-oriented schlieren. The discharge is produced by a high voltage electrical pulse between two copper electrodes on an acrylic base. A hot gas kernel characterizes the flow field formed close to the electrodes that expands and cools over time and a vortex ring that propagates away from the surface while entraining cold ambient fluid. The gas density deficit inside the kernel displays a power-law decay over time. Based on the observations, we develop a simplified theoretical model based on vortex-driven cooling and perform a scaling analysis to obtain the induced flow length and time scales. The results show that the cooling process's time scales correspond to a circulation-based time scale of the vortex ring, and the length scale of the kernel corresponds to the vortex ring radius. Furthermore, these findings can guide the choice of optimal filament spacing and pulse frequencies in the design, deployment, and operation of ns-SDBDs for flow control.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Long-time memory effects in a localizable central spin problem

We study the properties of the Nakajima–Zwanzig memory kernel for a qubit immersed in a many-body localized (i.e. disordered and interacting) bath. We argue that the memory kernel decays as a power law in both the localized and ergodic regimes, and show how this can be leveraged to extract t → ∞ populations for the qubit from finite time (Jt ≤ 10 2 ) data in the thermalizing phase. This allows us to quantify how the long-time values of the populations approach the expected thermalized state as the bath approaches the thermodynamic limit. This approach should provide a good complement to state-of-the-art numerical methods, for which the long-time dynamics with large baths are impossible to simulate in this phase. Additionally, our numerics on finite baths reveal the possibility for unbounded exponential growth in the memory kernel, a phenomenon rooted in the appearance of exceptional points in the projected Liouvillian governing the reduced dynamics. In small systems amenable to exact numerics, we find that these pathologies may have some correlation with delocalization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum Kerr learning

Quantum machine learning is a rapidly evolving field of research that could facilitate important applications for quantum computing and also significantly impact data-driven sciences. In our work, based on various arguments from complexity theory and physics, we demonstrate that a single Kerr mode can provide some 'quantum enhancements' when dealing with kernel-based methods. Using kernel properties, neural tangent kernel theory, first-order perturbation theory of the Kerr non-linearity, and non-perturbative numerical simulations, we show that quantum enhancements could happen in terms of convergence time and generalization error. Furthermore, we make explicit indications on how higher-dimensional input data could be considered. Finally, we propose an experimental protocol, that we call quantum Kerr learning, based on circuit QED.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Microscopic constraints for the equation of state and structure of neutron stars: A Bayesian model mixing framework

Bayesian model mixing (BMM) is a statistical technique that can combine constraints from different regions of an input space in a principled way. Here we extend our BMM framework for the equation of state (EOS) of strongly interacting matter from symmetric nuclear matter to asymmetric matter, specifically focusing on zero-temperature, charge-neutral, 𝛽-equilibrated matter. We use Gaussian processes (GPs) to infer constraints on the neutron-star matter EOS at intermediate densities from two different microscopic theories: chiral effective-field theory (𝜒⁢EFT) at baryon densities around nuclear saturation, 𝑛 𝐵 ∼ 𝑛 0 , and perturbative QCD at asymptotically high baryon densities, 𝑛 𝐵 ⩾ 20⁢𝑛 0 . The uncertainties of the 𝜒⁢EFT and pQCD EOSs are obtained using the BUQEYE truncation error model. We demonstrate the flexibility of our framework through the use of two categories of GP kernels: conventional stationary kernels and a nonstationary changepoint kernel. We use the latter to explore potential constraints on the dense matter EOS by including exogenous data representing theory predictions and heavy-ion collision measurements at densities ⩾ 2⁢𝑛 0 . We also use our EOSs to obtain neutron-star mass-radius relations and their uncertainties. Finally, our framework, whose implementation will be available through a GitHub repository, provides a prior distribution for the EOS that can be used in large-scale neutron-star inference frameworks.

Bayesian methods↗
DOE OSTI2022

Distributionally Robust Decision Making Leveraging Conditional Distributions

Distributionally robust optimization (DRO) is a powerful tool for decision making under uncertainty. It is particularly appealing because of its ability to leverage existing data. However, many practical problems call for decision-making with some auxiliary information, and DRO in the context of conditional distributions is not straightforward. We propose a conditional kernel distributionally robust optimization (CKDRO) method that enables robust decision making under conditional distributions through kernel DRO and the conditional mean operator in the reproducing kernel Hilbert space (RKHS). In particular, we consider problems where there is a correlation between the unknown variable y and an auxiliary observable variable x. Given past data of the two variables and a queried auxiliary variable, CKDRO represents the conditional distribution P(y|x) as the conditional mean operator in the RKHS space and quantifies the ambiguity set in the RKHS as well, which depends on the size of the dataset as well as the query point. To justify the use of RKHS, we demonstrate that the ambiguity set defined in RKHS can be viewed as a ball under a metric that is similar to the Wasserstein metric. The DRO is then dualized and solved via a finite dimensional convex program. The proposed CKDRO approach is applied to a generation scheduling problem and shows that the result of CKDRO is superior to common benchmarks in terms of quality and robustness.

Chen, Yuxiao↗
DOE OSTI2022

A Framework for Neural Network Inference on FPGA-Centric SmartNICs

FPGA-based SmartNICs offer great potential to significantly improve the performance of high-performance computing and warehouse data processing by tightly coupling support for reconfigurable data-intensive computation with cross-node communication, thereby mitigating the von Neumann bottleneck. Existing work, however, has been generally been limited in that it assumes an accelerator model where kernels are offloaded to SmartNICs, but most control tasks are left to the CPUs. This leads to frequent waiting, inferior performance, and scaling challenges. In this work, we propose a new distributive data-centric computing framework, named FCsN, for reconfigurable SmartNIC-based systems. Through a lightweight task circulation execution model and its implementation architecture, FCsN allows the complete detaching of kernel execution, control logic, system scheduling, and network communication to the SmarNICs. This boosts performance by: (i) avoiding the control dependency with CPUs and (ii) supporting streaming kernel execution and network communication at line rate and in a very fine-grained manner. We demonstrate the efficiency and flexibility of FCsN using various types of neural network applications including graph neural networks; as these last are both irregular and data intensive they offer an especially robust demonstration. Evaluations using commonly-used neural network models and graph datasets show that a system with the support of FCsN can achieve, on average, 144 speedups over the MPI-based standard CPU baselines.

Guo, Anqi↗
DOE OSTI2021

Tensorized Feature Spaces for Feature Explosion

In this paper 1 1 This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-000R22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan) This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-000R22725., we present a novel framework that uses tensor factorization to generate richer feature spaces for pixel classification in hyperspectral images. In particular, we assess the performance of different tensor rank decomposition methods as compared to the traditional kernel-based approaches for the hyperspectral image classification problem. We propose Orion, which takes as input a hyperspectral image tensor and a rank and outputs an enhanced feature space from the factor matrices of the decomposed tensor. Our method is a feature explosion technique that inherently maps low dimensional input space in $\mathbb{R}^{K}$ to high dimensional space in $\mathbb{R}^{R}$ , where $R\gg K$ , say in the order of 1000x, like a kernel. We show how the proposed method exploits the multi-linear structure of hyperspectral three dimensional tensor. We demonstrate the effectiveness of our method with experiments on three publicly available hyperspectral datasets with labeled pixels and compare their classification performance against traditional linear and non-linear supervised learning methods such as SVM with Linear, Polynomial, RBF kernels, and the Multi-Layer Perceptron model. Finally, we explore the relationship between the rank of the tensor decomposition and the classification accuracy using several hyperspectral datasets with ground truth.

Pasricha, Ravdeep Singh↗
DOE OSTI2021

A High Performance Sparse Tensor Algebra Compiler in MLIR

Sparse tensor algebra is widely used in many applications, including scientific computing, machine learning, and data analytics. The performance of sparse tensor algebra kernels strongly depends on the intrinsic characteristics of the input tensors, hence many storage formats are designed for tensors to achieve optimal performance for particular applications/architectures, which makes it challenging to implement and optimize every tensor operation of interest on a given architecture. We propose a tensor algebra domain-specific language (DSL) and compiler framework to automatically generate kernels for mixed sparse-dense tensor algebra operations. The proposed DSL provides high-level programming abstractions that resemble the familiar Einstein notation to represent tensor algebra operations. The compiler introduces a new Sparse Tensor Algebra dialect built on top of LLVM's extensible MLIR compiler infrastructure for efficient code generation while covering a wide range of tensor storage formats. Our compiler also leverages input-dependent code optimization to enhance data locality for better performance. Our results show that the performance of automatically generated kernels outperforms the state-of-the-art sparse tensor algebra compiler, with up to 20.92x, 6.39x, and 13.9x performance improvement over state-of-the-art tensor algebra compilers, for parallel SpMV, SpMM, and TTM, respectively.

Tian, Ruiqin↗
DOE OSTI2024

Radiological Source Term Estimation and Isotopic Identification with Parallel Log Domain Particle Filters

This paper presents a parallel log-domain particle filtering algorithm combined with gamma spectrum unfolding to perform localization, identification, and evaluation of multiple point sources of various isotopes in an environment with attenuating obstacles. The method uses sets of precomputed attenuation kernels that map the attenuation characteristics of the environment. These kernels are specific to the energy level of a photopeak of interest. The spectral measurements are deconvolved into count measurements of each photopeak. These count measurements are fed into a set of parallel particle filters using attenuation kernels computed for that photopeak’s energy level. The individual regularized particle filters perform all likelihood calculations in the logarithmic domain to mitigate the effects of particle degeneracy. The output of each particle filter is combined to estimate which isotopes are present as well as their positions and strengths. The performance of the algorithm is characterized in a lab-scale environment using a mobile robot equipped with a gamma ray spectrometer in the presence of up to three different radioactive isotopes simultaneously. The sources were localized to within 10 cm, and their strengths were estimated within 10% of their true values. Furthermore, the isotopes were all correctly identified, and no spurious sources were reported.

42 ENGINEERING↗