SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 703 records · Page 39

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Filamentary surface plasma discharge flow length and time scales

Nanosecond surface dielectric barrier discharges (ns-SDBDs) are a class of plasma actuators that utilize a high-voltage pulse of nanosecond duration between two surface-mounted electrodes to create an electrical breakdown of air, along with rapid heating. These actuators usually produce multiple filaments when operated at high pulse frequencies, and the rapid heating leads to the formation of shock waves and complex flow fields. In this work we replicate a single filament of the ns-SDBDs and characterize the induced flow using velocity measurements from particle image velocimetry and density measurements from background-oriented schlieren. The discharge is produced by a high voltage electrical pulse between two copper electrodes on an acrylic base. A hot gas kernel characterizes the flow field formed close to the electrodes that expands and cools over time and a vortex ring that propagates away from the surface while entraining cold ambient fluid. The gas density deficit inside the kernel displays a power-law decay over time. Based on the observations, we develop a simplified theoretical model based on vortex-driven cooling and perform a scaling analysis to obtain the induced flow length and time scales. The results show that the cooling process's time scales correspond to a circulation-based time scale of the vortex ring, and the length scale of the kernel corresponds to the vortex ring radius. Furthermore, these findings can guide the choice of optimal filament spacing and pulse frequencies in the design, deployment, and operation of ns-SDBDs for flow control.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

Long-time memory effects in a localizable central spin problem

We study the properties of the Nakajima–Zwanzig memory kernel for a qubit immersed in a many-body localized (i.e. disordered and interacting) bath. We argue that the memory kernel decays as a power law in both the localized and ergodic regimes, and show how this can be leveraged to extract t → ∞ populations for the qubit from finite time (Jt ≤ 10 2 ) data in the thermalizing phase. This allows us to quantify how the long-time values of the populations approach the expected thermalized state as the bath approaches the thermodynamic limit. This approach should provide a good complement to state-of-the-art numerical methods, for which the long-time dynamics with large baths are impossible to simulate in this phase. Additionally, our numerics on finite baths reveal the possibility for unbounded exponential growth in the memory kernel, a phenomenon rooted in the appearance of exceptional points in the projected Liouvillian governing the reduced dynamics. In small systems amenable to exact numerics, we find that these pathologies may have some correlation with delocalization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2014

High Energy Electromagnetic Particle Transportation on the GPU

We present massively parallel high energy electromagnetic particle transportation through a finely segmented detector on a Graphics Processing Unit (GPU). Simulating events of energetic particle decay in a general-purpose high energy physics (HEP) detector requires intensive computing resources, due to the complexity of the geometry as well as physics processes applied to particles copiously produced by primary collisions and secondary interactions. The recent advent of hardware architectures of many-core or accelerated processors provides the variety of concurrent programming models applicable not only for the high performance parallel computing, but also for the conventional computing intensive application such as the HEP detector simulation. The components of our prototype are a transportation process under a non-uniform magnetic field, geometry navigation with a set of solid shapes and materials, electromagnetic physics processes for electrons and photons, and an interface to a framework that dispatches bundles of tracks in a highly vectorized manner optimizing for spatial locality and throughput. Core algorithms and methods are excerpted from the Geant4 toolkit, and are modified and optimized for the GPU application. Program kernels written in C/C++ are designed to be compatible with CUDA and OpenCL and with the aim to be generic enough for easy porting to future programming models and hardware architectures. To improve throughput by overlapping data transfers with kernel execution, multiple CUDA streams are used. Issues with floating point accuracy, random numbers generation, data structure, kernel divergences and register spills are also considered. Performance evaluation for the relative speedup compared to the corresponding sequential execution on CPU is presented as well.

Canal, P.↗

DOE OSTI2023

Quantum Kerr learning

Quantum machine learning is a rapidly evolving field of research that could facilitate important applications for quantum computing and also significantly impact data-driven sciences. In our work, based on various arguments from complexity theory and physics, we demonstrate that a single Kerr mode can provide some 'quantum enhancements' when dealing with kernel-based methods. Using kernel properties, neural tangent kernel theory, first-order perturbation theory of the Kerr non-linearity, and non-perturbative numerical simulations, we show that quantum enhancements could happen in terms of convergence time and generalization error. Furthermore, we make explicit indications on how higher-dimensional input data could be considered. Finally, we propose an experimental protocol, that we call quantum Kerr learning, based on circuit QED.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Frequency-domain full-waveform inversion with non-linear descent directions

Full-waveform inversion (FWI) is a highly non-linear inverse problem, normally solved iteratively, with each iteration involving an update constructed through linear operations on the residuals. Incorporating a flexible degree of non-linearity within each update may have important consequences for convergence rates, determination of low model wavenumbers and discrimination of parameters. In this study, we examine one approach for doing so, wherein higher order scattering terms are included within the sensitivity kernel during the construction of the descent direction, adjusting it away from that of the standard Gauss–Newton approach. These scattering terms are naturally admitted when we construct the sensitivity kernel by varying not the current but the to-be-updated model at each iteration. Linear and/or non-linear inverse scattering methodologies allow these additional sensitivity contributions to be computed from the current data residuals within any given update. We show that in the presence of pre-critical reflection data, the error in a second-order non-linear update to a background of s 0 is, in our scheme, proportional to at most (Δs/s 0 ) 3 in the actual parameter jump Δs causing the reflection. In contrast, the error in a standard Gauss–Newton FWI update is proportional to (Δs/s 0 ) 2 . For numerical implementation of more complex cases, we introduce a non-linear frequency-domain scheme, with an inner and an outer loop. A perturbation is determined from the data residuals within the inner loop, and a descent direction based on the resulting non-linear sensitivity kernel is computed in the outer loop. We examine the response of this non-linear FWI using acoustic single-parameter synthetics derived from the Marmousi model. Lastly, the inverted results vary depending on data frequency ranges and initial models, but we conclude that the non-linear FWI has the capability to generate high-resolution model estimates in both shallow and deep regions, and to converge rapidly, relative to a benchmark FWI approach involving the standard gradient.

58 GEOSCIENCES↗

DOE OSTI2026

Microscopic constraints for the equation of state and structure of neutron stars: A Bayesian model mixing framework

Bayesian model mixing (BMM) is a statistical technique that can combine constraints from different regions of an input space in a principled way. Here we extend our BMM framework for the equation of state (EOS) of strongly interacting matter from symmetric nuclear matter to asymmetric matter, specifically focusing on zero-temperature, charge-neutral, 𝛽-equilibrated matter. We use Gaussian processes (GPs) to infer constraints on the neutron-star matter EOS at intermediate densities from two different microscopic theories: chiral effective-field theory (𝜒⁢EFT) at baryon densities around nuclear saturation, 𝑛 𝐵 ∼ 𝑛 0 , and perturbative QCD at asymptotically high baryon densities, 𝑛 𝐵 ⩾ 20⁢𝑛 0 . The uncertainties of the 𝜒⁢EFT and pQCD EOSs are obtained using the BUQEYE truncation error model. We demonstrate the flexibility of our framework through the use of two categories of GP kernels: conventional stationary kernels and a nonstationary changepoint kernel. We use the latter to explore potential constraints on the dense matter EOS by including exogenous data representing theory predictions and heavy-ion collision measurements at densities ⩾ 2⁢𝑛 0 . We also use our EOSs to obtain neutron-star mass-radius relations and their uncertainties. Finally, our framework, whose implementation will be available through a GitHub repository, provides a prior distribution for the EOS that can be used in large-scale neutron-star inference frameworks.

Bayesian methods↗

DOE OSTI2017

Near-field limitations of Fresnel-regime coherent diffraction imaging

Coherent diffraction imaging (CDI) is a rapidly developing form of imaging that offers the potential of wavelength-limited resolution without image-forming lenses. In CDI, the intensity of the diffraction pattern is measured directly by the detector, and various iterative phase retrieval algorithms are used to “invert” the diffraction pattern and reconstruct a high-resolution image of the sample. But, there are certain requirements in CDI that must be met to reconstruct the object. Although most experiments are conducted in the “far-field”—or Fraunhofer—regime where the requirements are not as stringent, some experiments must be conducted in the “near field” where Fresnel diffraction must be considered. According to the derivation of Fresnel diffraction, successful reconstructions can only be obtained when the small-angle number, a derived quantity, is much less than one. We show, however, that it is not actually necessary to fulfill the small-angle condition. The Fresnel kernel well approximates the exact kernel in regions where the phase oscillates slowly, and in regions of fast oscillations, indicated by large A n , the error between kernels should be negligible due to stationary-phase arguments. Finally we verify, by experiment, this conclusion with a helium neon laser setup and show that it should hold at x-ray wavelengths as well.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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 OSTI2014

Limits on transverse momentum dependent evolution from semi-inclusive deep inelastic scattering at moderate Q

In the QCD evolution of transverse momentum dependent parton distribution and fragmentation functions, the Collins-Soper evolution kernel includes both a perturbative short-distance contribution and a large-distance nonperturbative, but strongly universal, contribution. In the past, global fits, based mainly on larger 𝑄 Drell-Yan–like processes, have found substantial contributions from nonperturbative regions in the Collins-Soper evolution kernel. In this article, we investigate semi-inclusive deep inelastic scattering measurements in the region of relatively small 𝑄 , of the order of a few GeV, where sensitivity to nonperturbative transverse momentum dependence may become more important or even dominate the evolution. Using recently available deep inelastic scattering data from the COMPASS experiment, we provide estimates of the regions of coordinate space that dominate in transverse momentum dependent (TMD) processes when the hard scale is of the order of only a few GeV. We find that distance scales that are much larger than those commonly probed in large 𝑄 measurements become important, suggesting that the details of nonperturbative effects in TMD evolution are especially significant in the region of intermediate 𝑄 . We highlight the strongly universal nature of the nonperturbative component of evolution and its potential to be tightly constrained by fits from a wide variety of observables that include both large and moderate 𝑄 . On this basis, we recommend detailed treatments of the nonperturbative component of the Collins-Soper evolution kernel for future TMD studies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2018

Extracting the spectrum of a flow by spatial filtering

We show that the spectrum of a flow field can be extracted within a local region by straightforward filtering in physical space. We find that for a flow with a certain level regularity, the filtering kernel must have a sufficient number of vanishing moments in order for the "filtering spectrum" to be meaningful. Our derivation follows a similar analysis by [1] for the wavelet spectrum, where we show that the filtering kernel has to have at least p vanishing moments in order to correctly extract a spectrum k (-alpha) with (alpha) less/equal to p + 2. For example, any ow with a spectrum shallower than k (-3) can be extracted by a straightforward average on grid-cells of a stencil. We construct two new "simple stencil" kernels, MI and MII, with only two and three fixed stencil weight coefficients, respectively, and that have sufficient vanishing moments to allow for extracting spectra steeper than k(-3). We demonstrate our results using synthetic fields, 2D turbulence from a Direct Numerical Simulation, and 3D turbulence from the JHU Database. Our method guarantees energy conservation and can be useful in both simulations and experiments when a straightforward Fourier analysis is not justified, such as within coherent flow structures covering non-rectangular regions or in geophysical flows on Earth's curved surface.

42 ENGINEERING↗

DOE OSTI2022

Distributionally Robust Decision Making Leveraging Conditional Distributions

Distributionally robust optimization (DRO) is a powerful tool for decision making under uncertainty. It is particularly appealing because of its ability to leverage existing data. However, many practical problems call for decision-making with some auxiliary information, and DRO in the context of conditional distributions is not straightforward. We propose a conditional kernel distributionally robust optimization (CKDRO) method that enables robust decision making under conditional distributions through kernel DRO and the conditional mean operator in the reproducing kernel Hilbert space (RKHS). In particular, we consider problems where there is a correlation between the unknown variable y and an auxiliary observable variable x. Given past data of the two variables and a queried auxiliary variable, CKDRO represents the conditional distribution P(y|x) as the conditional mean operator in the RKHS space and quantifies the ambiguity set in the RKHS as well, which depends on the size of the dataset as well as the query point. To justify the use of RKHS, we demonstrate that the ambiguity set defined in RKHS can be viewed as a ball under a metric that is similar to the Wasserstein metric. The DRO is then dualized and solved via a finite dimensional convex program. The proposed CKDRO approach is applied to a generation scheduling problem and shows that the result of CKDRO is superior to common benchmarks in terms of quality and robustness.

Chen, Yuxiao↗

DOE OSTI2022

A Framework for Neural Network Inference on FPGA-Centric SmartNICs

FPGA-based SmartNICs offer great potential to significantly improve the performance of high-performance computing and warehouse data processing by tightly coupling support for reconfigurable data-intensive computation with cross-node communication, thereby mitigating the von Neumann bottleneck. Existing work, however, has been generally been limited in that it assumes an accelerator model where kernels are offloaded to SmartNICs, but most control tasks are left to the CPUs. This leads to frequent waiting, inferior performance, and scaling challenges. In this work, we propose a new distributive data-centric computing framework, named FCsN, for reconfigurable SmartNIC-based systems. Through a lightweight task circulation execution model and its implementation architecture, FCsN allows the complete detaching of kernel execution, control logic, system scheduling, and network communication to the SmarNICs. This boosts performance by: (i) avoiding the control dependency with CPUs and (ii) supporting streaming kernel execution and network communication at line rate and in a very fine-grained manner. We demonstrate the efficiency and flexibility of FCsN using various types of neural network applications including graph neural networks; as these last are both irregular and data intensive they offer an especially robust demonstration. Evaluations using commonly-used neural network models and graph datasets show that a system with the support of FCsN can achieve, on average, 144 speedups over the MPI-based standard CPU baselines.

Guo, Anqi↗

DOE OSTI2021

Tensorized Feature Spaces for Feature Explosion

In this paper 1 1 This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-000R22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan) This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-000R22725., we present a novel framework that uses tensor factorization to generate richer feature spaces for pixel classification in hyperspectral images. In particular, we assess the performance of different tensor rank decomposition methods as compared to the traditional kernel-based approaches for the hyperspectral image classification problem. We propose Orion, which takes as input a hyperspectral image tensor and a rank and outputs an enhanced feature space from the factor matrices of the decomposed tensor. Our method is a feature explosion technique that inherently maps low dimensional input space in $\mathbb{R}^{K}$ to high dimensional space in $\mathbb{R}^{R}$ , where $R\gg K$ , say in the order of 1000x, like a kernel. We show how the proposed method exploits the multi-linear structure of hyperspectral three dimensional tensor. We demonstrate the effectiveness of our method with experiments on three publicly available hyperspectral datasets with labeled pixels and compare their classification performance against traditional linear and non-linear supervised learning methods such as SVM with Linear, Polynomial, RBF kernels, and the Multi-Layer Perceptron model. Finally, we explore the relationship between the rank of the tensor decomposition and the classification accuracy using several hyperspectral datasets with ground truth.

Pasricha, Ravdeep Singh↗

DOE OSTI2014

A Step towards Energy Efficient Computing: Redesigning a Hydrodynamic Application on CPU-GPU, In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

Power and energy consumption are becoming an increasing concern in high performance computing. Compared to multi-core CPUs, GPUs have a much better performance per watt. In this paper we discuss efforts to redesign the most computation intensive parts of BLAST, an application that solves the equations for compressible hydrodynamics with high order finite elements, using GPUs BLAST, Dobrev. In order to exploit the hardware parallelism of GPUs and achieve high performance, we implemented custom linear algebra kernels. We intensively optimized our CUDA kernels by exploiting the memory hierarchy, which exceed the vendor's library routines substantially in performance. We proposed an auto tuning technique to adapt our CUDA kernels to the orders of the finite element method. Compared to a previous base implementation, our redesign and optimization lowered the energy consumption of the GPU in two aspects: 60% less time to solution and 10% less power required. Compared to the CPU-only solution, our GPU accelerated BLAST obtained a 2.5× overall speedup and 1.42× energy efficiency (green up) using 4th order (Q_4) finite elements, and a 1.9× speedup and 1.27× green up using 2nd order (Q2) finite elements.

Computer Science↗

DOE OSTI2021

A High Performance Sparse Tensor Algebra Compiler in MLIR

Sparse tensor algebra is widely used in many applications, including scientific computing, machine learning, and data analytics. The performance of sparse tensor algebra kernels strongly depends on the intrinsic characteristics of the input tensors, hence many storage formats are designed for tensors to achieve optimal performance for particular applications/architectures, which makes it challenging to implement and optimize every tensor operation of interest on a given architecture. We propose a tensor algebra domain-specific language (DSL) and compiler framework to automatically generate kernels for mixed sparse-dense tensor algebra operations. The proposed DSL provides high-level programming abstractions that resemble the familiar Einstein notation to represent tensor algebra operations. The compiler introduces a new Sparse Tensor Algebra dialect built on top of LLVM's extensible MLIR compiler infrastructure for efficient code generation while covering a wide range of tensor storage formats. Our compiler also leverages input-dependent code optimization to enhance data locality for better performance. Our results show that the performance of automatically generated kernels outperforms the state-of-the-art sparse tensor algebra compiler, with up to 20.92x, 6.39x, and 13.9x performance improvement over state-of-the-art tensor algebra compilers, for parallel SpMV, SpMM, and TTM, respectively.

Tian, Ruiqin↗

DOE OSTI2024

Radiological Source Term Estimation and Isotopic Identification with Parallel Log Domain Particle Filters

This paper presents a parallel log-domain particle filtering algorithm combined with gamma spectrum unfolding to perform localization, identification, and evaluation of multiple point sources of various isotopes in an environment with attenuating obstacles. The method uses sets of precomputed attenuation kernels that map the attenuation characteristics of the environment. These kernels are specific to the energy level of a photopeak of interest. The spectral measurements are deconvolved into count measurements of each photopeak. These count measurements are fed into a set of parallel particle filters using attenuation kernels computed for that photopeak’s energy level. The individual regularized particle filters perform all likelihood calculations in the logarithmic domain to mitigate the effects of particle degeneracy. The output of each particle filter is combined to estimate which isotopes are present as well as their positions and strengths. The performance of the algorithm is characterized in a lab-scale environment using a mobile robot equipped with a gamma ray spectrometer in the presence of up to three different radioactive isotopes simultaneously. The sources were localized to within 10 cm, and their strengths were estimated within 10% of their true values. Furthermore, the isotopes were all correctly identified, and no spurious sources were reported.

42 ENGINEERING↗

DOE OSTI2017

A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations

As on-node parallelism increases and the performance gap between the processor and the memory system widens, achieving high performance in large-scale scientific applications requires an architecture-aware design of algorithms and solvers. We focus on the eigenvalue problem arising in nuclear Configuration Interaction (CI) calculations, where a few extreme eigenpairs of a sparse symmetric matrix are needed. Here, we consider a block iterative eigensolver whose main computational kernels are the multiplication of a sparse matrix with multiple vectors (SpMM), and tall-skinny matrix operations. We then present techniques to significantly improve the SpMM and the transpose operation SpMM T by using the compressed sparse blocks (CSB) format. We achieve 3-4× speedup on the requisite operations over good implementations with the commonly used compressed sparse row (CSR) format. We develop a performance model that allows us to correctly estimate the performance of our SpMM kernel implementations, and we identify cache bandwidth as a potential performance bottleneck beyond DRAM. We also analyze and optimize the performance of LOBPCG kernels (inner product and linear combinations on multiple vectors) and show up to 15× speedup over using high performance BLAS libraries for these operations. The resulting high performance LOBPCG solver achieves 1.4× to 1.8× speedup over the existing Lanczos solver on a series of CI computations on high-end multicore architectures (Intel Xeons). We also analyze the performance of our techniques on an Intel Xeon Phi Knights Corner (KNC) processor.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗