Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel method”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

A kernel function method for computing steady and oscillatory supersonic aerodynamics with interference.

The method presented uses a collocation technique with the nonplanar kernel function to solve supersonic lifting surface problems with and without interference. A set of pressure functions are developed based on conical flow theory solutions which account for discontinuities in the supersonic pressure distributions. These functions permit faster solution convergence than is possible with conventional supersonic pressure functions. An improper integral of a 3/2 power singularity along the Mach hyperbola of the nonplanar supersonic kernel function is described and treated. The method is compared with other theories and experiment for a variety of cases.

Cunningham, A. M., Jr.↗
NASA NTRS1989

Dicke narrowing of the polarized Stokes-Raman Q branch of the v = 0-1 transition of D2 in He

Results are presented from calculations of several Stokes-Raman Q branch line shapes of the v = 0-1 transition of D2 in He in the low pressure regime where Dicke narrowing is observed. Consideration is given to five different approximations: a form of the generalized Hess theory (Monchick and Hunter, 1987), two high pressure asymptotes of Hess's method, the moment method of Corey and McCourt (1984), and a collision kernel method. It is found that the generalized Hess and the collision kernel methods have the best agreement with experiments.

Blackmore, Robert↗
DOE OSTI2022

Importance of kernel bandwidth in quantum machine learning

Quantum kernel methods are considered a promising avenue for applying quantum computers to machine learning problems. Identifying hyperparameters controlling the inductive bias of quantum machine learning models is expected to be crucial given the central role hyperparameters play in determining the performance of classical machine learning methods. In this work we introduce the hyperparameter controlling the bandwidth of a quantum kernel and show that it controls the expressivity of the resulting model. We use extensive numerical experiments with multiple quantum kernels and classical data sets to show consistent change in the model behavior from underfitting (bandwidth too large) to overfitting (bandwidth too small), with optimal generalization in between. We draw a connection between the bandwidth of classical and quantum kernels and show analogous behavior in both cases. Furthermore, we show that optimizing the bandwidth can help mitigate the exponential decay of kernel values with qubit count, which is the cause behind recent observations that the performance of quantum kernel methods decreases with qubit count. Here, we reproduce these negative results and show that if the kernel bandwidth is optimized, the performance instead improves with growing qubit count and becomes competitive with the best classical methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1974

Oscillatory supersonic kernel function method for interfering surfaces

In the method presented in this paper, a collocation technique is used with the nonplanar supersonic kernel function to solve multiple lifting surface problems with interference in steady or oscillatory flow. The pressure functions used are based on conical flow theory solutions and provide faster solution convergence than is possible with conventional functions. In the application of the nonplanar supersonic kernel function, an improper integral of a 3/2 power singularity along the Mach hyperbola is described and treated. The method is compared with other theories and experiment for two wing-tail configurations in steady and oscillatory flow.

Cunningham, A. M., Jr.↗
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↗
NASA NTRS1988

Inversion of the Solar Rotation Rate Versus Depth and Latitude

Three differential inversion techniques were used to compute the internal solar rotation rate from several sets of n-averaged frequency splittings. An iterative variation of the spectral expansion method; the optimal averaging kernel method; and a piecewise constant constrained least square method were used to invert the data. Each computation was carried out independently. While they present similar trends, each of the solutions differs in detail. A consistent feature in all the inversions is the disappearance of differential rotation below the base of the convection zone. Also, a strong differential signature in the deeper part of the convection zone is present in most of the solutions. A slow decrease of the rotation rate with depth for the equatorial and midlatitude curves is significant in the spectral expansion and the least square results but only marginally apparent in the averaging kernel results.

Korzennik, Sylvain G.↗
NASA NTRS1974

An oscillatory kernel function method for lifting surfaces in mixed transonic flow

A study was conducted on the use of combined subsonic and supersonic linear theory to obtain economical and yet realistic solutions to unsteady transonic flow problems. With some modification, existing linear theory methods were combined into a single computer program. The method was applied to problems for which measured steady Mach number distributions and unsteady pressure distributions were available. By comparing theory and experiment, the transonic method showed a significant improvement over uniform flow methods. The results also indicated that more exact local Mach number effects and normal shock boundary conditions on the perturbation potential were needed. The validity of these improvements was demonstrated by application to steady flow.

Cunningham, A. M., Jr.↗
NASA NTRS2004

Virtual Sensors: Using Data Mining to Efficiently Estimate Spectra

Detecting clouds within a satellite image is essential for retrieving surface geophysical parameters, such as albedo and temperature, from optical and thermal imagery because the retrieval methods tend to be valid for clear skies only. Thus, routine satellite data processing requires reliable automated cloud detection algorithms that are applicable to many surface types. Unfortunately, cloud detection over snow and ice is difficult due to the lack of spectral contrast between clouds and snow. Snow and clouds are both highly reflective in the visible wavelen,ats and often show little contrast in the thermal Infrared. However, at 1.6 microns, the spectral signatures of snow and clouds differ enough to allow improved snow/ice/cloud discrimination. The recent Terra and Aqua Moderate Resolution Imaging Spectro-Radiometer (MODIS) sensors have a channel (channel 6) at 1.6 microns. Presently the most comprehensive, long-term information on surface albedo and temperature over snow- and ice-covered surfaces comes from the Advanced Very High Resolution Radiometer ( AVHRR) sensor that has been providing imagery since July 1981. The earlier AVHRR sensors (e.g. AVHRR/2) did not however have a channel designed for discriminating clouds from snow, such as the 1.6 micron channel available on the more recent AVHRR/3 or the MODIS sensors. In the absence of the 1.6 micron channel, the AVHRR Polar Pathfinder (APP) product performs cloud detection using a combination of time-series analysis and multispectral threshold tests based on the satellite's measuring channels to produce a cloud mask. The method has been found to work reasonably well over sea ice, but not so well over the ice sheets. Thus, improving the cloud mask in the APP dataset would be extremely helpful toward increasing the accuracy of the albedo and temperature retrievals, as well as extending the time-series of albedo and temperature retrievals from the more recent sensors to the historical ones. In this work, we use data mining methods to construct a model of MODIS channel 6 as a function of other channels that are common to both MODIS and AVHRR. The idea is to use the model to generate the equivalent of MODIS channel 6 for AVHRR as a function of the AVHRR equivalents to MODIS channels. We call this a Virtual Sensor because it predicts unmeasured spectra. The goal is to use this virtual channel 6. to yield a cloud mask superior to what is currently used in APP . Our results show that several data mining methods such as multilayer perceptrons (MLPs), ensemble methods (e.g., bagging), and kernel methods (e.g., support vector machines) generate channel 6 for unseen MODIS images with high accuracy. Because the true channel 6 is not available for AVHRR images, we qualitatively assess the virtual channel 6 for several AVHRR images.

Srivastava, Ashok↗
DOE OSTI2023

Systems and methods for customizing kernel machines with deep neural networks

A method including receiving an input data set. The input data set can include one of a feature domain set or a kernel matrix. The method also can include constructing dense embeddings using: (i) Nyström approximations on the input data set when the input data set comprises the kernel matrix, and (ii) clustered Nyström approximations on the input data set when the input data set comprises the feature domain set. The method additionally can include performing representation learning on each of the dense embeddings using a multi-layer fully-connected network for each of the dense embeddings to generate latent representations corresponding to each of the dense embeddings. The method further can include applying a fusion layer to the latent representations corresponding to the dense embeddings to generate a combined representation. The method additionally can include performing classification on the combined representation. Other embodiments of related systems and methods are also disclosed.

Song, Huan↗
DOE OSTI2023

Data assimilation in operator algebras

We develop an algebraic framework for sequential data assimilation of partially observed dynamical systems. In this framework, Bayesian data assimilation is embedded in a nonabelian operator algebra, which provides a representation of observables by multiplication operators and probability densities by density operators (quantum states). In the algebraic approach, the forecast step of data assimilation is represented by a quantum operation induced by the Koopman operator of the dynamical system. Moreover, the analysis step is described by a quantum effect, which generalizes the Bayesian observational update rule. Projecting this formulation to finite-dimensional matrix algebras leads to computational schemes that are i) automatically positivity-preserving and ii) amenable to consistent data-driven approximation using kernel methods for machine learning. Moreover, these methods are natural candidates for implementation on quantum computers. Applications to the Lorenz 96 multiscale system and the El Niño Southern Oscillation in a climate model show promising results in terms of forecast skill and uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Magnetic reversal spurts: Rain gauges for comet showers

Abrupt increases in the rate of magnetic reversals (magnetic reversal spurts) were first studied by many others. They hypothesized that spurts result from increased turbulence in the earth's core dynamo during episodes of intense bolide bombardment of the earth. Mechanisms for creating episodes of intense bombardment of the earth involve gravitational perturbation of the Oort cloud of comets, either by a hidden planet, a solar companion, or massive matter in the galactic plane. Herein, the time variation in reversal rate is analyzed using methods of statistical density estimation. A smooth, continuous estimate of reversal rate is obtained using an adaptive kernel method, in which the kernel width is adjusted as a function of reversal rate. The estimates near the ends of the data series (at 165 my ago and the present) are obtained by extending the data by reflection. The results show that the reversal spurts are not associated demonstrably with extinctions or well-dated impacts. If the spurts do record episodes of intense bombardment of the earth, then the mass extinctions do not, in general, occur at times of impacts. Furthermore, the large impact craters seen are not obviously related to the spurts, suggesting that the craters may have been caused by bolides of a different nature and with a different temporal pattern. However, the most simple explanation seems to be that the spurts do not record comet showers, either because the recording mechanism suggested by Muller and Morris is not effective or because comet showers are not triggered in the ways considered by Hut et al.

Lutz, T. M.↗
NASA NTRS1996

Singularity Preserving Numerical Methods for Boundary Integral Equations

In the past twelve months (May 8, 1995 - May 8, 1996), under the cooperative agreement with Division of Multidisciplinary Optimization at NASA Langley, we have accomplished the following five projects: a note on the finite element method with singular basis functions; numerical quadrature for weakly singular integrals; superconvergence of degenerate kernel method; superconvergence of the iterated collocation method for Hammersteion equations; and singularity preserving Galerkin method for Hammerstein equations with logarithmic kernel. This final report consists of five papers describing these projects. Each project is preceeded by a brief abstract.

Kaneko, Hideaki↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
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↗
DOE OSTI2025

Gaussian Process Regression under Computational and Epistemic Misspecification

Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper investigates the effect of such kernel approximations on the interpolation error. We introduce a unified framework to analyze Gaussian process regression under important classes of computational misspecification: Karhunen-Loève expansions that result in low-rank kernel approximations, multiscale wavelet expansions that induce sparsity in the covariance matrix, and finite element representations that induce sparsity in the precision matrix. Furthermore, our theory also accounts for epistemic misspecification in the choice of kernel parameters.

Gaussian process regression↗
NASA NTRS2021

Evaluation of CloudSat Radiative Kernels Using ARM and CERES Observations and ERA5 Reanalysis

Despite the widespread use of the radiative kernel technique for studying radiative feedbacks and radiative forcings, there has not been any systematic, observation-based validation of the radiative kernel method. Here, we utilize observed and reanalyzed radiative fluxes and atmospheric profiles from the Atmospheric Radiation Measurement (ARM) program and ERA5 reanalysis to assess a set of observation-based radiative kernels from CloudSat for six ARM sites. The CloudSat radiative kernels, convoluted with the ERA5 state variables, can almost perfectly reconstruct the monthly anomalies of shortwave (SW) and longwave (LW) radiative fluxes in ERA5 at the surface (SFC) and top-of atmosphere (TOA) with correlations significantly being greater than 0.95. The biases of kernel-estimated flux anomalies calculated using the ARM-observed state variables can be more than twice as large when compared with the ARM-observed surface flux anomalies and Clouds and Earth’s Radiant Energy System (CERES) observed anomalies at the TOA. Generally, clouds contribute to most (>60%) of the variance of flux anomalies at Southern Great Plain (SGP), Tropical Western Pacific (TWP), and Eastern North Atlantic (ENA), and surface albedo dominates (>69%) the variance of SW flux anomalies at North Slope of Alaska (NSA). The radiative kernels exhibit the lowest correlation (r~[0.55,0.85]) when reconstructing SFC LW flux anomalies at SGP, TWP, and ENA, whose biases are related to the possibility that the kernels may not fully capture the characteristics 47 associated with MJO and ENSO at TWP and the presence of clouds at SGP and ENA.

Radiative kernels↗