Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel function”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Electronic π-to-π* Excitations of Rhodamine Dyes Exhibit a Time-Dependent Kohn-Sham Theory “Cyanine Problem”

The longest-wavelength π-to-π* electronic excitations of rhodamine-like dyes (RDs) with different group16 heteroatoms (O, S, Se, Te) have been investigated. Time-dependent Kohn–Sham theory (TDKST) calculations were compared with coupled-cluster (CC) and equations-of-motion (EOM) CC results for π-to-π* singlet and triplet excitations. The RDs exhibit characteristics in the TDKST calculations that are very similar to previously investigated cyanine dyes, in the sense that the singlet energies obtained with nonhybrid functionals are too high compared with the CC results at the SD(T) level. The errors became increasingly larger for functionals with increasing amounts of exact exchange. TDKST with all tested functionals led to severe underestimations of the corresponding triplet excitations and overestimations of the singlet--triplet gaps. Long-range-corrected range-separated exchange and "optimal tuning" of the range separation parameter did not significantly improve the TDKST results. A detailed analysis suggests that the problem is differential electron correlation between the ground and excited states, which is not treated sufficiently by the relatively small integrals over the exchange-correlation response kernel that enters the excitation energy expression. As a result, numerical criteria are suggested that may help identify "cyanine-like" problems in TDKST calculations of excitation spectra.

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

GP Cosmology Surrogate v1.0

GP Cosmology Surrogate is a Python library for building and training a generalized multi-output Gaussian process (GP) framework of @takhtaganov2021cosmic. In this approach, the surrogate is constructed sequentially, guided by a Bayesian optimization acquisition function that targets reduction of emulation error in the regions most consistent with the observational data. This adaptive design concentrates computational resources where they have the greatest impact on inference accuracy. The library supports efficient training for separable GP kernels, which allows the use of Kronecker algebra to handle high-dimensional input spaces and large numbers of correlated outputs. This makes it well suited for applications such as modeling cosmological power spectra, large-scale physical simulations, and multi-output hyperparameter tuning. By combining scalable multi-output GP modeling with data-driven adaptive sampling, GPsurrogate enables parameter inference and optimization with substantially fewer simulations than conventional space-filling designs.

Lukic, Zarija [Lawrence Berkeley National Laborato↗
DOE OSTI2025

Tomography of the rho meson in the QCD instanton vacuum: Transverse momentum dependent parton distribution functions

We analyze the rho meson unpolarized and polarized transverse momentum dependent parton distribution functions (TMDPDFs) in the instanton liquid model (ILM). The corresponding TMDs in ILM are approximated by a constituent quark beam function in the leading Fock state multiplied by a rapidity-dependent factor resulting from the staple-shaped Wilson lines, for fixed longitudinal momentum, transverse separation, and rapidity. At the resolution of the ILM, all of the rho meson TMDs are symmetric in parton 𝑥 for fixed transverse momentum, and Gaussian-like in the transverse momentum for fixed parton 𝑥. The latter is a direct consequence of the profiling of the quark zero modes in the ILM. The evolved TMDs at higher rapidity using the Collins-Soper kernel, and higher resolution using the renormalization group, show substantial skewness towards low parton 𝑥.

Gluons↗
DOE OSTI2022

Data Driven Optimization Framework for Volt-age Regulation in Distribution Systems

This letter proposes a data-driven optimization framework for voltage regulation problems to address the challenge of model inaccuracy and parameter varying. To achieve online voltage optimization, the recursive kernel regression and interior point methods are integrated. The IEEE 123-Bus system and EPRI Ckt5 feeder are selected to validate the effectiveness of the proposed data-driven optimization framework. The proposed method is also compared with a linear function based method.

Hong, Tianqi↗
DOE OSTI2018

Exploring the Brighter-fatter Effect with the Hyper Suprime-Cam

The brighter-fatter effect has been postulated to arise due to the build up of a transverse electric field, produced as photocharges accumulate in the pixels’ potential wells. We investigate the brighter-fatter effect in the Hyper Suprime-Cam by examining flat fields and moments of stars. We observe deviations from the expected linear relation in the photon transfer curve (PTC), luminosity-dependent correlations between pixels in flat-field images, and a luminosity-dependent point-spread function (PSF) in stellar observations. Under the key assumptions of translation invariance and Maxwell’s equations in the quasi-static limit, we give a first-principles proof that the effect can be parameterized by a translationally invariant scalar kernel. We describe how this kernel can be estimated from flat fields and discuss how this kernel has been used to remove the brighter-fatter distortions in Hyper Suprime-Cam images. We find that our correction restores the expected linear relation in the PTCs and significantly reduces, but does not completely remove, the luminosity dependence of the PSF over a wide range of magnitudes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Prediction of bacterial E3 ubiquitin ligase effectors using reduced amino acid peptide fingerprinting

Background Although pathogenic Gram-negative bacteria lack their own ubiquitination machinery, they have evolved or acquired virulence effectors that can manipulate the host ubiquitination process through structural and/or functional mimicry of host machinery. Many such effectors have been identified in a wide variety of bacterial pathogens that share little sequence similarity amongst themselves or with eukaryotic ubiquitin E3 ligases. Methods To allow identification of novel bacterial E3 ubiquitin ligase effectors from protein sequences we have developed a machine learning approach, the SVM-based Identification and Evaluation of Virulence Effector Ubiquitin ligases (SIEVE-Ub). We extend the string kernel approach used previously to sequence classification by introducing reduced amino acid (RED) alphabet encoding for protein sequences. Results We found that 14mer peptides with amino acids represented as simply either hydrophobic or hydrophilic provided the best models for discrimination of E3 ligases from other effector proteins with a receiver-operator characteristic area under the curve (AUC) of 0.90. When considering a subset of E3 ubiquitin ligase effectors that do not fall into known sequence based families we found that the AUC was 0.82, demonstrating the effectiveness of our method at identifying novel functional family members. Feature selection was used to identify a parsimonious set of 10 RED peptides that provided good discrimination, and these peptides were found to be located in functionally important regions of the proteins involved in E2 and host target protein binding. Our general approach enables construction of models based on other effector functions. We used SIEVE-Ub to predict nine potential novel E3 ligases from a large set of bacterial genomes. SIEVE-Ub is available for download at https://doi.org/10.6084/m9.figshare.7766984.v1 or https://github.com/biodataganache/SIEVE-Ub for the most current version.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Petascale Orbital-Free Density Functional Theory Enabled by Small-Box Algorithms

Orbital-free density functional theory (OFDFT) is a quantum-mechanics-based method that utilizes electron density as its sole variable. The main computational cost in OFDFT is the ubiquitous use of the fast Fourier transform (FFT), which is mainly adopted to evaluate the kinetic energy density functional (KEDF) and electron–electron Coulomb interaction terms. We design and implement a small-box FFT (SBFFT) algorithm to overcome the parallelization limitations of conventional FFT algorithms. We also propose real-space truncation of the nonlocal Wang–Teter KEDF kernel. The scalability of the SBFFT is demonstrated by efficiently simulating one full optimization step (electron density, energies, forces, and stresses) of 1,024,000 lithium (Li) atoms on up to 65,536 cores. We perform other tests using Li as a test material, including calculations of physical properties of different phases of bulk Li, geometry optimizations of nanocrystalline Li, and molecular dynamics simulations of liquid Li. All of the tests yield excellent agreement with the original OFDFT results, suggesting that the OFDFT-SBFFT algorithm opens the door to efficient first-principles simulations of materials containing millions of atoms.

Chemistry↗
DOE OSTI2024

Advances in statistical methods for cancer surveillance research: an age-period-cohort perspective

Background: Analysis of Lexis diagrams (population-based cancer incidence and mortality rates indexed by age group and calendar period) requires specialized statistical methods. However, existing methods have limitations that can now be overcome using new approaches. Methods: We assembled a “toolbox” of novel methods to identify trends and patterns by age group, calendar period, and birth cohort. We evaluated operating characteristics across 152 cancer incidence Lexis diagrams compiled from United States (US) Surveillance, Epidemiology and End Results Program data for 21 leading cancers in men and women in four race and ethnicity groups (the “cancer incidence panel”). Results: Nonparametric singular values adaptive kernel filtration (SIFT) decreased the estimated root mean squared error by 90% across the cancer incidence panel. A novel method for semi-parametric age-period-cohort analysis (SAGE) provided optimally smoothed estimates of age-period-cohort (APC) estimable functions and stabilized estimates of lack-of-fit (LOF). SAGE identified statistically significant birth cohort effects across the entire cancer panel; LOF had little impact. As illustrated for colon cancer, newly developed methods for comparative age-period-cohort analysis can elucidate cancer heterogeneity that would otherwise be difficult or impossible to discern using standard methods. Conclusions: Cancer surveillance researchers can now identify fine-scale temporal signals with unprecedented accuracy and elucidate cancer heterogeneity with unprecedented specificity. Birth cohort effects are ubiquitous modulators of cancer incidence in the US. The novel methods described here can advance cancer surveillance research.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Algorithm and Architecture Independent Benchmarking with SEAK

Many applications of high performance embedded computing are limited by performance or power bottlenecks. We have designed the Suite for Embedded Applications & Kernels (SEAK), a new benchmark suite, (a) to capture these bottlenecks in a way that encourages creative solutions; and (b) to facilitate rigorous, objective, end-user evaluation for their solutions. To avoid biasing solutions toward existing algorithms, SEAK benchmarks use a mission-centric (abstracted from a particular algorithm) and goal-oriented (functional) specification. To encourage solutions that are any combination of software or hardware, we use an end-user black-box evaluation that can capture tradeoffs between performance, power, accuracy, size, and weight. The tradeoffs are especially informative for procurement decisions. We call our benchmarks future proof because each mission-centric interface and evaluation remains useful despite shifting algorithmic preferences. It is challenging to create both concise and precise goal-oriented specifications for mission-centric problems. This paper describes the SEAK benchmark suite and presents an evaluation of sample solutions that highlights power and performance tradeoffs.

algorithms and kernels↗
DOE OSTI2024

Shock Hugoniot calculations using on-the-fly machine learned force fields with ab initio accuracy

We present a framework for computing the shock Hugoniot using on-the-fly machine learned force field (MLFF) molecular dynamics simulations. In particular, we employ an MLFF model based on the kernel method and Bayesian linear regression to compute the free energy, atomic forces, and pressure, in conjunction with a linear regression model between the internal and free energies to compute the internal energy, with all training data generated from Kohn–Sham density functional theory (DFT). We verify the accuracy of the formalism by comparing the Hugoniot for carbon with recent Kohn–Sham DFT results in the literature. In so doing, we demonstrate that Kohn–Sham calculations for the Hugoniot can be accelerated by up to two orders of magnitude, while retaining ab initio accuracy. We apply this framework to calculate the Hugoniots of 14 materials in the FPEOS database, comprising 9 single elements and 5 compounds, between temperatures of 10 kK and 2 MK. We find good agreement with first principles results in the literature while providing tighter error bars. In addition, we confirm that the inter-element interaction in compounds decreases with temperature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Three-body scattering: ladders and resonances

We report on unitarity constraints on the dynamics of a system of three interacting particles. We reveal how the short-range interaction that describes three-body resonances can be separated from the long-range exchange processes, in particular the one-pion-exchange process. It is demonstrated that unitarity demands a specific functional form of the amplitude with a clear interpretation: the bare three-particle resonances are dressed by the initial- and final-state interaction, in a way that is consistent with the considered long-range forces. We postulate that the resonance kernel admits a factorization in the energy variables of the initial- and the final-state particles. The factorization assumption leads to an algebraic form for the unitarity equations, which is reminiscent of the well-known two-body-unitarity condition and approaches it in the limit of the narrow-resonance approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Sharp front tracking with geometric interface reconstruction

Here, this paper presents a novel sharp front-tracking method designed to address limitations in classical front-tracking approaches, specifically their reliance on smooth interpolation kernels and extended stencils for coupling the front and fluid mesh. In contrast, the proposed method employs exclusively sharp, localized interpolation and spreading kernels, restricting the coupling to the interfacial fluid cells–those containing the interface/front. This localized coupling is achieved by integrating a divergence-preserving velocity interpolation method with a piecewise parabolic interface calculation (PPIC) and a polyhedron intersection algorithm to compute the indicator function and local interface curvature. Surface tension is computed using the Continuum Surface Force (CSF) method, maintaining consistency with the sharp representation. Additionally, we propose an efficient local roughness smoothing implementation to account for surface mesh undulations, which is easily applicable to any triangulated surface mesh. Building on our previous work, the primary innovation of this study lies in the localization of the coupling for both the indicator function and surface tension calculations. By reducing the interface thickness on the fluid mesh to a single cell, as opposed to the 4–5 cell spans typical in classical methods, the proposed sharp front-tracking method achieves a highly localized and accurate representation of the interface. This sharper representation mitigates parasitic currents and improves force balancing, making it particularly suitable for scenarios where the interface plays a critical role, such as microfluidics, fluid-fluid interactions, and fluid-structure interactions. The proposed method is comprehensively validated and tested on canonical interfacial flow problems, including stationary and translating Laplace equilibria, oscillating droplets, and rising bubbles. The presented results demonstrate that the sharp front-tracking method significantly outperforms the classical approach in terms of accuracy, stability, and computational efficiency. Notably, parasitic currents are reduced by approximately two orders of magnitude and stable results are obtained for parameter ranges where classical front tracking fails to converge.

42 ENGINEERING↗
DOE OSTI2019

Exploring the Random Phase Approximation for Materials and Chemical Physics

In this work we test the performance of the fully nonlocal random phase approximation (RPA) for challenging problems in materials chemistry and physics. In this work we assessed the fully nonlocal random phase approximation (RPA) for the delicate energy differences of interest in materials chemistry and physics. The applications in this proposal are challenges for the simpler approximations of Kohn-Sham density functional theory, which are part of the current “standard model” for quantum chemistry and condensed matter physics. Direct RPA includes the full exact exchange energy and a nonlocal correlation energy from the occupied and unoccupied Kohn-Sham orbitals and orbital energies, with an approximate but universal description of long-range van der Waals attraction. RPA still cannot be a benchmark electronic structure method without a correction for its short-range correlation energy which is too deep. The short-range error of RPA can be corrected by a spatially nonlocal, exchange-only kernel. Such kernels could be a more reliable and “intrinsic” approximation to capture accurate ground-state energy differences than the expensive SOSEX and other beyond-RPA corrections. In this project we revealed the strengths and limitations of some model kernels through some materials problems focusing on structural phase transitions and transition metal chemistry. In addition we demonstrated the accuracy of the Renormalized RPA for total correlation energies of simple solids, and the pressure-induced phase transitions.

36 MATERIALS SCIENCE↗
DOE OSTI2026

A Discrete Hankel Transform Approach to Nuclear Data Processing for Fusion Applications

This study introduces advancements to the numerical solutions employed in the processing of nuclear data for fusion applications. It leverages the convolution theorem and Fourier transform techniques to enhance computational efficiency and broaden applicability. Building upon a previously reported discrete Hankel transform approach for Doppler broadening, this work refines the solution of convolution integrals central to these applications. The methodology provides a general and unified framework for evaluating any convolution operation, regardless of whether the underlying problem involves temperature effects in nuclear reactions. The applicability to the nuclear data processing for fusion is demonstrated by deriving the convolution integrals for some of the fusion-related quantities. As before, the convolution operation utilizes a Gaussian-based kernel; however, the discrete Hankel transform of order $𝛼$ = $\frac{1}{2}$ is now applied to the forward Fourier transform of the nonkernel argument, rather than the inverse Fourier transform. This modification eliminates the need for the integration of the nonkernel, cross section–based function, which is a step that posed challenges for certain pointwise cross-section representations. It also removes the requirement for cross-section linearization. Optimized for graphics processing unit architectures, the approach significantly improves computational performance. These advancements are currently under evaluation as the foundation for the next-generation thermonuclear data file processing codes being developed at Lawrence Livermore National Laboratory.

Nuclear science and engineering↗
DOE OSTI2019

mystic - a brief introduction

The mystic framework enables the solving of difficult optimization problems through three major innovations: (1) plug-and-play component-based optimization algorithms, (2) the ability to dynamically construct and apply generalzed trnasforms, K , where x' = K(x) , and (3) workflows providing asynchronous execution and statefulness. These features, in conjunction with supporting packages pathos , pyina , and klepto , can provide massively-parallel scalable workflows for quickly solving optimization problems in complex nonlinear spaces. mystic can be used to simplify non-convex optimization problems by transforming away nonlinearities through user-built kernel transforms. This tutorial demonstrates using mystic for machine learning with automated dimensional-reduction, using embarrasingly parallel solver ensembles to find an accurate interpolated surrogate for a nonlinear surface, and the determination of worst-case bounds on expectation value of an objective function under uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The Kokkos Ecosystem [Brief]

In 2016/2017, the field of High-Performance Computing (HPC) entered a new era driven by fundamental physics challenges to produce ever more energy and cost-efficient processors. Since the convergence on the Message-Passing Interface (MPI) standard in the mid-1990s, application developers enjoyed a seemingly static view of the underlying machine — that of a distributed collection of homogeneous nodes executing in collaboration. However, after almost two decades of dominance, the sole use of MPI to derive parallelism acted as a limiter to improved future performance. While MPI is widely expected to continue to function as the basic mechanism for communication between compute nodes for the immediate future, additional parallelism is required on the computing node itself if high performance and efficiency goals are to be realized. When reviewing the architectures of the top HPC systems today, the change in paradigm is clear: the compute nodes of the leading machines in the world are either powered by many-core chips with a few dozen cores each, or use heterogeneous designs, where traditional CPUs marshal work to massively parallel compute accelerators which has as many as 200,000 processing threads in flight simultaneously. Complicating matters further for application developers, each processor vendor has its own preferred way of writing code for their architecture.The Kokkos EcoSystem was released by Sandia in 2017 to address this new era in HPC system design by providing a vendor independent performance portable programming system for scientific, engineering, and mathematical software applications written in the C++ programming language. Using Kokkos, application developers can be more productive because they will not have to create and maintain separate versions of their software for each architecture, nor will they have to be experts in each architecture's peculiar requirements. Instead, they will have a single method of programming for the diverse set of modern HPC architectures. While Kokkos started in 2011 as a programming model only, it soon became clear that complex applications needed more. It is also critical to have a portable mathematical functions and developers need tools to debug their applications, gain insight into the performance characteristics of their codes and tune algorithm performance parameters through automated processes. The Kokkos EcoSystem addresses those needs through its three main components: the Kokkos Core programming model, the Kokkos Kernels math library, and the Kokkos Tools project.

97 MATHEMATICS AND COMPUTING↗