Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel methods”

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 1,153 records · Page 64

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗

Cross-correlation of gravitational lensing from DES Science Verification data with SPT and Planck lensing

We measure the cross-correlation between weak lensing of galaxy images and of the cosmic microwave background (CMB). The effects of gravitational lensing on different sources will be correlated if the lensing is caused by the same mass fluctuations. We use galaxy shape measurements from 139 deg(2) of the Dark Energy Survey (DES) Science Verification data and overlapping CMB lensing from the South Pole Telescope (SPT) and Planck. The DES source galaxies have a median redshift of z(med) similar to 0.7, while the CMB lensing kernel is broad and peaks at z similar to 2. The resulting cross-correlation is maximally sensitive to mass fluctuations at z similar to 0.44. Assuming the Planck 2015 best-fitting cosmology, the amplitude of the DESxSPT cross-power is found to be A(SPT) = 0.88 +/- 0.30 and that from DESxPlanck to be A(Planck) = 0.86 +/- 0.39, where A = 1 corresponds to the theoretical prediction. These are consistent with the expected signal and correspond to significances of 2.9 sigma and 2.2 sigma, respectively. We demonstrate that our results are robust to a number of important systematic effects including the shear measurement method, estimator choice, photo-z uncertainty and CMB lensing systematics. We calculate a value of A = 1.08 +/- 0.36 for DESxSPT when we correct the observations with a simple intrinsic alignment model. With three measurements of this cross-correlation now existing in the literature, there is not yet reliable evidence for any deviation from the expected LCDM level of cross-correlation. We provide forecasts for the expected signal-to-noise ratio of the combination of the five-year DES survey and SPT-3G.

Kirk, D.↗

Kernel PLS-SVC for Linear and Nonlinear Discrimination

A new methodology for discrimination is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by support vector machines for classification. Close connection of orthonormalized PLS and Fisher's approach to linear discrimination or equivalently with canonical correlation analysis is described. This gives preference to use orthonormalized PLS over principal component analysis. Good behavior of the proposed method is demonstrated on 13 different benchmark data sets and on the real world problem of the classification finger movement periods versus non-movement periods based on electroencephalogram.

Rosipal, Roman↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Efficacy of the symmetry-adapted basis for ab initio nucleon-nucleus interactions for light- and intermediate-mass nuclei

We study the efficacy of a new ab initio framework that combines the symmetry-adapted (SA) no-core shell-model approach with the resonating group method (RGM) for unified descriptions of nuclear structure and reactions. We obtain ab initio neutron-nucleus interactions for 4 He, 16 O, and 20 Ne targets, starting with realistic nucleon-nucleon potentials. We discuss the effect of increasing model space sizes and symmetry-based selections on the SA-RGM norm and direct potential kernels, as well as on phase shifts, which are the input to calculations of cross sections. We demonstrate the efficacy of the SA basis and its scalability with particle numbers and model space dimensions, with a view toward ab initio descriptions of nucleon scattering and capture reactions up through the medium-mass region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Excitation energies from particle-particle random phase approximation with accurate optimized effective potentials

The optimized effective potential (OEP) that gives accurate Kohn-Sham (KS) orbitals and orbital energies can be obtained from a given reference electron density. These OEP-KS orbitals and orbital energies are used here for calculating electronic excited states with the particle-particle random phase approximation (pp-RPA). Our calculations allow the examination of pp-RPA excitation energies with the exact KS density functional theory (DFT). Various input densities are investigated. Specifically, the excitation energies using the OEP with the electron densities from the coupled-cluster singles and doubles method display the lowest mean absolute error from the reference data for the low-lying excited states. This study probes into the theoretical limit of the pp-RPA excitation energies with the exact KS-DFT orbitals and orbital energies. We believe that higher-order correlation contributions beyond the pp-RPA bare Coulomb kernel are needed in order to achieve even higher accuracy in excitation energy calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Unsupervised atomic data mining via multi-kernel graph autoencoders for machine learning force fields

Constructing a chemically diverse dataset while avoiding sampling bias is critical to training efficient and generalizable force fields. However, in computational chemistry and materials science, many common dataset generation techniques are prone to oversampling regions of the potential energy surface. Furthermore, these regions can be difficult to identify and isolate from each other or may not align well with human intuition, making it challenging to systematically remove bias in the dataset. While traditional clustering and pruning (down-sampling) approaches can be useful for this, they can often lead to information loss or a failure to properly identify distinct regions of the potential energy surface due to difficulties associated with the high dimensionality of atomic descriptors. In this work, we introduce the Multi-kernel Edge Attention-based Graph Autoencoder (MEAGraph) model, an unsupervised approach for analyzing atomic datasets. MEAGraph combines multiple linear kernel transformations with attention-based message passing to capture geometric sensitivity and enable effective dataset pruning without relying on labels or extensive training. Demonstrated applications on niobium, tantalum, and iron datasets show that MEAGraph efficiently groups similar atomic environments, allowing for the use of basic pruning techniques for removing sampling bias. This approach provides an effective method for representation learning and clustering that can be used for data analysis, outlier detection, and dataset optimization.

Materials science↗

Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms

Advanced ab initio materials simulations face growing challenges as increasing systems and phenomena complexity requires higher accuracy, driving up computational demands. Quantum many-body GW methods are state-of-the-art for treating electronic excited states and couplings but often hindered due to the costly numerical complexity. Here, we present innovative implementations of advanced GW methods within the BerkeleyGW package, enabling large-scale simulations on Frontier and Aurora exascale platforms. Our approach demonstrates exceptional versatility for complex heterogeneous systems with up to 17,574 atoms, along with achieving true performance portability across GPU architectures. We demonstrate excellent strong and weak scaling to thousands of nodes, reaching double-precision core-kernel performance of 1.069 ExaFLOP/s on Frontier (9,408 nodes) and 707.52 PetaFLOP/s on Aurora (9,600 nodes), corresponding to 59.45% and 48.79% of peak, respectively. Our work demonstrates a breakthrough in utilizing exascale computing for quantum materials simulations, delivering unprecedented predictive capabilities for rational designs of future quantum technologies.

Zhang, Benran [University of Southern California, ↗

Revision of laser-induced damage threshold evaluation from damage probability data

In this study, the applicability of commonly used Damage Frequency Method (DFM) is addressed in the context of Laser-Induced Damage Threshold (LIDT) testing with pulsed lasers. A simplified computer model representing the statistical interaction between laser irradiation and randomly distributed damage precursors is applied for Monte Carlo experiments. The reproducibility of LIDT predicted from DFM is examined under both idealized and realistic laser irradiation conditions by performing numerical 1-on-1 tests. A widely accepted linear fitting resulted in systematic errors when estimating LIDT and its error bars. For the same purpose, a Bayesian approach was proposed. A novel concept of parametric regression based on varying kernel and maximum likelihood fitting technique is introduced and studied. Such approach exhibited clear advantages over conventional linear fitting and led to more reproducible LIDT evaluation. Furthermore, LIDT error bars are obtained as a natural outcome of parametric fitting which exhibit realistic values. The proposed technique has been validated on two conventionally polished fused silica samples (355 nm, 5.7 ns).

36 MATERIALS SCIENCE↗

WE-AB-303-09: Rapid Projection Computations for On-Board Digital Tomosynthesis in Radiation Therapy

Purpose: To facilitate fast and accurate iterative volumetric image reconstruction from limited-angle on-board projections. Methods: Intrafraction motion hinders the clinical applicability of modern radiotherapy techniques, such as lung stereotactic body radiation therapy (SBRT). The LIVE system may impact clinical practice by recovering volumetric information via Digital Tomosynthesis (DTS), thus entailing low time and radiation dose for image acquisition during treatment. The DTS is estimated as a deformation of prior CT via iterative registration with on-board images; this shifts the challenge to the computational domain, owing largely to repeated projection computations across iterations. We address this issue by composing efficient digital projection operators from their constituent parts. This allows us to separate the static (projection geometry) and dynamic (volume/image data) parts of projection operations by means of pre-computations, enabling fast on-board processing, while also relaxing constraints on underlying numerical models (e.g. regridding interpolation kernels). Further decoupling the projectors into simpler ones ensures the incurred memory overhead remains low, within the capacity of a single GPU. These operators depend only on the treatment plan and may be reused across iterations and patients. The dynamic processing load is kept to a minimum and maps well to the GPU computational model. Results: We have integrated efficient, pre-computable modules for volumetric ray-casting and FDK-based back-projection with the LIVE processing pipeline. Our results show a 60x acceleration of the DTS computations, compared to the previous version, using a single GPU; presently, reconstruction is attained within a couple of minutes. The present implementation allows for significant flexibility in terms of the numerical and operational projection model; we are investigating the benefit of further optimizations and accurate digital projection sub-kernels. Conclusion: Composable projection operators constitute a versatile research tool which can greatly accelerate iterative registration algorithms and may be conducive to the clinical applicability of LIVE. National Institutes of Health Grant No. R01-CA184173; GPU donation by NVIDIA Corporation.

60 APPLIED LIFE SCIENCES↗

Are you using the right probe molecules for assessing the textural properties of metal–organic frameworks?

Textural properties—such as the surface area, pore size distribution, and pore volume—are at the forefront of characterization for porous materials. Therefore, it is essential to accurately and reproducibly report a material's textural properties as they could ultimately dictate its applicability. This work aims to provide insightful and comprehensive studies of textural properties for a set of metal–organic frameworks (MOFs), a class of porous materials, using various gases to equip researchers in the field with a helpful guide and reference. Here, we selected a series of nine MOFs with different surface areas, pore sizes, shapes, and chemical environments to represent a wide range of materials. We probed the textural properties of these MOFs using traditional and distinctive gases: N 2 , Kr and O 2 at 77 K, Ar at 87 K, and CO 2 at 195 and 273 K. With regard to surface area, we discuss the validity and challenges associated with the current BET method, the importance of utilizing the Rouquerol et al. consistency criteria to ensure accuracy and reproducibility, and the recommended gas probes for certain materials. For pore size distribution, we discuss the efficacy of each probe for determining the pore sizes within a porous material relative to the calculated distribution from its crystal structure, the limitations of current computational kernels used to calculate pore size distributions, and the need for advanced kernels to envelope the diversity of porous materials. Finally, for pore volume, we discuss the use of the Gurvich rule to obtain the total pore volume in comparison with calculated values from crystal structures and its consistency as a metric for porous materials. Ultimately, we hope that this article will aid researchers in characterizing the textural properties of porous materials and encourage the development of new kernels capable of encompassing the complexity of MOFs and other porous materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Iterative reconstruction excursions for Baryon Acoustic Oscillations and beyond

ABSTRACT The density field reconstruction technique has been widely used for recovering the baryon acoustic oscillation (BAO) feature in galaxy surveys that has been degraded due to non-linearities. Recent studies advocated adopting iterative steps to improve the recovery much beyond that of the standard technique. In this paper, we investigate the performance of a few selected iterative reconstruction techniques focusing on the BAO and the broad-band shape of the two-point clustering. We include redshift-space distortions, halo bias, and shot noise and inspect the components of the reconstructed field in Fourier space and in configuration space using both density field-based reconstruction and displacement field-based reconstruction. We find that the displacement field reconstruction becomes quickly challenging in the presence of non-negligible shot noise and therefore present surrogate methods that can be practically applied to a much more sparse field such as galaxies. For a galaxy field, implementing a debiasing step to remove the Lagrangian bias appears crucial for the displacement field reconstruction. We show that the iterative reconstruction does not substantially improve the BAO feature beyond an aggressively optimized standard reconstruction with a small smoothing kernel. However, we find taking iterative steps allows us to use a small smoothing kernel more ‘stably’, i.e. without causing a substantial deviation from the linear power spectrum on large scales. In one specific example we studied, we find that a deviation of 13 per cent in $P(k\sim 0.1\, h{\rm \,\,Mpc^{-1}})$ with an aggressive standard reconstruction can reduce to 3–4 per cent with iterative steps.

79 ASTRONOMY AND ASTROPHYSICS↗

Laminar-to-turbulent flame transition and cycle-to-cycle variations in large eddy simulation of spark-ignition engines

This paper investigates the effect of laminar-to-turbulent flame transition modeling on the prediction of cycle-to-cycle variations (CCVs) in large eddy simulation (LES) of spark-ignition (SI) engines. A laminar-to-turbulent flame transition model that describes the non-equilibrium sub-filter flame speed evolution during an early stage of flame kernel growth is developed. In the present model, the flame transition is characterized by the flame kernel size at which the flame transition ends, defined here as the flame transition scale. The proposed model captures the effects that variations in a turbulent flow field have on the evolution of early-stage burning rates, through variations in the flame transition scale. The proposed flame transition model is combined with the front propagation formulation (FPF) method and a spark-ignition model to predict CCVs in a gasoline direct injection SI engine. It is found that multi-cycle LES with the proposed flame transition model reproduces experimentally-observed CCVs satisfactorily. When the transition model is not considered or when variations in the transition process are neglected, CCVs are significantly under-predicted for the case considered here. These results indicate the importance of modeling the laminar-to-turbulent flame transition and the effect of turbulence on the transition process, when predicting CCVs, under certain engine conditions. The LES results are also used to analyze sources for variations in the flame transition. It is found, for the present engine case, that the most important source is the cycle-to-cycle variation in the turbulence dissipation rate, which is used to measure the strength of turbulence in the proposed model, near a spark plug. The large-scale velocity field and the variations of the laminar flame speed due to the mixture composition and thermal stratification are also found to be important factors to contribute to the variations in the flame transition.

42 ENGINEERING↗

Performance Results on CPU/GPU Exascale Architectures for OMEGA: The Ocean Model for E3SM Global Applications

The US Department of Energy (DOE) conducts climate simulations on some of the world’s largest supercomputers. These exascale machines use heterogeneous architectures with both CPUs and GPUs, and scientific codes must adapt to make full use of this computing power. Los Alamos National Lab is developing Omega: The Ocean Model for E3SM Global Applications, which is specifically designed for modern exascale computers. It uses external libraries that have been optimized for a variety of architectures to run on different supercomputers. Omega is an unstructured-mesh ocean model based on TRiSK numerical methods. It will be the new ocean component of the DOE’s Energy Exascale Earth System Model (E3SM). The algorithms in Omega follow those of the current ocean component, MPAS-Ocean, but it will be written in C++ rather than Fortran to take advantage of the Kokkos performance portability library. Omega spatial operators are written as Kokkos kernels to run efficiently on both CPUs and GPUs. Work on Omega began in 2023 with a new C++ framework for unstructured mesh partitioning, halo exchanges, parallel IO, and Kokkos interfaces. The current version, Omega-0, is being developed to solve the shallow water equations and at present includes all of the tendency terms but not time stepping. Here we share the results of Omega-0 verification and performance testing. Verification includes unit tests implemented with CTest as well as convergence tests in Polaris, an in-house python package with a large suite of test problems. Performance tests compare simulations conducted on CPUs versus GPUs and across different architectures: tests are run on Frontier, which has AMD “Optimized 3rd Gen EPYC” CPUs and AMD MI250X GPUs, as well as Perlmutter, which is composed of AMD EPYC 7763 CPUs and NVIDIA A100 GPUs.

58 GEOSCIENCES↗

Network packet templating for GPU-initiated communication

Systems, apparatuses, and methods for performing network packet templating for graphics processing unit (GPU)-initiated communication are disclosed. A central processing unit (CPU) creates a network packet according to a template and populates a first subset of fields of the network packet with static data. Next, the CPU stores the network packet in a memory. A GPU initiates execution of a kernel and detects a network communication request within the kernel and prior to the kernel completing execution. Responsive to this determination, the GPU populates a second subset of fields of the network packet with runtime data. Then, the GPU generates a notification that the network packet is ready to be processed. A network interface controller (NIC) processes the network packet using data retrieved from the first subset of fields and from the second subset of fields responsive to detecting the notification.

97 MATHEMATICS AND COMPUTING↗

Population balance modeling of polyurethane foam formation with pressure‐dependent growth kernel

Abstract Polyurethane foams are widely used materials often chosen for their useful characteristics such as low thermal conductivity, ease of application, and high strength‐to‐weight ratios. Computational models are needed to predict the dynamics of the flow and expansion, and the resulting material properties, to improve manufacturing processes. In this paper, a model for PMDI, a water‐blown polyurethane foam, is presented. By extending a kinetics‐based approach by adding bubble‐scale information via a population balance equation (PBE) using the quadrature method of moments, we can track bubble size distributions during foaming. We present results from a three‐dimensional computational fluid dynamics model using arbitrary Lagrangian–Eulerian interface tracking implemented in finite element software. The model compares favorably with experimental data, including dynamics, bubble distributions measured by both camera and diffusion wave spectroscopy, and post‐test bubble size from scanning electron microscopy and density measurements from x‐ray computed tomography.

Ortiz, Weston↗

Machine learning materials properties with accurate predictions, uncertainty estimates, domain guidance, and persistent online accessibility

One compelling vision of the future of materials discovery and design involves the use of machine learning (ML) models to predict materials properties and then rapidly find materials tailored for specific applications. However, realizing this vision requires both providing detailed uncertainty quantification (model prediction errors and domain of applicability) and making models readily usable. At present, it is common practice in the community to assess ML model performance only in terms of prediction accuracy (e.g. mean absolute error), while neglecting detailed uncertainty quantification and robust model accessibility and usability. Here, we demonstrate a practical method for realizing both uncertainty and accessibility features with a large set of models. We develop random forest ML models for 33 materials properties spanning an array of data sources (computational and experimental) and property types (electrical, mechanical, thermodynamic, etc). All models have calibrated ensemble error bars to quantify prediction uncertainty and domain of applicability guidance enabled by kernel-density-estimate-based feature distance measures. All data and models are publicly hosted on the Garden-AI infrastructure, which provides an easy-to-use, persistent interface for model dissemination that permits models to be invoked with only a few lines of Python code. We demonstrate the power of this approach by using our models to conduct a fully ML-based materials discovery exercise to search for new stable, highly active perovskite oxide catalyst materials.

domain of applicability↗

WE-EF-303-09: Proton-Acoustic Range Verification in Proton Therapy

Purpose: We investigated proton-acoustic signals detection for range verification with current ultrasound instruments in typical clinical scenarios. Using simulations that included a realistic noise model, we determined the theoretical minimum dose required to generate detectable proton-acoustic signals. Methods: An analytical model was used to calculate the dose distributions and local pressure rise (per proton) for beams of different energy (100 and 160 MeV) and spot widths (1, 5, and 10 mm) in a water phantom. The acoustic waves propagating from the Bragg peak were modeled by the general 3D pressure wave equation and convolved with Gaussian kernels to simulate various proton pulse widths (0.1 – 10 ms). A realistic PZT ultrasound transducer (5 cm diameter) was simulated with a Butterworth band-pass filter, and ii) randomly generated noise based on a model of thermal noise in the transducer. The signal-to-noise ratio was calculated, determining the minimum number of protons and dose required per pulse. The maximum spatial resolution was also estimated from the signal spectrum. Results: The calculated noise in the transducer was 12–28 mPa, depending on the transducer center frequency (70–380 kHz). The minimum number of protons were on the order of 0.6–6 million per pulse, leading to 3–110 mGy dose per pulse at the Bragg peak, depending on the spot size. The acoustic signal consisted of lower frequencies for wider pulses, leading to lower noise levels, but also worse spatial resolution. The resolution was 1-mm for a 0.1-µs pulse width, but increased to 5-mm for a 10-µs pulse width. Conclusion: We have established minimum dose detection limits for proton-acoustic range validation. These limits correspond to a best case scenario with a large detector with no losses and only detector thermal noise. Feasible proton-acoustic range detection will require at least 10{sup 7} protons per pulse and pulse widths ≤ 1-µs.

60 APPLIED LIFE SCIENCES↗