Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gaussian basis”

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 109 records · Page 6

Computationally efficient subglacial drainage modelling using Gaussian process emulators: GlaDS-GP v1.0

Subglacial drainage models represent water flow at the ice–bed interface through coupled distributed and channelized systems to determine water pressure, discharge, and drainage system geometry. While they are used to understand processes such as the relationship between surface melt and ice flow, the number of uncertain model parameters and the computational cost of running models makes it difficult to adequately explore the high-dimensional parameter space and evaluate uncertainty in model predictions. Here, we develop Gaussian process (GP) emulators that make fast predictions with associated uncertainty of subglacial drainage model outputs. Using a truncated principal component (PC) basis representation, we construct a GP emulator for diurnally averaged subglacial water pressure. We also explore emulation of scalar variables describing drainage efficiency and configuration. We train the emulators using ensembles of up to 512 simulations varying eight parameters of the Glacier Drainage System (GlaDS) model on a synthetic domain intended to represent an ice-sheet margin. The emulators make predictions ∼ 1000 times faster than GlaDS simulations, with errors <3 % for the water pressure field and ∼ 5 %–9 % for drainage efficiency and configuration. We apply the emulators to explore the eight-dimensional parameter space by computing variance-based parameter sensitivity indices, finding that three parameters (ice flow coefficient, bed bump aspect ratio, and the subglacial cavity system conductivity) explain 90 % of the variance in modelled water pressure in response to parameter changes. The GP emulator approach described here is well suited to integrating observational data with models to make calibrated, credible predictions of subglacial drainage.

58 GEOSCIENCES↗

Particle deceleration for collective QED signatures

Frequency upshifts have been proposed as a first experimental signature of collective effects in quantum electrodynamic cascade generated electron–positron pair plasmas. Since the high effective masses of generated pairs will reduce any frequency change, stopped pairs at a minimal Lorentz factor in the lab frame were thought to be the dominant contribution to the laser upshift. However, we demonstrate that only considering stopped particles unduly neglects the contributions of particles re-accelerated in the laser propagation direction. Re-accelerated particles should, on a per particle basis, affect the laser more strongly and over a much longer timescale. To maximize particle contributions to the laser upshift, we consider a Laguerre–Gaussian (LG) mode laser beam to better reflect generated pairs. Furthermore, the LG mode does not have an advantage in particle deceleration and re-acceleration when compared against a Gaussian beam, but the LG mode can maintain particle contributions for a longer duration, allowing for more pair density accumulation. Deceleration with a structured beam to keep pairs within the laser should create a larger upshift, thereby lowering the demands on the driving laser.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fully self-consistent finite-temperature $GW$ in Gaussian Bloch orbitals for solids

In this work, we present algorithmic and implementation details for the fully self-consistent finite-temperature $GW$ method in Gaussian Bloch orbitals for solids. Our implementation is based on the finite-temperature Green's function formalism in which all equations are solved on the imaginary axis, without resorting to analytical continuation during the self-consistency. No quasiparticle approximation is employed and all matrix elements of the self-energy are explicitly evaluated. The method is tested by evaluating the band gaps of selected semiconductors and insulators. We show agreement with other, differently formulated, finite-temperature sc ⁢$GW$ implementations when finite-size corrections and basis-set errors are taken into account. By migrating computationally intensive calculations to graphics processing units, we obtain scalable results on large supercomputers with nearly optimal performance. Our work demonstrates the applicability of Gaussian orbital based sc⁢ $GW$ for ab initio correlated material simulations and provides a sound starting point for embedding methods built on top of $GW$.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Band structures and Z 2 invariants of two-dimensional transition metal dichalcogenide monolayers from fully relativistic Dirac-Kohn-Sham theory using Gaussian-type orbitals

Two-dimensional (2D) materials exhibit a wide range of remarkable phenomena, many of which owe their existence to the relativistic spin-orbit coupling (SOC) effects. To understand and predict properties of materials containing heavy elements, such as the transition-metal dichalcogenides (TMDs), relativistic effects must be taken into account in first-principles calculations. We present an all-electron method based on the four-component Dirac Hamiltonian and Gaussian-type orbitals (GTOs) that overcomes complications associated with linear dependencies and ill-conditioned matrices that arise when diffuse functions are included in the basis. Until now, there has been no systematic study of the convergence of GTO basis sets for periodic solids either at the nonrelativistic or the relativistic level. Here, in this study, we provide such a study of relativistic band structures of the 2D TMDs in the hexagonal (2H), tetragonal (1T), and distorted tetragonal (1T') structures, along with a discussion of their SOC-driven properties (Rashba splitting and Z 2 topological invariants). We demonstrate the viability of our approach even when large basis sets with multiple basis functions involving various valence orbitals (denoted triple- and quadruple-ζ) are used in the relativistic regime. Our method does not require the use of pseudopotentials and provides access to all electronic states within the same framework. Our study paves the way for direct studies of material properties, such as the parameters in spin Hamiltonians, that depend heavily on the electron density near atomic nuclei where relativistic and SOC effects are the strongest.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗

Multi-objective optimization of peel and shear strengths in ultrasonic metal welding using machine learning-based response surface methodology

Ultrasonic metal welding (UMW) is a solid-state joining technique with varied industrial applications. Despite of its numerous advantages, UMW has a relative narrow operating window and is sensitive to variations in process conditions. As such, it is imperative to quantitatively characterize the influence of welding parameters on the resulting joint quality. The quantification model can be subsequently used to optimize the parameters. Conventional response surface methodology (RSM) usually employs linear or polynomial models, which may not be able to capture the intricate, nonlinear input-output relationships in UMW. Furthermore, some UMW applications call for simultaneous optimization of multiple quality indices such as peel strength, shear strength, electrical conductivity, and thermal conductivity. To address these challenges, this paper develops a machine learning (ML)-based RSM to model the input-output relationships in UMW and jointly optimize two quality indices, namely, peel and shear strengths. The performance of various ML methods including spline regression, Gaussian process regression (GPR), support vector regression (SVR), and conventional polynomial regression models with different orders is compared. A case study using experimental data shows that GPR with radial basis function (RBF) kernel and SVR with RBF kernel achieve the best prediction accuracy. The obtained response surface models are then used to optimize a compound joint strength indicator that is defined as the average of normalized shear and peel strengths. In addition, the case study reveals different patterns in the response surfaces of shear and peel strengths, which has not been systematically studied in the literature. While developed for the UMW application, the method can be extended to other manufacturing processes.

42 ENGINEERING↗

Extending GPU-accelerated Gaussian integrals in the TeraChem software package to f type orbitals: Implementation and applications

Here, the increasing availability of graphics processing units (GPUs) for scientific computing has prompted interest in accelerating quantum chemical calculations through their use. However, the complexity of integral kernels for high angular momentum basis functions often limits the utility of GPU implementations with large basis sets or for metal containing systems. In this work, we report the implementation of f function support in the GPU-accelerated TeraChem software package through the development of efficient kernels for the evaluation of Hamiltonian integrals. The high efficiency of the resulting code is demonstrated through density functional theory (DFT) calculations on increasingly large organic molecules and transition metal complexes, as well as coupled cluster singles and doubles calculations on water clusters. Preliminary investigations into Ni(I) catalysis with DFT and the photochemistry of MnH(CH 3 ) with complete active space self-consistent field are also carried out. Overall, our GPU-accelerated software appears to be well-suited for fast simulation of large transition metal containing systems, as well as organic molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Constrained curve fitting for semi-parametric models with radial basis function networks

Common to many analysis pipelines in lattice gauge theory and the broader scientific discipline is the need to fit a semi-parametric model to data. We propose a fit method that utilizes a radial basis function network to approximate the non-parametric component of such models. The approximate parametric model is fit to data using the basin hopping global optimization algorithm. Parameter constraints are enforced through Gaussian priors. The viability of our method is tested by examining its use in a finite-size scaling analysis of the $q$-state Potts model and $p$-state clock model with $q=2,3$ and $p=4,\infty$.

Peterson, Curtis T.↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

Measurement of the galaxy-velocity power spectrum of DESI tracers with the kinematic Sunyaev-Zeldovich effect using DESI DR2 and ACT DR6

Joint analyses of high-resolution CMB temperature maps with galaxy surveys provide a unique way to reconstruct the radial velocity field of the underlying matter distribution via the kinematic Sunyaev-Zeldovich (kSZ) effect. Using data from the Atacama Cosmology Telescope (ACT) DR6 and the Dark Energy Spectroscopic Instrument (DESI) DR2, we present radial velocity reconstructions for luminous red galaxies (LRGs), emission-line galaxies (ELGs), and quasars (QSOs). Leveraging the spectroscopic data, we are able to reliably model the foreground contamination and report a negligible impact on our main observables. We detect the velocity-galaxy cross-correlation at $17.0σ$ for LRGs, and for the first time, at $8.3σ$ for ELGs and $6.8σ$ for QSOs. We further report the first detection of the velocity-velocity correlation using LRGs at $3.1σ$, as well as the highest cumulative detection of the kSZ effect to date at $20.8 σ$. Similarly to previous results, we find a lower amplitude of the kSZ signal compared to our fiducial halo model prediction and electron profile assuming a Battaglia profile. Combining these new observables, we obtain constraints on local-type primordial non-Gaussianity (PNG): $f_{\rm NL}^{\rm loc} = 15.9_{-34.4}^{+34.6}$ at 68% confidence, which represents the tightest constraint to date derived from the velocity field. The measurements presented here already exhibit lower noise on a per-mode basis than the galaxy auto-correlation on the largest scales, $k<0.004~\rm{Mpc^{-1}}$, highlighting the key role these observables will play in the context of future CMB experiments such as the Simons Observatory.

Chaussidon, Edmond [LBL, Berkeley] (ORCID:00000001↗

End-to-End Automated Segmentation Framework for Four-Dimensional Scanning Transmission Electron Microscopy Data

Four-dimensional scanning transmission electron microscopy (4D-STEM) is powerful for rapidly characterizing arrays of nanoparticles produced via high-throughput synthesis. However, such 4D-STEM datasets typically contain thousands of nanoparticles, each characterized by thousands of diffraction patterns spatially distributed across the nanoparticle, necessitating efficient and comprehensive analysis. We propose an end-to-end segmentation framework to automatically segment each nanoparticle into regions with distinct composition/orientation of crystal grains, using only the 4D-STEM data. Bragg disk information is extracted in a physics-informed manner from the diffraction patterns at each spatial location and combined with the real space coordinates to form feature vectors. These feature vectors are then used as inputs to a Gaussian mixture model (GMM) to segment the nanoparticle into distinct regions. We also develop two visualization tools based on the GMM outputs to infer the interface transition and the degree of superposition. Our framework comprehensively integrates machine learning tools and physics knowledge, and provides a basis for substantially compressing enormous 4D-STEM datasets, e.g., by replacing the full 4D-STEM dataset for each nanoparticle with only a single set of Bragg disk features for each distinct crystal grain identified in the nanoparticle. In this article, we demonstrate the power of our framework by presenting results for real, complex datasets.

47 OTHER INSTRUMENTATION↗

Machine Learning-Based Classification of Lignocellulosic Biomass from Pyrolysis-Molecular Beam Mass Spectrometry Data

High-throughput analysis of biomass is necessary to ensure consistent and uniform feedstocks for agricultural and bioenergy applications and is needed to inform genomics and systems biology models. Pyrolysis followed by mass spectrometry such as molecular beam mass spectrometry (py-MBMS) analyses are becoming increasingly popular for the rapid analysis of biomass cell wall composition and typically require the use of different data analysis tools depending on the need and application. Here, the authors report the py-MBMS analysis of several types of lignocellulosic biomass to gain an understanding of spectral patterns and variation with associated biomass composition and use machine learning approaches to classify, differentiate, and predict biomass types on the basis of py-MBMS spectra. Py-MBMS spectra were also corrected for instrumental variance using generalized linear modeling (GLM) based on the use of select ions relative abundances as spike-in controls. Machine learning classification algorithms e.g., random forest, k-nearest neighbor, decision tree, Gaussian Naïve Bayes, gradient boosting, and multilayer perceptron classifiers were used. The k-nearest neighbors (k-NN) classifier generally performed the best for classifications using raw spectral data, and the decision tree classifier performed the worst. After normalization of spectra to account for instrumental variance, all the classifiers had comparable and generally acceptable performance for predicting the biomass types, although the k-NN and decision tree classifiers were not as accurate for prediction of specific sample types. Gaussian Naïve Bayes (GNB) and extreme gradient boosting (XGB) classifiers performed better than the k-NN and the decision tree classifiers for the prediction of biomass mixtures. The data analysis workflow reported here could be applied and extended for comparison of biomass samples of varying types, species, phenotypes, and/or genotypes or subjected to different treatments, environments, etc. to further elucidate the sources of spectral variance, patterns, and to infer compositional information based on spectral analysis, particularly for analysis of data without a priori knowledge of the feedstock composition or identity.

59 BASIC BIOLOGICAL SCIENCES↗

Reinforcement Learning via Gaussian Processes with Neural Network Dual Kernels

While deep neural networks (DNNs) and Gaussian Processes (GPs) are both popularly utilized to solve problems in reinforcement learning, both approaches feature undesirable drawbacks for challenging problems. DNNs learn complex non-linear embeddings, but do not naturally quantify uncertainty and are often data-inefficient to train. GPs infer posterior distributions over functions, but popular kernels exhibit limited expressivity on complex and high-dimensional data. Fortunately, recently discovered conjugate and neural tangent kernel functions encode the behavior of overparameterized neural networks in the kernel domain. We demonstrate that these kernels can be efficiently applied to regression and reinforcement learning problems by analyzing a baseline case study.We apply GPs with neural network dual kernels to solve reinforcement learning tasks for the first time. We demonstrate, using the well understood mountain-car problem, that GPs empowered with dual kernels perform at least as well as those using the conventional radial basis function kernel. Finally, we conjecture that by inheriting the probabilistic rigor of GPs and the powerful embedding properties of DNNs, GPs using NN dual kernels will empower future reinforcement learning models on difficult domains.

97 MATHEMATICS AND COMPUTING↗

Revisiting the Optical Spectrum of the Plutonyl Ion (PuO 2 ) 2+ in 1 M HClO 4

The analysis of the solution absorption spectrum of the plutonyl ion in an aqueous environment was given by Eisenstein and Pryce (E&P) in 1968. In 2011 a new spectrum was published of the (PuO 2 ) 2+ ion in 1 M HClO 4 . We have been provided with the original data of this spectrum and have found in the data a previously unreported low-lying transition at 7385 cm –1 which we have assigned as a magnetic dipole transition. We have fit most of the near-infrared and optical transitions with Gaussian fits and tabulated a new energy level list up to 22,000 cm –1 which mostly agrees with the data of E&P. We assumed a crystal field of D ∞h (only axial symmetry) and utilized the intensity calculations published for the isoelectronic (NpO 2 ) 1+ ion using a complete basis set for the 5f 2 problem including the Coulombic, spin–orbit as well as the crystal field Hamiltonian. Our results differ substantially from those of E&P. Subsequently, we used a truncated Hamiltonian to try to establish the effects of assuming the σ antibonding orbitals are at such high energies that we can ignore their contributions to the lower lying φ and δ orbitals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian calibration of irradiated graphite property models under high temperatures

Graphite under high temperatures and irradiation is central to advanced reactors. We develop a Bayesian calibration framework for graphite property models that explicitly represents model-data mismatch via a Gaussian-process discrepancy. The approach propagates uncertainty from parameters, experimental noise, and model form, with a hierarchical variance structure to capture group and cross-group noise. Using two predictive models across five grades (IG-110, NBG-18, PCEA, NBG-17, 2114) and four properties-irradiation-induced dimension change, creep, Young’s modulus change ratio, and coefficient of thermal expansion change ratio-we obtain average predictive-error reductions of 54%, 65%, 17%, and 17% when discrepancy is included. We illustrate engineering impact with a multiphysics model of a very-high-temperature reactor prismatic reflector brick, analyzing stresses under high fluence and temperature. Accounting for model discrepancy markedly improves predictive accuracy and provides a robust basis for reliable graphite component design in advanced reactors.

36 - MATERIALS SCIENCE↗

Taming the fixed-node error in diffusion Monte Carlo via range separation

By combining density-functional theory (DFT) and wave function theory via the range separation (RS) of the interelectronic Coulomb operator, we obtain accurate fixed-node diffusion Monte Carlo (FN-DMC) energies with compact multi-determinant trial wave functions. In particular, we combine here short-range exchange-correlation functionals with a flavor of selected configuration interaction known as configuration interaction using a perturbative selection made iteratively (CIPSI), a scheme that we label RS-DFT-CIPSI. One of the take-home messages of the present study is that RS-DFT-CIPSI trial wave functions yield lower fixed-node energies with more compact multi-determinant expansions than CIPSI, especially for small basis sets. Indeed, as the CIPSI component of RS-DFT-CIPSI is relieved from describing the short-range part of the correlation hole around the electron-electron coalescence points, the number of determinants in the trial wave function required to reach a given accuracy is significantly reduced as compared to a conventional CIPSI calculation. Importantly, by performing various numerical experiments, we evidence that the RS-DFT scheme essentially plays the role of a simple Jastrow factor by mimicking short-range correlation effects, hence avoiding the burden of performing a stochastic optimization. Considering the 55 atomization energies of the Gaussian-1 benchmark set of molecules, we show that using a fixed value of mu = 0.5 bohr(-1) provides effective error cancellations as well as compact trial wave functions, making the present method a good candidate for the accurate description of large chemical systems.

Scemama, Anthony↗