Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 199 records · Page 11

Spectral Evidence for Heating at Large Column Mass in Umbral Solar Flare Kernels. I. IRIS Near-UV Spectra of the X1 Solar Flare of 2014 October 25

The GOES X1 flare SOL2014-10-25T17:08:00 was a three-ribbon solar flare observed with the Interface Region Imaging Spectrograph (IRIS)in the near-UV(NUV)and far-UV. One of the flare ribbons crossed a sunspot umbra, producing a dramatic, ∼1000% increase in the NUV continuum radiation. We comprehensively analyze the UV spectral data of the umbral flare brightenings, which provide new challenges for radiative−hydrodynamic modeling of the chromospheric velocity field and the white-light continuum radiation. The emission line profiles in the umbral flare brightenings exhibit redshifts and profile asymmetries, but these are significantly smaller than in another, well-studied X-class solar flare. We present a ratio of the NUV continuum intensity to the FeIIλ2814.45intensity. This continuum-to-line ratio is a new spectral diagnostic of significant heating at high column mass (log m/[gcm−2]>−2) during solar flares because the continuum and emission line radiation originate from relatively similar temperatures but moderately different optical depths. The full spectral readout of these IRIS data also allow for a comprehensive survey of the flaring NUV landscape: in addition to many lines of Fe II and Cr II, we identify a new solar flare emission line, HeIλ2829.91(as previously identified in laboratory and early-type stellar spectra). The Fermi/GBM hard X-ray data provide inputs to radiative−hydrodynamic models (which will be presented in Paper II) in order to better understand the large continuum-to-line ratios, the origin of the white-light continuum radiation, and the role of electron beam heating in the low atmosphere.

Adam F Kowalski↗

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↗

Mneme

A simple tool allowing recording the execution of a GPU (CUDA) kernel and replaying that kernel as an independent executable. The tool operates in 3 phases. During compile time the user needs to apply a provided LLVM pass to instrument the code. The pass detects all device global variables and device functions and stores this information with the respective LLVM-IR in the global device memory. The compilation generates a record-able executable. The second phase involves running the application executable with a desired input and using LD_PRELOAD to enable recording. When recording before invoking a device kernel the pre-loaded library stores device memory in persistent storage and associates the memory with the device kernel and an LLVM IR file. At the end of the recorded execution the pre-load library generates a database in the form of a JSON file containing information regarding the LLVM-IR files and the snapshots of device memory. During the third and last phase the user can replay the execution of an kernel as a separate independent executable. Besides executing it the user can modify the LLVM IR file and auto-tune parameters such as kernel launch-bounds or kernel runtime execution parameters (e.g. Kernel Block and Grid Dimensions). Is

Parasyris, Konstantinos↗

Improving Runtime Performance of Tensor Computations using Rust From Python

In this work, we investigate improving the runtime performance of key computational kernels in the Python Tensor Toolbox (pyttb), a package for analyzing tensor data across a wide variety of applications. Recent runtime performance improvements have been demonstrated using Rust, a compiled language, from Python via extension modules leveraging the Python C API—e.g., web applications, data parsing, data validation, etc. Using this same approach, we study the runtime performance of key tensor kernels of increasing complexity, from simple kernels involving sums of products over data accessed through single and nested loops to more advanced tensor multiplication kernels that are key in low-rank tensor decomposition and tensor regression algorithms. In numerical experiments involving synthetically generated tensor data of various sizes and these tensor kernels, we demonstrate consistent improvements in runtime performance when using Rust from Python over 1) using Python alone, 2) using Python and the Numba just-in-time Python compiler (for loop-based kernels), and 3) using the NumPy Python package for scientific computing (for pyttb kernels).

97 MATHEMATICS AND COMPUTING↗

A methodology for using nonlinear aerodynamics in aeroservoelastic analysis and design

A methodology is presented for using the Volterra-Wiener theory of nonlinear systems in aeroservoelastic (ASE) analyses and design. The theory is applied to the development of nonlinear aerodynamic response models that can be defined in state-space form and are, therefore, appropriate for use in modern control theory. The theory relies on the identification of nonlinear kernels that can be used to predict the response of a nonlinear system due to an arbitrary input. A numerical kernel identification technique, based on unit impulse responses, is presented and applied to a simple bilinear, single-input single-output (SISO) system. The linear kernel (unit impulse response) and the nonlinear second-order kernel of the system are numerically-identified and compared with the exact, analytically-defined and linear and second-order kernels. This kernel identification technique is then applied to the CAP-TSD (Computational Aeroelasticity Program-Transonic Small Disturbance) code for identification of the linear and second-order kernels of a NACA64A010 rectangular wing undergoing pitch at M = 0.5, M = 8.5 (transonic), and M = 0.93 (transonic). Results presented demonstrate the feasibility of this approach for use with nonlinear, unsteady aerodynamic responses.

Silva, Walter A.↗