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 343 records · Page 19

Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies

This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage–power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50 % reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50–250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75 % of N-2 contingency network structures, even without historical N-2 outage data. Furthermore, the proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Computing black hole partition functions from quasinormal modes

We propose a method of computing one-loop determinants in black hole space-times (with emphasis on asymptotically anti-de Sitter black holes) that may be used for numerics when completely-analytic results are unattainable. The method utilizes the expression for one-loop determinants in terms of quasinormal frequencies determined by Denef, Hartnoll and Sachdev in [1]. A numerical evaluation must face the fact that the sum over the quasinormal modes, indexed by momentum and overtone numbers, is divergent. A necessary ingredient is then a regularization scheme to handle the divergent contributions of individual fixed-momentum sectors to the partition function. To this end, we formulate an effective two-dimensional problem in which a natural refinement of standard heat kernel techniques can be used to account for contributions to the partition function at fixed momentum. We test our method in a concrete case by reproducing the scalar one-loop determinant in the BTZ black hole background. Furthermore, we then discuss the application of such techniques to more complicated spacetimes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Raman spectroscopy of uranium nitride kernels

Uranium nitride is an advanced fuel candidate for a wide variety of advanced nuclear reactors. This work summarizes the first characterization of UN kernels by Raman spectroscopy. First-principles density functional theory calculations were performed to predict the Raman spectra of uranium sesquinitride (U 2 N 3 ), uranium dinitride (UN 2 ), uranium mononitride (UN), uranium monocarbide (UC), as well as U-N-C (UN 1-x C x ) and a U-N-C-O mixture. Further, a core–shell structure was identified by scanning electron microscopy and Raman spectroscopy imaging. A signal at ~500 cm -1 was identified on the periphery of the core-shell structure, possibly corresponding to U 2 N 3 and/or UN 2 . This signal broadens and shifts to 470 cm -1 because of the formation of UNC, UNCO or U 2 N 3+x structures. The culmination of this work demonstrates the feasibility of using Raman spectroscopy to identify variations in composition and phases in UN kernels.

36 MATERIALS SCIENCE↗

Viscoelasticity and plasticity mechanisms of human dentin

Theoretical models of viscoelastic behavior and plastic deformation mechanisms of human dentin are considered. Using the linear viscoelasticity theory in which creep and relaxation kernels have the form of fraction-exponential functions, numerical values of instantaneous and long-time Young’s moduli and other characteristics of dentin viscoelasticity under uniaxial compression are found. As dentin plastic deformation mechanisms, mutual collagen fiber sliding in the region of contact of their side surfaces, separation of these fibers from each other, and irreversible tension of some collagen fibers, are proposed. It is shown that the second mechanism activation requires a smaller stress than that for activating others. The models of plastic zones at the mode I crack tip, which correspond to these mechanisms, are studied. It is shown that the plastic zone size can increase from a few hundreds of nanometers to hundreds of micrometers with increasing applied stress.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On the eigenvector bias of Fourier feature networks: From regression to solving multi-scale PDEs with physics-informed neural networks

Physics-informed neural networks (PINNs) are demonstrating remarkable promise in integrating physical models with gappy and noisy observational data, but they still struggle in cases where the target functions to be approximated exhibit high-frequency or multi-scale features. Here in this work we investigate this limitation through the lens of Neural Tangent Kernel (NTK) theory and elucidate how PINNs are biased towards learning functions along the dominant eigen-directions of their limiting NTK. Using this observation, we construct novel architectures that employ spatio-temporal and multi-scale random Fourier features, and justify how such coordinate embedding layers can lead to robust and accurate PINN models. Numerical examples are presented for several challenging cases where conventional PINN models fail, including wave propagation and reaction–diffusion dynamics, illustrating how the proposed methods can be used to effectively tackle both forward and inverse problems involving partial differential equations with multi-scale behavior.

42 ENGINEERING↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NAIF Toolkit - Extended

The Navigation Ancillary Infor ma tion Facility (NAIF) at JPL, acting under the direction of NASA s Office of Space Science, has built a data system named SPICE (Spacecraft Planet Instrument Cmatrix Events) to assist scientists in planning and interpreting scientific observations (see figure). SPICE provides geometric and some other ancillary information needed to recover the full value of science instrument data, including correlation of individual instrument data sets with data from other instruments on the same or other spacecraft. This data system is used to produce space mission observation geometry data sets known as SPICE kernels. It is also used to read SPICE kernels and to compute derived quantities such as positions, orientations, lighting angles, etc. The SPICE toolkit consists of a subroutine/ function library, executable programs (both large applications and simple utilities that focus on kernel management), and simple examples of using SPICE toolkit subroutines. This software is very accurate, thoroughly tested, and portable to all computers. It is extremely stable and reusable on all missions. Since the previous version, three significant capabilities have been added: Interactive Data Language (IDL) interface, MATLAB interface, and a geometric event finder subsystem.

Acton, Charles H., Jr.↗

Asymptotically Compatible Reproducing Kernel Collocation and Meshfree Integration for Nonlocal Diffusion

Reproducing kernel (RK) approximations are meshfree methods that construct shape functions from sets of scattered data. We present an asymptotically compatible (AC) RK collocation method for nonlocal diffusion models with Dirichlet boundary condition. The numerical scheme is shown to be convergent to both nonlocal diffusion and its corresponding local limit as nonlocal interaction vanishes. The analysis is carried out on a special family of rectilinear Cartesian grids for a linear RK method with designed kernel support. The key idea for the stability of the RK collocation scheme is to compare the collocation scheme with the standard Galerkin scheme, which is stable. In addition, assembling the stiffness matrix of the nonlocal problem requires costly computational resources because high-order Gaussian quadrature is necessary to evaluate the integral. We thus provide a remedy to the problem by introducing a quasi-discrete nonlocal diffusion operator for which no numerical quadrature is further needed after applying the RK collocation scheme. The quasi-discrete nonlocal diffusion operator combined with RK collocation is shown to be convergent to the correct local diffusion problem by taking the limits of nonlocal interaction and spatial resolution simultaneously. The theoretical results are then validated with numerical experiments. We additionally illustrate a connection between the proposed technique and an existing optimization based approach based on generalized moving least squares.

97 MATHEMATICS AND COMPUTING↗

Adiabatic-connection fluctuation-dissipation DFT for the structural properties of solids—The renormalized ALDA and electron gas kernels

We present calculations of the correlation energies of crystalline solids and isolated systems within the adiabatic-connection fluctuation-dissipation formulation of density-functional theory. We perform a quantitative comparison of a set of model exchange-correlation kernels originally derived for the homogeneous electron gas (HEG), including the recently introduced renormalized adiabatic local-density approximation (rALDA) and also kernels which (a) satisfy known exact limits of the HEG, (b) carry a frequency dependence, or (c) display a 1/k{sup 2} divergence for small wavevectors. After generalizing the kernels to inhomogeneous systems through a reciprocal-space averaging procedure, we calculate the lattice constants and bulk moduli of a test set of 10 solids consisting of tetrahedrally bonded semiconductors (C, Si, SiC), ionic compounds (MgO, LiCl, LiF), and metals (Al, Na, Cu, Pd). We also consider the atomization energy of the H{sub 2} molecule. We compare the results calculated with different kernels to those obtained from the random-phase approximation (RPA) and to experimental measurements. We demonstrate that the model kernels correct the RPA’s tendency to overestimate the magnitude of the correlation energy whilst maintaining a high-accuracy description of structural properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Cache Locality Optimization for Recursive Programs

We present an approach to optimize the cache locality for recursive programs by dynamically splicing--recursively interleaving--the execution of distinct function invocations. By utilizing data effect annotations, we identify concurrency and data reuse opportunities across function invocations and interleave them to reduce reuse distance. We present algorithms that efficiently track effects in recursive programs, detect interference and dependencies, and interleave execution of function invocations using user-level (non-kernel) lightweight threads. To enable multi-core execution, a program is parallelized using a nested fork/join programming model. Our cache optimization strategy is designed to work in the context of a random work stealing scheduler. We present an implementation using the MIT Cilk framework that demonstrates significant improvements in sequential and parallel performance, competitive with a state-of-the-art compile-time optimizer for loop programs and a domain- specific optimizer for stencil programs.

Lifflander, Jonathan↗

pnnl/projection_ntk

This is a repository for work conducted in our research paper we would like to make open source. The main features are that we forked another open source library and added functionality that enabled us to compute neural-kernel objects using random vector projection software for both computer vision and large language text models. The new features are specifically code that enables the calculation of objects we define and refer to as the projection pseudo neural tangent kernel and the projection trace neural tangent kernel; both of which are approximations of the empirical neural tangent kernel. The software that computes the projections themselves are not part of the invention, but are necessarily tied to our software and licensed via MIT license, and BSD 2 license.

Georgiev, Kristian↗

Developing the User Experience for a Next Generation Nuclear Fuel Cycle Simulator (NGFCS)

This project made substantial progress on its original aim for providing a modern user experience for nuclear fuel cycle analysis while also creating a robust and functional next- generation fuel cycle simulator. The Cyclus kernel experienced a dramatic clari cation of its interfaces and data model, becoming a full- edged agent-based framework, with strong support for third party developers of novel archetypes. The most important contribution of this project to the the development of Cyclus was the introduction of tools to facilitate archetype development. These include automated code generation of routine archetype components, metadata annotations to provide re ection and rich description of each data member's purpose, and mechanisms for input validation and output of complex data. A comprehensive social science investigation of decision makers' interests in nuclear fuel cycles, and speci cally their interests in nuclear fuel cycle simulators (NFCSs) as tools for understanding nuclear fuel cycle options, was conducted. This included document review and analysis, stakeholder interviews, and a survey of decision makers. This information was used to study the role of visualization formats and features in communicating information about nuclear fuel cycles. A exible and user-friendly tool was developed for building Cyclus analysis models, featuring a drag-and-drop interface and automatic input form generation for novel archetypes. Cycic allows users to design fuel cycles from arbitrary collections of facilities for the rst time, with mechanisms that contribute to consistency within that fuel cycle. Interacting with some of the metadata capabilities introduced in the above-mentioned tools to support archetype development, Cycic also automates the generation of user input forms for novel archetypes with little to no special knowledge required by the archetype developers. Translation of the fundamental metrics of Cyclus into more interesting quantities is accomplished in the Cymetric python package. This package is speci cally designed to support the introduction of new metrics by building upon existing metrics. This concept allows for multiple dependencies and encourages building complex metrics out of incremental transformations to those prior metrics. New archetype developers can contribute their own archetype-speci c metric using the same capability. A simple demonstration of this capability focused on generating time-dependent cash ows for reactor deployment that could then be analyzed in di erent ways. Cyclist, a dedicated application for exploration of Cyclus results, was developed. It's primary capabilities at this stage are best-suited to experienced fuel cycle analysts, but it provides a basic platform for simpler visualizations for other audiences. An important part of its interface is the ability to uidly examine di erent slices of what is fundamentally a ve-dimensional sparse data set. A drag-and-drop interface simpli es the process of selecting which data is displayed in the plot as well as which dimensions are being used for

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On the large eddy simulation of turbulent flows in complex geometry

Application of the method of Large Eddy Simulation (LES) to a turbulent flow consists of three separate steps. First, a filtering operation is performed on the Navier-Stokes equations to remove the small spatial scales. The resulting equations that describe the space time evolution of the 'large eddies' contain the subgrid-scale (sgs) stress tensor that describes the effect of the unresolved small scales on the resolved scales. The second step is the replacement of the sgs stress tensor by some expression involving the large scales - this is the problem of 'subgrid-scale modeling'. The final step is the numerical simulation of the resulting 'closed' equations for the large scale fields on a grid small enough to resolve the smallest of the large eddies, but still much larger than the fine scale structures at the Kolmogorov length. In dividing a turbulent flow field into 'large' and 'small' eddies, one presumes that a cut-off length delta can be sensibly chosen such that all fluctuations on a scale larger than delta are 'large eddies' and the remainder constitute the 'small scale' fluctuations. Typically, delta would be a length scale characterizing the smallest structures of interest in the flow. In an inhomogeneous flow, the 'sensible choice' for delta may vary significantly over the flow domain. For example, in a wall bounded turbulent flow, most statistical averages of interest vary much more rapidly with position near the wall than far away from it. Further, there are dynamically important organized structures near the wall on a scale much smaller than the boundary layer thickness. Therefore, the minimum size of eddies that need to be resolved is smaller near the wall. In general, for the LES of inhomogeneous flows, the width of the filtering kernel delta must be considered to be a function of position. If a filtering operation with a nonuniform filter width is performed on the Navier-Stokes equations, one does not in general get the standard large eddy equations. The complication is caused by the fact that a filtering operation with a nonuniform filter width in general does not commute with the operation of differentiation. This is one of the issues that we have looked at in detail as it is basic to any attempt at applying LES to complex geometry flows. Our principal findings are summarized.

Ghosal, Sandip↗

Steady-State and Transient Boundary Element Methods for Coupled Heat Conduction

Boundary element algorithms for the solution of steady-state and transient heat conduction are presented. The algorithms are designed for efficient coupling with computational fluid dynamic discretizations and feature piecewise linear elements with offset nodal points. The steady-state algorithm employs the fundamental solution approach; the integration kernels are computed analytically based on linear shape functions, linear elements, and variably offset nodal points. The analytic expressions for both singular and nonsingular integrands are presented. The transient algorithm employs the transient fundamental solution; the temporal integration is performed analytically and the nonsingular spatial integration is performed numerically using Gaussian quadrature. A series solution to the integration is derived for the instance of a singular integrand. The boundary-only character of the algorithm is maintained by integrating the influence coefficients from initial time. Numerical results are compared to analytical solutions to verify the current boundary element algorithms. The steady-state and transient algorithms are numerically shown to be second-order accurate in space and time, respectively.

Kontinos, Dean A.↗

Visualizing Flow Over Parametric Surfaces Using Line Integral Convolution

Line Integral Convolution (LIC) is a powerful technique for imaging and animating vector fields. We extend the LIC paradigm in three ways: (1) The existing technique is limited to vector fields over a regular Cartesian grid. We extend it to vector fields over parametric surfaces, such as those found in curvilinear grids, used in computational fluid dynamics simulations; (2) Periodic motion filters can be used to animate the flow visualization. When the flow lies on a parametric surface, however, the motion appears misleading. We explain why this problem arises and show how to adjust the LIC algorithm to handle it; (3) We introduce a technique to visualize vector magnitudes as well as vector direction. Cabral and Leedom have suggested a method for variable-speed animation, which is based on varying the frequency of the filter function. We develop a different technique based on kernel phase shifts which we have found to show substantially better results. Our implementation of these algorithms utilizes texture-mapping hardware to run in real time, which allows them to be included in interactive applications.

Forssell, Lisa↗

Uncertainty Estimates for Sonic-Boom Pressure Signatures and Loudness Carpets

A non-intrusive uncertainty quantification method is applied to computational analysis of supersonic, low-boom aircraft. The mean and standard deviation statistics of the pressure waveforms and loudness metrics are evaluated through use of numerical quadrature. The probability density function (p.d.f.) of these outputs is evaluated via kernel density estimation. The simulations use an inviscid, embedded-boundary Cartesian-mesh flow solver in the nearfield combined with an augmented Burgers’ equation solver for propagation in the farfield. The results show that the p.d.f. of the waveform is bimodal at shocks, which makes the mean and standard deviation statistics inappropriate. Despite this limitation, we show that the moment statistics can provide effective assessment of discrepancies when comparing with experimental data. This is demonstrated by presenting uncertainty analysis of a wind-tunnel test and showing that we significantly improve the predictions when we include the test uncertainties in the simulation. Normal distributions are obtained for the ground signature and loudness metrics, which is primarily due to the careful shaping of the low-boom waveform. Separation of variables and error control are used to reduce computational cost. We demonstrate that this is an efficient approach in the sense of balancing numerical errors in the statistics quadrature with discretization errors in the solvers.

ARMD↗

Kernel learning backward SDE filter for data assimilation

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

97 MATHEMATICS AND COMPUTING↗

Finite-frequency Sensitivity Kernels in Spherical Geometry for Time–Distance Helioseismology

The inference of internal properties of the Sun from surface measurements of wave travel times is the goal of time–distance helioseismology. A critical step toward the accurate interpretation of shifts in travel time is the computation of sensitivity functions linking seismic measurements to internal structure. Here we calculate finite-frequency sensitivity kernels in spherical geometry for two-point measurements of travel time. We numerically build Green’s function by solving for it at each frequency and each degree of spherical harmonic and summing over all these pieces. These computations are performed in parallel (“embarrassingly”), thereby achieving significant speedup in wall-clock time. Kernels are calculated by invoking the first-order Born approximation connecting deviations in the wave field to perturbations in the operator. Validated flow kernels are shown to produce travel times within 0.47% of the true value for uniform flows up to 750 m s{sup −1}. We find that travel time can be obtained with errors of 1 ms or less for flows having magnitudes similar to meridional circulation. Alongside flows, we also compute and validate a sensitivity kernel for perturbations in sound speed. These accurate sensitivity kernels might improve the current inferences of subsurface flows significantly.

79 ASTRONOMY AND ASTROPHYSICS↗