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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Non-Blind Deblurring for Fluorescence: A Deformable Latent Space Approach with Kernel Parameterization

We report N\non-blind deblurring (NBD) is a modeling method of the image deblurring problem in computer vision, where the blurring kernel is known or can be externally estimated. In this paper, we attempt to solve a parametric NBD problem, inspired by the simultaneous acquisition of ptychography and fluorescent imaging (FI). Ptychography is an imaging method that favors larger probes, i.e. convolutional kernels, while FI relies on a small probe for high resolution. Also, the kernel can be solved during ptychographic reconstruction. With Ptycho-FI using the same larger kernel, we can perform NBD on the blurred fluorescent images to achieve high-resolution FI, and thus speed up the experiments. To this end, we design a deep latent space deformation network that is directly parameterized by the kernel. The network consists of three components: encoder, deformer, and decoder, where the deformer is specifically meant to rectify the latent space representations of blurred images to a standard latent space, regardless of the kernel. The deformation network is trained with a two-stage training scheme. We conduct extensive experiments to confirm that our parametric model can adapt to drastically different blurring kernels and perform robust deblurring.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
NASA NTRSDate not supplied

Hyperspectral Sounder Spectral Fingerprinting: Using Machine Learning Techniques to Enhance Model-Based Physical Inversion

Different retrieval algorithms have been developed to process top-of-atmosphere (TOA) spectral radiance data provided by hyperspectral infrared sounder missions. Those algorithms are either optimal estimation method (OEM) based schemes with radiative transfer calculation involved in the retrieval process, or machine learning based methods that allow ultra-efficient data procession but lack of radiometric consistency validation based on the directly measured information. Combining both approaches leverages their respective technical advantages, leading to more accurate results. This study introduces a hyperspectral sounder fingerprinting algorithm to explore this hybrid approach. This approach involves the use of a spectral information-based classification method to identify an reference geophysical state and the corresponding radiative kernel. This enables the efficient retrieval of geophysical variables of interest through a radiative kernel-based linear inversion procedure. The fingerprinting method has been applied to analyze a decade-long hyperspectral sounder data record.

Wan Wu↗
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↗
NASA NTRS1974

Numerical evaluation of electromagnetic fields due to dipole antennas in the presence of stratified media

Two numerical methods are used to evaluate the integrals that express the em fields due to dipole antennas radiating in the presence of a stratified medium. The first method is a direct integration by means of Simpson's rule. The second method is indirect and approximates the kernel of the integral by means of the fast Fourier transform. In contrast to previous analytical methods that applied only to two-layer cases the numerical methods can be used for any arbitrary number of layers with general properties.

Tsang, L.↗
NASA NTRS1997

Nonlinear Rescaling and Proximal-Like Methods in Convex Optimization

The nonlinear rescaling principle (NRP) consists of transforming the objective function and/or the constraints of a given constrained optimization problem into another problem which is equivalent to the original one in the sense that their optimal set of solutions coincides. A nonlinear transformation parameterized by a positive scalar parameter and based on a smooth scaling function is used to transform the constraints. The methods based on NRP consist of sequential unconstrained minimization of the classical Lagrangian for the equivalent problem, followed by an explicit formula updating the Lagrange multipliers. We first show that the NRP leads naturally to proximal methods with an entropy-like kernel, which is defined by the conjugate of the scaling function, and establish that the two methods are dually equivalent for convex constrained minimization problems. We then study the convergence properties of the nonlinear rescaling algorithm and the corresponding entropy-like proximal methods for convex constrained optimization problems. Special cases of the nonlinear resealing algorithm are presented. In particular a new class of exponential penalty-modified barrier functions methods is introduced.

Polyak, Roman↗
NASA NTRS1987

Three dimensional numerical scattering from ocean-like surfaces

A new method of calculating the electric field scattered from two-dimensional conducting rough surfaces is presented. This method uses the operator conjugate gradients technique and the extended boundary condition equation. This avoids the build-up of round-off errors encountered in the inversion of large matrices. It also avoids the singularities of the integral kernels usually encountered in the method of moments. Techniques for improving the rate of convergence by applying physical constraints are discussed. This method is presently being used to calculate the polarization signatures from simulated ocean-like surfaces.

Rodriguez, Ernesto↗
DOE OSTI2025

A high-order computational framework for particle-resolved simulations of disperse multiphase flows

This work presents a high-order numerical approach for particle-resolved simulations of disperse multiphase flows, where the Navier-Stokes equations for fluid flow are solved using a high-order spectral element method in the Eulerian framework, and the particle phase is directly simulated with a discrete element method. The coupling between particles and fluids is explicitly handled using an adapted direct-forcing immersed boundary method. Unlike the conventional schemes, a high-order barycentric Lagrange interpolation method and a Gaussian projection kernel are used to ensure accurate momentum exchange between local boundary points and surrounding fluid nodes in the framework of high-order fluid solver. Benchmark tests of increasing complexity are conducted to demonstrate the accuracy and efficiency of our method. Here, it is found that our approach exhibits an excellent convergence performance, as the fluid element/grid is refined and the number of boundary points increases. Compared to conventional low-order methods, the proposed high-order framework enables the use of substantially larger fluid elements while maintaining high accuracy in modeling fluid-particle interactions, owing to the enhanced resolution of high-order basis functions. Moreover, since the primary unknowns are stored at element or grid nodes, the high-order approach offers improved efficiency in both CPU memory usage and total computational cost.

42 ENGINEERING↗
DOE OSTI2023

Simulation of Mechanical Fractionation of Chopped Whole-Plant Corn (WPC) Using Discrete Element Method (DEM)

Fractionating whole-plant corn (WPC) in a single-pass harvesting system requires studies on the WPC-to-equipment interaction for improved property control, as well as mechanical and air-driven separation processes compared to the traditional multi-pass grain and stover harvesting system. The discrete element method (DEM) technique has the potential to simulate WPC mechanical fractionation and support simulation-based design of WPC separation processes. In this study, methods to develop DEM particle models of WPC (kernel, cob, stalk, and husk) and their material properties for simulating mass fractionation using the ASABE standard mechanical shaker were proposed. Measurement was done on the axial dimensions (major, intermediate, and minor) and mass of each WPC type (mean sample size is 56), sampled from single-pass harvesting. Applying gaussian multivariate regression and bootstrapping re-sampling techniques, a DEM particle approximate to each WPC was developed. Sensitivity analysis of the DEM Young‘s modulus, Poisson‘s ratio, and interaction parameters of coefficient of restitution, coefficient of rolling friction, and coefficient of static friction on mass fraction was performed after 156 ASABE sieve-shaking DEM simulation runs, generated using Latin Hypercube Design (LHD) design of experiment (DOE) from 19 DEM material parameters. DEM simulation using Hertz-Mindlin with flexible bond contact laws and DOE optimized material properties successfully reproduced the mass fractions retained in ASABE sieves at 9.8% mean relative error and a coefficient of determination of R2 = 0.87. Here, the DEM methodology developed for mechanical WPC mass fractionation could be deployed to perform virtual design of feedstock handling equipment and performance analysis of mechanical fraction systems.

09 BIOMASS FUELS↗
NASA NTRSDate not supplied

A Spectral Fingerprinting Method for Deriving Consistent Climate Data Records from Multiple Satellite IR Sounders

Deriving Climate Data Records (CDRs) from multiple IR sounders such AIRS on Aqua, CrIS on S-NPP, NOAA20 and JPSS-2, IASI on Metop A, B, and C requires from current operational products are challenging due to different radiative transfer models and retireavl algorithms used for processing level 2 data. We developed a Climate Fingerprinting Sounder Product (ClimFiSP) algorithm, which uses a single set of radiative kernels a robust spectral fingerprinting method to performs retrievals using spatiotemporally averaged L1 hyperspectral radiances directly. The ClimFiSP algorithm provides accurate data fusion CDR products from multiple satellite sensors. We have applied this method to both AIRS and CrIS (on SNPP and on NOAA 20) data and generated two decades climate data records for atmospheric temperature, water vapor, cloud, trace gases, and surface skin temperature. We plan to add IASI to the CDR data set in the future. The ClimFiSP is being transitioned to NASA GES DISC data center for public access.

Xu Liu↗
NASA NTRS1996

Error and Complexity Analysis for a Collocation-Grid-Projection Plus Precorrected-FFT Algorithm for Solving Potential Integral Equations with LaPlace or Helmholtz Kernels

In this paper we derive error bounds for a collocation-grid-projection scheme tuned for use in multilevel methods for solving boundary-element discretizations of potential integral equations. The grid-projection scheme is then combined with a precorrected FFT style multilevel method for solving potential integral equations with 1/r and e(sup ikr)/r kernels. A complexity analysis of this combined method is given to show that for homogeneous problems, the method is order n natural log n nearly independent of the kernel. In addition, it is shown analytically and experimentally that for an inhomogeneity generated by a very finely discretized surface, the combined method slows to order n(sup 4/3). Finally, examples are given to show that the collocation-based grid-projection plus precorrected-FFT scheme is competitive with fast-multipole algorithms when considering realistic problems and 1/r kernels, but can be used over a range of spatial frequencies with only a small performance penalty.

Phillips, J. R.↗
DOE OSTI2022

A method to predict texture effect on ion beam channeling analysis of polycrystals and the application to study the mosaic spreading effect in highly oriented pyrolytic graphite

We propose a method to convert the channeling Rutherford backscattering spectrum yield map of a single crystal to a polycrystal through a matrix rotation technique. The rotation matrix is determined by the deviation of the crystal axial direction from the original z axis. The final yield map is created after averaging the rotated yields using the texture function as the weight factor. For highly oriented pyrolytic graphite (HOPG) exhibiting mosaic spread, the method leads to a Gaussian kernel averaging of the map obtained from a single crystal. The yield map of a single crystal is obtained by a simulation of ion trajectories in a potential field described by Moliere screened Coulomb potentials. Yield maps are calculated under various σ values (standard deviations of mosaic spread). The simulated results are compared with experimental results obtained using 1.2 MeV alpha particle. σ is extracted through the best fitting, demonstrating that the method can be used to obtain texture details. The effects of mosaic spread on minimum yield χ min and the half-width at half maximum of angular scans ψ ½ are systematically modeled and compared with previous theoretical equations. The study also shows that previous theoretical equations are valid only at small σ values. The proposed method can be applied to any type of polycrystal and is not limited to HOPG. It provides near-surface mosaic spread and crystallography information with a longitudinal depth resolution of tens of nanometers and is not influenced by grain shapes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1994

A fast numerical solution of scattering by a cylinder: Spectral method for the boundary integral equations

It is known that the exact analytic solutions of wave scattering by a circular cylinder, when they exist, are not in a closed form but in infinite series which converges slowly for high frequency waves. In this paper, we present a fast number solution for the scattering problem in which the boundary integral equations, reformulated from the Helmholtz equation, are solved using a Fourier spectral method. It is shown that the special geometry considered here allows the implementation of the spectral method to be simple and very efficient. The present method differs from previous approaches in that the singularities of the integral kernels are removed and dealt with accurately. The proposed method preserves the spectral accuracy and is shown to have an exponential rate of convergence. Aspects of efficient implementation using FFT are discussed. Moreover, the boundary integral equations of combined single and double-layer representation are used in the present paper. This ensures the uniqueness of the numerical solution for the scattering problem at all frequencies. Although a strongly singular kernel is encountered for the Neumann boundary conditions, we show that the hypersingularity can be handled easily in the spectral method. Numerical examples that demonstrate the validity of the method are also presented.

Hu, Fang Q.↗
NASA NTRS2011

Time delay and distance measurement

A method for measuring time delay and distance may include providing an electromagnetic radiation carrier frequency and modulating one or more of amplitude, phase, frequency, polarization, and pointing angle of the carrier frequency with a return to zero (RZ) pseudo random noise (PN) code. The RZ PN code may have a constant bit period and a pulse duration that is less than the bit period. A receiver may detect the electromagnetic radiation and calculate the scattering profile versus time (or range) by computing a cross correlation function between the recorded received signal and a three-state RZ PN code kernel in the receiver. The method also may be used for pulse delay time (i.e., PPM) communications.

Abshire, James B.↗
DOE OSTI2025

Boundary Corrections for Kernel Approximation to Differential Operators

The kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same computational cost as an explicit finite difference scheme but can exhibit order reduction at boundaries. In previous work on periodic domains, order reduction was addressed, yielding high-order accuracy. The issue addressed in this work is the elimination of order reduction of the kernel-based approach for a more general set of boundary conditions. Further, we consider the case of both first and second order operators. To demonstrate the theory, we provide not only the mathematical proofs but also experimental results by applying various boundary conditions to different types of equations. The results agree with the theory, demonstrating a systematic path to high order for kernel-based methods on bounded domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Simulations of classical three-body thermalization in one dimension

One-dimensional systems, such as nanowires or electrons moving along strong magnetic field lines, have peculiar thermalization physics. The binary collision of pointlike particles, typically the dominant process for reaching thermal equilibrium in higher-dimensional systems, cannot thermalize a 1D system. We study how dilute classical 1D gases thermalize through three-body collisions. We consider a system of identical classical point particles with pairwise repulsive inverse power-law potential V ij ∝ 1/|x i –x j | n or the pairwise Lennard-Jones potential. Using Monte Carlo methods, we compute a collision kernel and use it in the Boltzmann equation to evolve a perturbed thermal state with temperature T toward equilibrium. We explain the shape of the kernel and its dependence on the system parameters. Additionally, we implement molecular dynamics simulations of a many-body gas and show agreement with the Boltzmann evolution in the low-density limit. For the inverse power-law potential, the rate of thermalization is proportional to ρ 2 ⁢T$\frac{1}{2}$ – $\frac{1}{n}$, where ρ is the number density. Furthermore, the corresponding proportionality constant decreases with increasing n.

1-dimensional systems↗
DOE OSTI2025

Cosmological perturbation theory for large scale structure in phase space

We develop a framework for Large Scale Structure (LSS) perturbation theory, that solves the Vlasov-Poisson system of equations for the distribution function in full phase space. This approach relaxes the usual apriori assumption of negligible velocity dispersion underlying the Standard Perturbation Theory (SPT). We apply the new method to rederive the usual SPT kernels up to third order in the perturbative expansion. We also show that a counterterm, identical to the one introduced by standard Effective Field Theory (EFT) methods, naturally arises within our framework. We finish by making a precise connection to EFT techniques, which reveals the necessity of the EFTofLSS to self-consistently model the long-wavelength fluid, and illustrates the importance of having theoretical control over short distance fluctuations.

Cosmological perturbation theory in GR and beyond↗
NASA NTRS1999

Reduced Order Models Based on Linear and Nonlinear Aerodynamic Impulse Responses

This paper discusses a method for the identification and application of reduced-order models based on linear and nonlinear aerodynamic impulse responses. The Volterra theory of nonlinear systems and an appropriate kernel identification technique are described. Insight into the nature of kernels is provided by applying the method to the nonlinear Riccati equation in a non-aerodynamic application. The method is then applied to a nonlinear aerodynamic model of an RAE 2822 supercritical airfoil undergoing plunge motions using the CFL3D Navier-Stokes flow solver with the Spalart-Allmaras turbulence model. Results demonstrate the computational efficiency of the technique.

Silva, Walter A.↗