Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector spaces”

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 37 records · Page 2

Facial Named Entity Recognition by Attention-Based Graph Convolutional Neural Network

In the realm of facial recognition and analysis, the ability to accurately cluster large datasets of facial images stands as a cornerstone for various applications, ranging from security surveillance to user biometric identification. This project evolves a novel approach to facial data clustering by embedding facial images into a high-dimensional vector space using an advanced embedding model trained on separate data and assumes a graph-like structure on the high-dimensional vectors. We find our method works significantly better than common shallow methods.

97 MATHEMATICS AND COMPUTING↗

The structural information filtered features (SIFF) potential: Maximizing information stored in machine-learning descriptors for materials prediction

Machine learning inspired potentials continue to improve the ability for predicting structures of materials. However, many challenges still exist, particularly when calculating structures of disordered systems. These challenges are primarily due to the rapidly increasing dimensionality of the feature-vector space which in most machine-learning algorithms is dependent on the size of the structure. In this article, we present a feature-engineered approach that establishes a set of principles for representing potentials of physical structures (crystals, molecules, and clusters) in a feature space rather than a physically motivated space. Our goal in this work is to define guiding principles that optimize information storage of the physical parameters within the feature representations. In this manner, we focus on keeping the dimensionality of the feature space independent of the number of atoms in the structure. Our Structural Information Filtered Features (SIFF) potential represents structures by utilizing a feature vector of low-correlated descriptors, which correspondingly maximizes information within the descriptor. We present results of our SIFF potential on datasets composed of disordered (carbon and carbon–oxygen) clusters, molecules with C 7 O 2 H 2 stoichiometry in the GDB9-14B dataset, and crystal structures of the form (Al x Ga y In z ) 2 O 3 as proposed in the NOMAD Kaggle competition. Our potential's performance is at least comparable, sometimes significantly more accurate, and often more efficient than other well-known machine-learning potentials for structure prediction. However, primarily, we offer a different perspective on how researchers should consider opportunities in maximizing information storage for features.

36 MATERIALS SCIENCE↗

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗

Importance of Engineered and Learned Molecular Representations in Predicting Organic Reactivity, Selectivity, and Chemical Properties

Machine-readable chemical structure representations are foundational in all attempts to harness machine learning for the prediction of reactivities, selectivities, and chemical properties directly from molecular structure. The featurization of discrete chemical structures into a continuous vector space is a critical phase undertaken before model selection, and the development of new ways to quantitatively encode molecules is an active area of research. Here, we highlight the application and suitability of different representations, from expert-guided “engineered” descriptors to automatically “learned” features, in different prediction tasks relevant to organic and organometallic chemistry, where differing amounts of training data are available. These tasks include statistical models of stereo- and enantioselectivity, thermochemistry, and kinetics developed using experimental and quantum chemical data. The use of expert-guided molecular descriptors provides an opportunity to incorporate chemical knowledge, domain expertise, and physical constraints into statistical modeling. In applications to stereoselective organic and organometallic catalysis, where data sets may be relatively small and 3D-geometries and conformations play an important role, mechanistically informed features can be used successfully to obtain predictive statistical models that are also chemically interpretable. We provide an overview of several recent applications of this approach to obtain quantitative models for reactivity and selectivity, where topological descriptors, quantum mechanical calculations of electronic and steric properties, along with conformational ensembles, all feature as essential ingredients of the molecular representations used. Alternatively, more flexible, general-purpose molecular representations such as attributed molecular graphs can be used with machine learning approaches to learn the complex relationship between a structure and prediction target. This approach has the potential to out-perform more traditional representation methods such as “hand-crafted” molecular descriptors, particularly as data set sizes grow. One area where this is particularly relevant is in the use of large sets of quantum mechanical data to train quantitative structure–property relationships. A general approach toward curating useful data sets and training highly accurate graph neural network models is discussed in the context of organic bond dissociation enthalpies, where this strategy outperforms regression using precomputed descriptors. Finally, we describe how graph neural network predictions can be incorporated into mechanistically informed statistical models of chemical reactivity and selectivity. Once trained, this approach avoids the expensive computational overhead associated with quantum mechanical calculations, while maintaining chemical interpretability. We illustrate examples for which fast predictions of bond dissociation enthalpy and of the identities of radicals formed through cleavage of a molecule’s weakest bond are used in simple physical models of site-selectivity and reactivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗

Evaluating the gradients of localized diabatic state energies and couplings at minimum cost

We calculate the gradients of Boys diabatic state energies and couplings when the electronic vector space is generated by configuration interaction singles. Our approach follows the Lagrangian approach of Paz and Glover (rather than direct differentiation of the adiabatic-to-diabatic approaches that have been published previously). The result is that we achieve a dramatic increase in savings over previous approaches, and the present approach should be immediately useful to scientists focused on electronic relaxation, especially chemists studying electron transfer who wish to go beyond the Condon approximation. Here, a future extension to time-dependent density functional theory in the Tamm–Dancoff approximation is clear.

Chemical physics↗

CSGL: chemical synthesis graph learning for molecule representation

Abstract Motivation Molecule representation learning (MRL) translates molecules into a real vector space, serving as input to downstream tasks in biology, chemistry, and computer science. This article introduces a chemical synthesis graph learning (CSGL) framework, which enhances MRL by considering both the atomic structures of molecules and their roles in chemical reactions through a hierarchical graph representation. Specifically, molecules are first modeled based on their molecular graphs, which capture atomic-level structural information. They are then further refined using a chemical synthesis graph, where nodes represent reactant and product molecule sets, and edges encode chemical transformations between reactants and products (e.g. changes in molecular structures). CSGL optimizes molecular embeddings of reactant and product nodes in a fashion that ensures the embeddings conform to a chemical balance constraint. Results Experimental results show that our method CSGL achieves strong performance on a variety of tasks, including product prediction, reaction classification, and molecular property prediction. Availability and implementation https://github.com/li-2023/CSGL.

Biochemistry & Molecular Biology↗

Detecting damage in composites using volume decomposition analysis of tomographic data

Detection of damage in a single tow ceramic matrix composite specimen has been achieved using orthogonal decomposition of volumetric tomographic datasets collected at four tensile loads. This decomposition approach has been applied at two different length scales: (i) individual fibres and (ii) bulk volumes containing fibres and matrix material. Volumes were first decomposed to feature vectors, orders of magnitude smaller than the original volume they describe, and then comparisons between datasets at different load levels were made in feature vector space. The results show quantitative measurements of damage location, damage morphology and the relative growth of this damage with increased load when compared with a dataset with less or no damage. No prior knowledge of the dataset or training of algorithms is required for damage to be detected, it is only necessary that at least two datasets are available for comparison, e.g. from in situ or repeated scanning measurements. Results are generated on significantly shorter timescales when compared with previous automated approaches to tomography data processing. This approach has the potential to be applied to damage detection in a range of materials through comparisons of volumetric datasets from a range of measurement or computational techniques.

Middleton, Ceri A.↗

Optimizing stochastic algorithms for hadron correlation function computations in lattice QCD using a localized distillation basis

Distillation is a quark-smearing method for the construction of a broad class of hadron operators useful in lattice QCD computations and defined via a projection operator into a vector space of smooth gauge-covariant fields. A new orthonormal basis for this space is constructed which builds in locality. This basis is useful for the construction of stochastic methods to estimate the correlation functions computed in Monte Carlo calculations relevant for hadronic physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Anisotropic magnetic excitations of a frustrated bilinear-biquadratic spin model: Implications for spin waves of detwinned iron pnictides

Elucidating the nature of spin excitations is important to understanding the mechanism of superconductivity in the iron pnictides. Motivated by recent inelastic neutron scattering measurements in the nearly 100% detwinned BaFe 2 As 2 , we study the spin dynamics of an $\textit{S}$ = 1 frustrated bilinear-biquadratic Heisenberg model in the antiferromagnetic phase with wave vector (π, 0). The biquadratic interactions are treated in a dynamical way using a flavor-wave theory in an $\textit{SU}$(3) representation. Besides the dipolar spin wave (magnon) excitations, the biquadratic interactions give rise to quadrupolar excitations at high energies. In this work, we find that the quadrupolar wave significantly influences, in an energy dependent way, the anisotropy between the spin excitation spectra along the (π, 0) and (0, π) directions in the wave vector space. Our theoretical results capture the essential behavior of the spin dynamics measured in the antiferromagnetic phase of the detwinned BaFe 2 As 2 . More generally, our results underscore the importance of electron correlation effects for the microscopic physics of the iron pnictides.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Complexity of the Kronecker Coefficients

Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecker coefficient is proportional to the rank of a projector that can be measured efficiently using a quantum computer. In other words a Kronecker coefficient counts the dimension of the vector space spanned by the accepting witnesses of a QMA verifier, where QMA is the quantum analogue of NP . This implies that approximating the Kronecker coefficients to within a given relative error is not harder than a certain natural class of problems that captures the complexity of estimating thermal properties of quantum many-body systems. A second consequence is that deciding positivity of Kronecker coefficients is contained in QMA , complementing a recent NP -hardness result of Ikenmeyer, Mulmuley, and Walter. We obtain similar results for the related problem of approximating row sums of the character table of the symmetric group. Finally, we discuss an efficient quantum algorithm that approximates normalized Kronecker coefficients to inverse-polynomial additive error. Published by the American Physical Society 2024

Physics↗

Close-coupling approach to electron scattering with multielectron targets

Momentum-space close coupling calculations of electron scattering require removal of spurious and unphysical solutions. Here, we demonstrate here that removal of these solutions involve regulator operators that enforce Pauli exclusion selection rules in addition to removing spurious solutions. The form of a regular operator for e-H scattering has already been established, but a general extension to the multielectron case has been elusive. Here we present a general method for scattering on multielectron targets, atoms, or molecules, ensuring that the scattering solutions obey Pauli-exclusion selection rules. The regulator operator is obtained by finding the null space vectors of the 𝑁+1 electrons of the projectile and target atom scattering system. We demonstrate that this general procedure reduces to the e-H result and provide examples for He- and Li-like targets as well as guidance for implementation.

74 ATOMIC AND MOLECULAR PHYSICS↗

SpeckleNN: a unified embedding for real-time speckle pattern classification in X-ray single-particle imaging with limited labeled examples

With X-ray free-electron lasers (XFELs), it is possible to determine the three-dimensional structure of noncrystalline nanoscale particles using X-ray single-particle imaging (SPI) techniques at room temperature. Classifying SPI scattering patterns, or `speckles', to extract single-hits that are needed for real-time vetoing and three-dimensional reconstruction poses a challenge for high-data-rate facilities like the European XFEL and LCLS-II-HE. Here, we introduce SpeckleNN, a unified embedding model for real-time speckle pattern classification with limited labeled examples that can scale linearly with dataset size. Trained with twin neural networks, SpeckleNN maps speckle patterns to a unified embedding vector space, where similarity is measured by Euclidean distance. We highlight its few-shot classification capability on new never-seen samples and its robust performance despite having only tens of labels per classification category even in the presence of substantial missing detector areas. Without the need for excessive manual labeling or even a full detector image, our classification method offers a great solution for real-time high-throughput SPI experiments.

47 OTHER INSTRUMENTATION↗

Thermal Stress Reduction in Power Switching Devices Using Distributed Loss PWM Concept for Current Source Inverters

A new modulation scheme is proposed for current source inverters (CSIs) that reduces the variation and peak junction temperature in the CSIs' power devices. The distributed loss pulse-width modulation (DLM) concept is introduced and applied to traditional space vector modulation methods to develop modified modulation schemes that reduce the thermal stress on power devices. The device junction temperatures resulting from conventional and DLM schemes are compared. Simulation and experimental results confirm that the proposed DLM concept reduces thermal stress on the devices while maintaining the same high output current waveform quality compared to traditional CSI modulation schemes. The CSI power device lifetime (i.e., the number of cycles to failure) are estimated using the simulation and experimental results. The proposed DLM significantly increases the device lifetime (by 5 to 6 times) by reducing the junction temperature variation compared to the conventional modulations.

42 ENGINEERING↗

Predictive Control to Further Reduce DC-Link Capacitor Current Stress for Segmented Inverter

Two three-phase interleaved inverters have been used in traction drive applications to reduce the current stress in a DC link capacitor bank. In such applications, either carrier-based or space vector modulation is used to select the optimum switching sequences, and the results show 50% less capacitor current than that of a single three-phase inverter. The switching state selection process for this inverter is tedious, and there has been no research to find the optimal switching state. To overcome this challenge, this research employed a simple finite set model predictive control to select the optimum switching sequence for a dual three-phase interleaved topology, called a segmented inverter. The results show that the predictive control algorithm can provide a simple solution and can reduce the current stress by 27% compared with traditional modulation techniques for the segmented inverters.

Ribeiro, Pedro↗

Inverse Segmented Motor Drive Using Dual ANPC Inverters for Common-Mode Voltage and Neutral-Point Current Cancellation

This article proposes an inverse segmented motor drive (SgMD) utilizing dual active neutral point clamped (ANPC) inverters. In the proposed configuration, the neutral point current and common-mode (CM) voltage is topologically canceled, achieving zero total neutral point current and CM voltage under ideal conditions. Also, the zero total neutral point current minimizes the neutral point voltage imbalance in ANPC inverters. The mechanisms behind neutral point current and CM voltage cancellation in the proposed inverse SgMD are first introduced. The modifications to the motor windings for implementing the inverse SgMD are explained, showing that a standard motor can be readily adapted for the proposed configuration. A space vector modulation (SVM) scheme tailored for the proposed topology is presented, along with a carrier-based implementation. Simulation results validate that the proposed topology can achieve zero total CM voltage and neutral point current. It is also shown that the proposed inverse SgMD can reduce neutral point voltage fluctuation by about 90% and RMS current stress in the dc-link capacitors by about 43% compared to the conventional SgMD.

Lee, Sangwhee [ORNL] (ORCID:0000000335490057)↗