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.

SourceResearch connectionFrom yearThrough year

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

At least 469 records · Page 26

All sources NASA NTRS DOE OSTI

DOE OSTI2015

CONSTRUCTING A FLEXIBLE LIKELIHOOD FUNCTION FOR SPECTROSCOPIC INFERENCE

We present a modular, extensible likelihood framework for spectroscopic inference based on synthetic model spectra. The subtraction of an imperfect model from a continuously sampled spectrum introduces covariance between adjacent datapoints (pixels) into the residual spectrum. For the high signal-to-noise data with large spectral range that is commonly employed in stellar astrophysics, that covariant structure can lead to dramatically underestimated parameter uncertainties (and, in some cases, biases). We construct a likelihood function that accounts for the structure of the covariance matrix, utilizing the machinery of Gaussian process kernels. This framework specifically addresses the common problem of mismatches in model spectral line strengths (with respect to data) due to intrinsic model imperfections (e.g., in the atomic/molecular databases or opacity prescriptions) by developing a novel local covariance kernel formalism that identifies and self-consistently downweights pathological spectral line “outliers.” By fitting many spectra in a hierarchical manner, these local kernels provide a mechanism to learn about and build data-driven corrections to synthetic spectral libraries. An open-source software implementation of this approach is available at http://iancze.github.io/Starfish, including a sophisticated probabilistic scheme for spectral interpolation when using model libraries that are sparsely sampled in the stellar parameters. We demonstrate some salient features of the framework by fitting the high-resolution V-band spectrum of WASP-14, an F5 dwarf with a transiting exoplanet, and the moderate-resolution K-band spectrum of Gliese 51, an M5 field dwarf.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1975

On an integro-differential equation model for the study of the response of an acoustically coupled panel

The response of a clamped panel to supersonically convected turbulence is considered. A theoretical model in the form of an integro-differential equation is employed that takes into account the coupling between the panel motion and the surrounding acoustic medium. The kernels of the integrals, which represent induced pressures due to the panel motion, are Green's functions for sound radiations under various moving and stationary sources. An approximate analysis is made by following a finite-element Ritz-Galerkin procedure. Preliminary numerical results, in agreement with experimental findings, indicate that the acoustic damping is the controlling mechanism of the response.

Yen, D. H. Y.↗

NASA NTRS1999

Analysis of a Generally Oriented Crack in a Functionally Graded Strip Sandwiched Between Two Homogeneous Half Planes

The driving forces for a generally oriented crack embedded in a Functionally Graded strip sandwiched between two half planes are analyzed using singular integral equations with Cauchy kernels, and integrated using Lobatto-Chebyshev collocation. Mixed-mode Stress Intensity Factors (SIF) and Strain Energy Release Rates (SERR) are calculated. The Stress Intensity Factors are compared for accuracy with previously published results. Parametric studies are conducted for various nonhomogeneity ratios, crack lengths. crack orientation and thickness of the strip. It is shown that the SERR is more complete and should be used for crack propagation analysis.

Shbeeb, N.↗

NASA NTRS2013

Science Opportunity Analyzer (SOA) Version 8

SOA allows scientists to plan spacecraft observations. It facilitates the identification of geometrically interesting times in a spacecraft s orbit that a user can use to plan observations or instrument-driven spacecraft maneuvers. These observations can then be visualized multiple ways in both two- and three-dimensional views. When observations have been optimized within a spacecraft's flight rules, the resulting plans can be output for use by other JPL uplink tools. Now in its eighth major version, SOA improves on these capabilities in a modern and integrated fashion. SOA consists of five major functions: Opportunity Search, Visualization, Observation Design, Constraint Checking, and Data Output. Opportunity Search is a GUI-driven interface to existing search engines that can be used to identify times when a spacecraft is in a specific geometrical relationship with other bodies in the solar system. This function can be used for advanced mission planning as well as for making last-minute adjustments to mission sequences in response to trajectory modifications. Visualization is a key aspect of SOA. The user can view observation opportunities in either a 3D representation or as a 2D map projection. Observation Design allows the user to orient the spacecraft and visualize the projection of the instrument field of view for that orientation using the same views as Opportunity Search. Constraint Checking is provided to validate various geometrical and physical aspects of an observation design. The user has the ability to easily create custom rules or to use official project-generated flight rules. This capability may also allow scientists to easily assess the cost to science if flight rule changes occur. Data Output allows the user to compute ancillary data related to an observation or to a given position of the spacecraft along its trajectory. The data can be saved as a tab-delimited text file or viewed as a graph. SOA combines science planning functionality unique to both JPL and the sponsoring spacecraft. SOA is able to ingest JPL SPICE Kernels that are used to drive the tool and its computations. A Percy search engine is then included that identifies interesting time periods for the user to build observations. When observations are then built, flight-like orientation algorithms replicate spacecraft dynamics to closely simulate the flight spacecraft s dynamics. SOA v8 represents large steps forward from SOA v7 in terms of quality, reliability, maintainability, efficiency, and user experience. A tailored agile development environment has been built around SOA that provides automated unit testing, continuous build and integration, a consolidated Web-based code and documentation storage environment, modern Java enhancements, and a focus on usability

Witoff, Robert J.↗

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 OSTI2015

Infinitely many singular interactions on noncompact manifolds

We show that the ground state energy is bounded from below when there are infinitely many attractive delta function potentials placed in arbitrary locations, while all being separated at least by a minimum distance, on two dimensional non-compact manifold. To facilitate the reading of the paper, we first present the arguments in the setting of Cartan–Hadamard manifolds and then subsequently discuss the general case. For this purpose, we employ the heat kernel techniques as well as some comparison theorems of Riemannian geometry, thus generalizing the arguments in the flat case following the approach presented in Albeverio et al. (2004). - Highlights: • Schrödinger-operator for infinitely many singular interactions on noncompact manifolds. • Proof of the finiteness of the ground-state energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS2006

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↗

DOE OSTI2015

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires half of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Polymer coatings on zirconia microspheres via rotating flow fluid dynamics

Conventional tristructural isotropic (TRISO) coatings for nuclear fuels require multi-step and expensive formation processes; any breakage of the coatings may lead to fission species release. Polymer derived ceramic (PDC) coatings can be a suitable alternative to address these issues. In this study, allylhydridopolycarbosilane (SMP-10) coatings were created on yttria stabilized zirconia (YSZ) microspheres using a Rotating Flow Fluid Dynamics (RFFD) coating method. The effects of curing temperature, rotation speed, and coating cycle/time on the coating were analyzed. Surface functionalization of YSZ microspheres with NaOH resulted in good adhesion between the polymer precursor and the YSZ kernel particles. Spectroscopy analysis revealed complete curing of SMP-10 coated YSZ at 160 °C. Rotation speed and coating time significantly affect the coating characteristics. After 3 cycles at lower rotation speed (50 rpm) for 10 min each, the coating obtained was uniform and homogeneous. In comparison, the coating showed almost 10 times less eccentricity at a high rotation speed of 300 rpm. Compared with the coatings prepared at 300 rpm condition, the coatings have higher sphericity and lower eccentricity at 50 rpm. Overall, this study provides a novel and effective route for fabricating and curing SMP-10 precursor coatings on YSZ microspheres.

Ravi, Nivetha [University of Alabama, Birmingham]↗

DOE OSTI2020

Bilevel Parameter Optimization for Nonlocal Image Denoising Models

We propose a bilevel optimization approach for the determination of parameters in nonlocal image denoising. We consider both spatial weights in front of the fidelity term, as well as weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order optimization algorithm in combination with a finite element discretization of the nonlocal denoising models and a computational strategy for the solution of the resulting dense linear systems. Several experiments are run in order to show the suitability of our approach.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Bilevel parameter optimization for learning nonlocal image denoising models

We propose a bilevel optimization approach for the estimation of parameters in nonlocal image denoising models. The parameters we consider are both the space-dependent fidelity weight and weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order trust-region algorithm in combination with a finite element discretization of the nonlocal denoising models and we introduce a computational strategy for the solution of the resulting dense linear systems. Several experiments illustrate the applicability and effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

GPU acceleration of local and semilocal density functional calculations in the SPARC electronic structure code

We present a Graphics Processing Unit (GPU)-accelerated version of the real-space SPARC electronic structure code for performing Kohn–Sham density functional theory calculations within the local density and generalized gradient approximations. In particular, we develop a modular math-kernel based implementation for NVIDIA architectures wherein the computationally expensive operations are carried out on the GPUs, with the remainder of the workload retained on the central processing units (CPUs). Here, using representative bulk and slab examples, we show that relative to CPU-only execution, GPUs enable speedups of up to 6× and 60× in node and core hours, respectively, bringing time to solution down to less than 30 s for a metallic system with over 14 000 electrons and enabling significant reductions in computational resources required for a given wall time.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Kernel fusion in atomistic spin dynamics simulations on Nvidia GPUs using tensor core

In atomistic spin dynamics simulations, the time cost of constructing the space- and time-displaced pair correlation function in real space increases quadratically as the number of spins N, leading to significant computational effort. The GEMM subroutine can be adopted to accelerate the calculation of the dynamical spin-spin correlation function, but the computational cost of simulating large spin systems (>40000 spins) on CPUs remains expensive. In this work, we perform the simulation on the graphics processing unit (GPU), a hardware solution widely used as an accelerator for scientific computing and deep learning. Here we show that GPUs can accelerate the simulation up to 25-fold compared to multi-core CPUs when using the GEMM subroutine on both. To hide memory latency, we fuse the element-wise operation into the GEMM kernel using CUTLASS that can improve the performance by 26% ~ 33% compared to implementation based on cuBLAS. Furthermore, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which makes the large-scale atomistic spin dynamics simulation feasible and affordable.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

The effective number of parameters in kernel density estimation

We devise a new formula for measuring the effective degrees of freedom (EDoF) in kernel density estimation (KDE). Starting from the orthogonal polynomial sequence (OPS) expansion for the ratio of the empirical to the oracle density, we show how convolution with the kernel leads to a new OPS with respect to which one may express the resulting KDE. The expansion coefficients of the two OPS systems can then be related via a kernel sensitivity matrix, which leads to a natural oracle definition of EDoF through the trace operator. Asymptotic properties of the (empirical) plug-in EDoF are worked out through influence functions, and connections with other empirical EDoFs are established. Minimization of Kullback-Leibler divergence is investigated as an alternative to integrated squared error based bandwidth selection rules, yielding a new normal scale rule. The methodology, which arises from a proper oracle formulation and is not restricted to convolution kernels, suggests the possibility of a new bandwidth selection rule based on an information criterion such as AIC.

bandwidth selection↗

DOE OSTI2023

Kohn–Sham accuracy from orbital-free density functional theory via Δ-machine learning

Here, we present a Δ-machine learning model for obtaining Kohn–Sham accuracy from orbital-free density functional theory (DFT) calculations. In particular, we employ a machine-learned force field (MLFF) scheme based on the kernel method to capture the difference between Kohn–Sham and orbital-free DFT energies/forces. We implement this model in the context of on-the-fly molecular dynamics simulations and study its accuracy, performance, and sensitivity to parameters for representative systems. We find that the formalism not only improves the accuracy of Thomas–Fermi–von Weizsäcker orbital-free energies and forces by more than two orders of magnitude but is also more accurate than MLFFs based solely on Kohn–Sham DFT while being more efficient and less sensitive to model parameters. We apply the framework to study the structure of molten Al 0.88 Si 0.12 , the results suggesting no aggregation of Si atoms, in agreement with a previous Kohn–Sham study performed at an order of magnitude smaller length and time scales.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Helicity-dependent generalization of the JIMWLK evolution

We generalize the JIMWLK evolution equation to include the small-$x$ evolution of helicity distributions. To derive helicity JIMWLK, we use the method devised by A.H. Mueller in [Phys. Lett. B 523, 243 (2001)] for the usual unpolarized JIMWLK, and apply it to the helicity evolution equations derived in J. High Energy Phys. 01 (2016) 072; Phys. Rev. D 95, 014033 (2017); J. High Energy Phys. 10 (2017) 198; Phys. Rev. D 99, 054032 (2019)]. We obtain a functional evolution equation for the generalized JIMWLK weight functional. The functional now is a sum of a helicity-independent term and a helicity-dependent term. The kernel of the new evolution equation consists of the standard eikonal leading-order JIMWLK kernel plus new terms containing derivatives with respect to the sub-eikonal quark and gluon fields. The new kernel we derive can be used to generate the standard JIMWLK evolution and to construct small-$x$ evolution equations for flavor-singlet operators made of any number of light-cone Wilson lines along with one Wilson line containing sub-eikonal helicity-dependent local operator insertions (a "polarized Wilson line").

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Convergence of Weak-SINDy Surrogate Models

In this paper, we give an in-depth error analysis for surrogate models generated by a variant of the Sparse Identification of Nonlinear Dynamics (SINDy) method. We start with an overview of a variety of nonlinear system identification techniques, namely SINDy, weak-SINDy, and the occupation kernel method. Under the assumption that the dynamics are a finite linear combination of a set of basis functions, these methods establish a linear system to recover coefficients. We illuminate the structural similarities between these techniques and establish a projection property for the weak-SINDy technique. Following the overview, we analyze the error of surrogate models generated by a simplified version of weak-SINDy. In particular, under the assumption of boundedness of a composition operator given by the solution, we show that (i) the surrogate dynamics converges towards the true dynamics and (ii) the solution of the surrogate model is reasonably close to the true solution. Finally, as an application, we discuss the use of a combination of weak-SINDy surrogate modeling and proper orthogonal decomposition (POD) to build a surrogate model for partial differential equations (PDEs).

97 MATHEMATICS AND COMPUTING↗