Engineering Papers⌕ Search

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.

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

At least 559 records · Page 31

A Gaussian Process Regression Reveals No Evidence for Planets Orbiting Kapteyn’s Star

Radial–velocity (RV) planet searches are often polluted by signals caused by gas motion at the star’s surface. Stellar activity can mimic or mask changes in the RVs caused by orbiting planets, resulting in false positives or missed detections. Here we use Gaussian process regression to disentangle the contradictory reports of planets versus rotation artifacts from Kapteyn’s star. To model rotation, we use joint quasiperiodic kernels for the RV and Hα signals, requiring that their periods and correlation timescales be the same. We find that the rotation period of Kapteyn’s star is 125 days, while the characteristic active-region lifetime is 694 days. Adding a planet to the RV model produces a best-fit orbital period of 100 yr, or 10 times the observing time baseline, indicating that the observed RVs are best explained by star rotation only. We also find no significant periodic signals in residual RV data sets constructed by subtracting off realizations of the best-fit rotation model and conclude that both previously reported “planets” are artifacts of the star’s rotation and activity. Our results highlight the pitfalls of using sinusoids to model quasiperiodic rotation signals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wide neural networks with bottlenecks are deep Gaussian processes

There has recently been much work on the "wide limit" of neural networks, where Bayesian neural networks (BNNs) are shown to converge to a Gaussian process (GP) as all hidden layers are sent to infinite width. However, these results do not apply to architectures that require one or more of the hidden layers to remain narrow. In this paper, we consider the wide limit of BNNs where some hidden layers, called "bottlenecks", are held at finite width. The result is a composition of GPs that we term a "bottleneck neural network Gaussian process" (bottleneck NNGP). Although intuitive, the subtlety of the proof is in showing that the wide limit of a composition of networks is in fact the composition of the limiting GPs. We also analyze theoretically a single-bottleneck NNGP, finding that the bottleneck induces dependence between the outputs of a multi-output network that persists through extreme post-bottleneck depths, and prevents the kernel of the network from losing discriminative power at extreme post-bottleneck depths.

97 MATHEMATICS AND COMPUTING↗

Meshfree Multiphysics Damage Modeling of Li-ion Battery Materials

Through repeated charging and discharging cycles, the electrodes of a Li-ion battery experience significant swelling and contraction due to the movement of lithium, also known as intercalation. This research focuses specifically on the chemo-mechanical cracking in the cathode. Because cathode particles are comprised of many randomly-oriented grains, which have highly anisotropic material properties, the expansion and contraction is very non-uniform. As a result, stress concentrations tend to form between grains, which necessitates the modeling of crack propagation largely along grain boundaries and material interfaces. Chemo-mechanical damage models are generally simulated by one of two methods: the cohesive zone model (CZM) and the continuous damage model (CDM). The CZM is more accurate at capturing the sharp discontinuities of a crack but is very computationally expensive and intractable for large-scale models as a result. Conversely, the CDM is easily computed but not well-suited to easily allow for discontinuous field variables, which are inherent across a crack. This study aims to improve the CDM's ability to capture discontinuous cracks. Current versions of the CDM use the finite element method (FEM), which is one of the most widely used approaches for spatial discretization. This research investigates the use of the Reproducing Kernel Particle Method (RKPM), a meshfree method, for spatial discretization and aims to achieve a coupled chemo-mechanical crack propagation model that enhances accuracy while maintaining high computational efficiency. This model features a fully coupled, iterative electrochemistry solution, which informs the meshfree damage model of impending crack formation. To gain a better understanding of how the meshfree model compares to the current FEM model in capturing cathode crack propagation, further investigation is needed.

damage modeling↗

Neural Network Enhanced RKPM for Electrochemical-Mechanical Coupled Damage Modeling of Energy Storage Materials

Energy storage materials undergo significant charge cycling, which makes understanding their reliability and durability fundamental in predicting performance and service life. Strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking, largely along material interfaces and grain boundaries. For Li-ion batteries, for example, lithium moving between electrodes during charging and discharging process causes expansion and contraction of grains, and the strongly anisotropic and nonlinearly [Li]-dependent grain material properties can cause grains to expand into and contract away from each other, leading to chemo-mechanical cracking. In the first part of this work, a RKPM based computational framework for solving the coupled solid-phase lithium conservation with Fickian diffusion and the lithium concentration dependent anisotropic mechanical problem subjected to a highly nonlinear Butler-Volmer boundary condition is introduced. The choice of RKPM completeness conditions for lithium concentration and mechanical deformation fields, and the variational consistency condition for the domain integration of the coupled problem is first determined. In the second part of this work, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1] is leveraged to accurately capture damage and crack propagation throughout the material, by learning the location, orientation, and sharpness of discontinuity while allowing for a coarser nodal distribution than that is necessary for capturing sharp solution transitions using traditional mesh-based methods. NN-RKPM is used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure.

damage modeling↗

Physics Discovery in Nanoplasmonic Systems via Autonomous Experiments in Scanning Transmission Electron Microscopy

Abstract Physics‐driven discovery in an autonomous experiment has emerged as a dream application of machine learning in physical sciences. Here, this work develops and experimentally implements a deep kernel learning (DKL) workflow combining the correlative prediction of the target functional response and its uncertainty from the structure, and physics‐based selection of acquisition function, which autonomously guides the navigation of the image space. Compared to classical Bayesian optimization (BO) methods, this approach allows to capture the complex spatial features present in the images of realistic materials, and dynamically learn structure–property relationships. In combination with the flexible scalarizer function that allows to ascribe the degree of physical interest to predicted spectra, this enables physical discovery in automated experiment. Here, this approach is illustrated for nanoplasmonic studies of nanoparticles and experimentally implemented in a truly autonomous fashion for bulk‐ and edge plasmon discovery in MnPS 3 , a lesser‐known beam‐sensitive layered 2D material. This approach is universal, can be directly used as‐is with any specimen, and is expected to be applicable to any probe‐based microscopic techniques including other STEM modalities, scanning probe microscopies, chemical, and optical imaging.

42 ENGINEERING↗

Boron-Made N 2 : Realization of a B$\equiv$B Triple Bond in the B 2 Al 3 – Cluster

Until now, all B≡B triple bonds have been achieved by adopting two ligands in the L→B≡B←L manner. Herein, we report an alternative route of designing the B≡B bonds based on the assumption that by acquiring two extra electrons, an element with the atomic number Z can have properties similar to those of the element with the atomic number Z + 2. Specifically, we show that due to the electron donation from Al to B, the negatively charged B≡B kernel in the B 2 Al 3 – cluster mimics a triple N≡N bond. Comprehensive computational searches reveal that the global minimum structure of B 2 Al 3 – exhibits a direct B–B distance of 1.553 Å, and its calculated electron vertical detachment energies are in excellent agreement with the corresponding values of the experimental photoelectron spectrum. Chemical bonding analysis revealed one σ and two π bonds between the two B atoms, thus confirming a classical textbook B≡B triple bond, similar to that of N 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Providing performance portable numerics for Intel GPUs

Summary With discrete Intel GPUs entering the high‐performance computing landscape, there is an urgent need for production‐ready software stacks for these platforms. In this article, we report how we enable the Ginkgo math library to execute on Intel GPUs by developing a kernel backed based on the DPC++ programming environment. We discuss conceptual differences between the CUDA and DPC++ programming models and describe workflows for simplified code conversion. We evaluate the performance of basic and advanced sparse linear algebra routines available in Ginkgo's DPC++ backend in the hardware‐specific performance bounds and compare against routines providing the same functionality that ship with Intel's oneMKL vendor library.

97 MATHEMATICS AND COMPUTING↗

HIPLZ: Enabling performance portability for exascale systems

While heterogeneous computing has emerged as a dominant trend in current and future High-Performance Computing (HPC) systems, it is also widely recognized that this shift has led to increased software complexity due to a proliferation of programming systems for different heterogeneous processors. One such example is the Heterogeneous-Compute Interface for Portability from AMD (HIP ), which is composed of a C Runtime API and C++ Kernel Language. Many HPC applications will likely use HIP on future exascale systems (e.g., Frontier and El Capitan), but HIP currently only targets AMD and NVIDIA processors. This limitation creates challenges for users who would also like to run their applications on exascale systems based on other architectures (e.g., Aurora, which is based on Intel hardware) that are currently not targeted by HIP . In this paper, we introduce the design and implementation of HIPLZ , a compiler and runtime system that uses the Intel Level Zero API to support HIP on Intel GPU architectures. We discuss the design of HIPLZ , derived from HIPCL (an implementation of HIP on top of OpenCL ), and portability issues that occur from using the Level Zero runtime as a backend. We evaluate our implementation by running several performance benchmarks and mini-apps written in HIP on Intel architectures using HIPLZ . Our results show that this approach provides competitive performance relative to Intel's OpenCL implementations on Intel Gen9 and UHD Graphics 770 GPUs, while providing good coverage of features needed by HPC applications. Overall, this approach is a promising demonstration of enabling performance portability for exascale systems.

97 MATHEMATICS AND COMPUTING↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Spatial and temporal overlap between hatchery- and natural-origin steelhead and Chinook Salmon during spawning in the Klickitat River, Washington, USA

Abstract Objective A goal of many segregated salmonid hatchery programs is to minimize potential interbreeding between hatchery- and natural-origin fish. Our objective was to assess this on the Klickitat River, Washington, USA. Methods We used radiotelemetry to evaluate spatiotemporal spawning overlap between hatchery- and natural-origin steelhead Oncorhynchus mykiss and spring Chinook Salmon O. tshawytscha. We estimated percentages of tagged fish that spawned naturally in the Klickitat River subbasin, emigrated from the Klickitat River, or died before spawning. A kernel density analysis was used to estimate probability of spatiotemporal overlap between hatchery- and natural-origin spawners. Result For steelhead, 12% of hatchery-origin and 50% of natural-origin fish spawned naturally. For spring Chinook Salmon, 18% of hatchery-origin and 44% of natural-origin fish spawned naturally. Tag loss may result in underestimates in these percentages. Most hatchery-origin steelhead (90%) spawned downstream of river kilometer (rkm) 32, and 75% spawned from November to mid-March. The majority of natural-origin steelhead (64%) spawned upstream of rkm 32, and 75% spawned from mid-March to late May. Spawn timing of hatchery-origin Chinook Salmon (early August to mid-September) overlapped with that of natural-origin Chinook Salmon (late July to late September), and fish of both origins spawned in the same 30-km reach of the river. We estimated the percentage of hatchery-origin spawners (pHOS) on the natural spawning grounds to be 12% for steelhead and 40% for spring Chinook Salmon across all study years. For steelhead, we estimated the overlap probability to be 25% (95% CI = 22.5–28%). For spring Chinook Salmon, tight spatial clustering of hatchery-origin fish resulted in a lower overlap estimate of 21% (13–31%). Conclusion We suggest adjusting pHOS estimates using these overlap estimates or similar spatiotemporal data on actual spawner proximity and possible interactions, and that these types of analyses be used in conjunction with gene flow analysis to accurately evaluate effects of individual hatchery programs.

Zendt, Joseph S.↗

Lagrangian–Eulerian multidensity topology optimization with the material point method

Abstract In this paper, a hybrid Lagrangian–Eulerian topology optimization (LETO) method is proposed to solve the elastic force equilibrium with the Material Point Method (MPM). LETO transfers density information from freely movable Lagrangian carrier particles to a fixed set of Eulerian quadrature points. This transfer is based on a smooth radial kernel involved in the compliance objective to avoid the artificial checkerboard pattern. The quadrature points act as MPM particles embedded in a lower‐resolution grid and enable a subcell multidensity resolution of intricate structures with a reduced computational cost. A quadrature‐level connectivity graph‐based method is adopted to avoid the artificial checkerboard issues commonly existing in multiresolution topology optimization methods. Numerical experiments are provided to demonstrate the efficacy of the proposed approach.

Li, Yue↗

A duality-based coupling of Cosserat crystal plasticity and phase field theories for modeling grain refinement

High-rate deformation processes of metals entail intense grain refinement and special attention needs to be paid to capture the evolution of microstructure. In this article, a new formulation for coupling Cosserat crystal plasticity and phase field is developed. A common approach is to penalize kinematic incompatibility between lattice orientation and displacement-based elastic rotation. However, this can lead to significant solution sensitivity to the penalty parameter, resulting in low accuracy and convergence rates. To address these issues, a duality-based formulation is developed which directly imposes the rotational kinematic compatibility. A weak inf-sup-based skew-symmetric stress projection is introduced to suppress instabilities present in the dual formulation. An additional least squares stabilization is introduced to suppress the spurious lattice rotation with a suitable parameter range derived analytically and validated numerically. The required high-order continuity is attained by the reproducing kernel approximation. It is observed that equal order displacement-rotation-phase field approximations are stable, which allows efficient employment of the same set of shape functions for all independent variables. The proposed formulation is shown to yield superior accuracy and convergence with marginal parameter sensitivity compared to the penalty-based approach and successfully captures the dominant rotational recrystallization mechanism including block dislocation structures and grain boundary migration.

42 ENGINEERING↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗

Non-uniform active learning for Gaussian process models with applications to trajectory informed aerodynamic databases

The ability to non-uniformly weight the input space is desirable for many applications, and has been explored for space-filling approaches. Increased interests in linking models, such as in a digital twinning framework, increases the need for sampling emulators where they are most likely to be evaluated. In particular, here we apply non-uniform sampling methods for the construction of aerodynamic databases. This paper combines non-uniform weighting with active learning for Gaussian Processes (GPs) to develop a closed-form solution to a non-uniform active learning criterion. We accomplish this by utilizing a kernel density estimator as the weight function. We demonstrate the need and efficacy of this approach with an atmospheric entry example that accounts for both model uncertainty as well as the practical state space of the vehicle, as determined by forward modeling within the active learning loop.

42 ENGINEERING↗

Surface analysis insight note: Differentiation methods applicable to noisy data for determination of sp2‐ versus sp3‐hybridization of carbon allotropes and AES signal strengths

The derivatives of the spectra are commonly used for quantification in Auger Electron Spectroscopy (AES) spectra, while the derivative of the KLL C Auger line has proven to be valuable in obtaining a measure of the relative proportions of sp 2 ‐ and sp 3 ‐hybridization using the D‐parameter in both AES and X‐ray Photoelectron Spectroscopy (XPS). Differentiation of X‐ray Photoelectron Spectroscopy (XPS) and Auger Electron Spectroscopy (AES) spectra by numerical means is presented and illustrated for polymeric, such as PEEK and Nylon, as well as for graphitic materials including highly ordered pyrolytic graphite and graphene oxide. The most commonly available Savitzky–Golay method is explained mathematically and developed through the case of constructing a 5‐point quadratic polynomial convolution kernel suitable for differentiating spectra of adequate signal to noise. The concept of differentiation of spectra where signal to noise is less than adequate is also developed. Two alternative strategies to Savitzky–Golay differentiation are presented, which fit curves to data that allow derivatives to be obtained where Savitzky–Golay would otherwise fail. These alternative methods involve constructing a parametric curve that fits data over the entire energy interval of interest. Derivatives of spectra are then obtained by differentiating these parametric curves directly. A comparison of results for different materials for which specific sp 2 ‐ vs sp 3 ‐hybridized carbon proportions are of interest is used to emphasize the importance of characterizing methods used to differentiate spectra and understanding the characteristics of instrumentation used to measure spectra. The case for using Principal Component Analysis noise reduction with C KLL spectra is made for spectra collected from a heterogeneous graphene oxide sample.

Fairley, Neal↗

Automated Experiments of Local Non–Linear Behavior in Ferroelectric Materials

An automated experiment in multimodal imaging to probe structural, chemical, and functional behaviors in complex materials and elucidate the dominant physical mechanisms that control device function is developed and implemented. Here, the emergence of non-linear electromechanical responses in piezoresponse force microscopy (PFM) is explored. Non-linear responses in PFM can originate from multiple mechanisms, including intrinsic material responses often controlled by domain structure, surface topography that affects the mechanical phenomena at the tip-surface junction, and the presence of surface contaminants. Using an automated experiment to probe the origins of non-linear behavior in ferroelectric lead titanate (PTO) and ferroelectric Al 0.93 B 0.07 N films, it is found that PTO shows asymmetric nonlinear behavior across a/c domain walls and a broadened high nonlinear response region around c/c domain walls. In contrast, for Al 0.93 B 0.07 N, well-poled regions show high linear piezoelectric responses, when paired with low non-linear responses regions that are multidomain show low linear responses and high nonlinear responses. It is shown that formulating dissimilar exploration strategies in deep kernel learning as alternative hypotheses allows for establishing the preponderant physical mechanisms behind the non-linear behaviors, suggesting that automated experiments can potentially discern between competing physical mechanisms. Furthermore, this technique can also be extended to electron, probe, and chemical imaging.

36 MATERIALS SCIENCE↗

Sparse Matrix-Based HPC Tomography

Tomographic imaging has benefited from advances in X-ray sources, detectors and optics to enable novel observations in science, engineering and medicine. These advances have come with a dramatic increase of input data in the form of faster frame rates, larger fields of view or higher resolution, so high performance solutions are currently widely used for analysis. Tomographic instruments can vary significantly from one to another, including the hardware employed for reconstruction: from single CPU workstations to large scale hybrid CPU/GPU supercomputers. Furthermore, flexibility on the software interfaces and reconstruction engines are also highly valued to allow for easy development and prototyping. This paper presents a novel software framework for tomographic analysis that tackles all aforementioned requirements. The proposed solution capitalizes on the increased performance of sparse matrix-vector multiplication and exploits multi-CPU and GPU reconstruction over MPI. Furthermore, the solution is implemented in Python and relies on CuPy for fast GPU operators and CUDA kernel integration, and on SciPy for CPU sparse matrix computation. As opposed to previous tomography solutions that are tailor-made for specific use cases or hardware, the proposed software is designed to provide flexible, portable and high-performance operators that can be used for continuous integration at different production environments, but also for prototyping new experimental settings or for algorithmic development. The experimental results demonstrate how our implementation can even outperform state-of-the-art software packages used at advanced X-ray sources worldwide.

97 MATHEMATICS AND COMPUTING↗