Search NASA⌕ Search

SEARCH · Search NASA

Results for “VECTOR SPACE”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2025

Does the Z boson have a lighter cousin?

In the quenched electroweak theory on the lattice I construct a set of physical states which overlap the physical photon and Z boson states. This is done by employing eigenstates of the covariant lattice Laplacian, in addition to the Higgs and lattice link variables, to construct gauge invariant vector boson creation operators. Diagonalizing the transfer matrix in the subspace of Hilbert space spanned by this set yields a massless photon and massive Z particle, as expected. But in the numerical data there is evidence for more vector bosons in the spectrum, albeit with considerable uncertainty in their masses, with the lowest finite mass particle in the range of 3–4 GeV. Published by the American Physical Society 2025

Greensite, Jeff (ORCID:0000000317209436)↗
DOE OSTI2024

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↗
DOE OSTI2025

Active deep kernel learning of molecular properties from structural embeddings

As vast databases of chemical identities become increasingly available, the challenge shifts to how we effectively explore and leverage these resources to study molecular properties. This paper presents an active learning approach for molecular discovery using deep kernel learning (DKL), demonstrated on the QM9 dataset. DKL links structural embeddings directly to properties, creating organized latent spaces that prioritize relevant property information. By iteratively recalculating embedding vectors in alignment with target properties, DKL uncovers concentrated maxima representing key molecular properties and reveals unexplored regions with potential for innovation. This approach underscores DKL’s potential in advancing molecular research and discovery.

Artificial neural networks↗
DOE OSTI2026

Canted antiferromagnetism and spin reorientation in corner-shared single chain quasi-one-dimensional Ba 2 ⁢FeSe 3

Here, we report the canted antiferromagnetic (AFM) structure together with a spin reorientation in a single chain quasi-one-dimensional (Q-1D) iron chalcogenide Ba 2⁢ FeSe 3 . Ba 2 ⁢FeSe 3 crystallizes in Pnma (No. 62) orthorhombic structure with linear single iron chains consisting of corner-shared distorted FeSe 4 tetrahedra along the 𝑏 axis. Ba 2 ⁢FeSe 3 is a narrow-gap semiconductor and orders AFM below 60 K. Modeling of neutron powder diffraction data reveals a canted AFM ground state of magnetic space group 𝑃⁢𝑎⁢21/𝑐 (BNS No. 14.80) with commensurate propagation vector 𝐤 =(0, $\frac{1}{2}$, 0), where the Fe ion spins are AFM aligned with up-down-up-down (↑−↓−↑−↓) sequence along the Q-1D chain direction of the 𝑏 axis. In the magnetically ordered state, the canting of magnetic moments reorients from the 𝑎⁢𝑐 plane to the 𝑎⁢𝑏 plane below 30 K, with a 10° tilting angle toward the 𝑎 axis, and the magnetic moment does not induce a net moment in either orientation. The density functional theory results indicate that an ↑−↓−↑−↓ AFM state is stabilized along the chain direction. In this work, we elucidate the unique canted AFM of the iron chalcogenide and pave the way for searching exotic physics in Q-1D Ba 2⁢ FeSe 3 .

Gao, Fei [Univ. of Texas at Dallas, Richardson, TX↗
DOE OSTI2025

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗
DOE OSTI2024

Three-dimensional continuum point cloud method for large deformation and its verification

This study presents a strong form based meshfree collocation method, which is named Continuum Point Cloud Method, to solve nonlinear field equations derived from classical mechanics for deformed bodies in three-dimensional Euclidean space. The method and its implementation are benchmarked against a nonlinear vector field using manufactured solutions. The analysis of mechanical fields firstly focuses on the study of St. Venant Kirchhoff and compressible neo-Hookean materials. Results for various initial boundary value problems are presented, including benchmark cases involving unidirectional tension and simple shear. Subsequently, the study concludes with an analysis of a displacement-controlled simulation of a compressible neo-Hookean material, specifically a bar that is pulled to 50% of its original length and rotated 90°. The pure tension case yields a 1.5% error in displacement between computed and expected values and a combined tension and torsion loading case provides further insight into material behavior under complex loading conditions. The resulting normal axial and transverse stress-strain curves are also presented. Lastly, the consistency and robustness of the proposed nonlinear numerical schemes are successfully demonstrated through various numerical experiments.

Compressible neo-Hookean materials↗
DOE OSTI2026

Predicting U 3 O 8 powder processing conditions: An AI/ML approach analyzing deep learning embeddings of SEM micrographs

High-resolution SEM images of uranium-oxide powders encode micro- and nanoscale clues to their synthesis route and calcination temperature. We trained a ResNet-50 model on 11 commercial-scale U₃O₈ classes, ammonium diuranate (ADU) or uranyl peroxide (H₂O₂) precursors calcined at temperatures ranging from 400 to 750 °C and added a 256-D projection head before the classifier to analyze the learned representation. The best of eight seeds reached 92.4 % accuracy on reserved testing data, but our focus is the structure of the embedding space rather than the accuracy and labels. We quantify class relatedness in the original 256-D space using centroid similarity and distributional distances, and we use Uniform Manifold Approximation Projection (UMAP) for visualization. ‘Unknown’ images from different preparation methods, SEM operators, and from the literature localized near the expected classes under a nearest-centroid analysis without retraining, as well as clustered in similar UMAP space. In conclusion, this embedding-centered workflow complements black-box classification by providing quantitative, similarity-based comparisons of U₃O₈ morphologies and reduces storage space by up to 98 % for image data used in millisecond vector search comparisons.

36 MATERIALS SCIENCE↗
DOE OSTI2024

The 3D Lyman- α forest power spectrum from eBOSS DR16

We measure the three-dimensional power spectrum (P3D) of the transmitted flux in the Lyman-α (Ly α) forest using the complete extended Baryon Oscillation Spectroscopic Survey data release 16 (eBOSS DR16). This sample consists of ~205 000 quasar spectra in the redshift range 2 ≤ z ≤ 4 at an effective redshift z = 2.334. We propose a pair-count spectral estimator in configuration space, weighting each pair by exp( i k ∙ r), for wave vector k and pixel pair separation r, effectively measuring the anisotropic power spectrum without the need for fast Fourier transforms. This accounts for the window matrix in a tractable way, avoiding artefacts found in Fourier-transform based power spectrum estimators due to the sparse sampling transverse to the line of sight of Ly α skewers. We extensively test our pipeline on two sets of mocks: (i) idealized Gaussian random fields with a sparse sampling of Ly α skewers, and (ii) log-normal LyaCoLoRe mocks including realistic noise levels, the eBOSS survey geometry and contaminants. On eBOSS DR16 data, the Kaiser formula with a non-linear correction term obtained from hydrodynamic simulations yields a good fit to the power spectrum data in the range $(0.02 ≤ k ≤ 0.35)$ h Mpc -1 at the 1–2σ level with a covariance matrix derived from LyaCoLoRe mocks. We demonstrate a promising new approach for full-shape cosmological analyses of Ly α forest data from cosmological surveys such as eBOSS, the currently observing Dark Energy Spectroscopic Instrument and future surveys such as the Prime Focus Spectrograph, WEAVE-QSO, and 4MOST.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Hyper Spectral Anomaly Detection

The HSA is a statistics based anomaly detection model. The model performs unsupervised anomaly detection, based on a datapoint's density and similarity within a dataset. Density and similarity data are encoded into an affinity matrix. The affinity matrix is evolved to summarize the data's structure on greater topographical scales within the data's function space. The set of evolved affinity matrices and an anomaly score vector are passed to a user defined penalized objective function. The penalized objective function of anomaly scores is then minimized. Data points where the absolute value of the z-scores of anomaly scores greater than a specified threshold are predicted as anomalies. A novel multi-filter feature has also been implemented. To reduce false positive rates, the multi-filter records the indexes of the HSA predictions. A new dataset and data loader are instantiated consisting of all the initial HSA predictions and non-anomalous data points in a 10% and 90% split respectively. The HSA is then run through this data set and a count of number of times a data point is predicted is kept. In this way the initial predictions may be compared with data spanning the entire dataset. After the multi-filter is complete, all datapoints will have an associated anomaly score, as well as a multi-filter prediction count to further filter the anomalous predictions.

Rogers, DempseyD [Idaho National Laboratory (INL),↗
DOE OSTI2024

Frustrated Ising charge correlations in the kagome metal ScV 6 Sn 6

Here we resolve the real-space nature of the high-temperature, short-range charge correlations in the kagome metal ScV 6 Sn 6 . Diffuse scattering appears along a frustrated wave vector q H = ($\frac{1}{3}, \frac{1}{3}, \frac{1}{2}$) at temperatures far exceeding the charge order T CO = 92 K, preempting long-range charge order with wave vectors along q$_{\bar{K}}$ = ($\frac{1}{3}, \frac{1}{3}, \frac{1}{3}$). Using a combination of real space and reciprocal space analysis, we resolve the nature of the interactions between the primary out-of-plane Sc-Sn chain instability and the secondary strain-mediated distortion of the in-plane V kagome network. Finally, a minimal model of the diffuse scattering data reveals a high-temperature, short-ranged "zig-zag" phase of in-plane correlations that maps to a frustrated triangular lattice Ising model with antiferromagnetic interactions and provides a real-space understanding of the origin frustrated charge order in this material.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Safe and Robust Binary Classification and Fault Detection Using Reinforcement Learning

In this paper, we propose a learning-based method utilizing the Soft Actor-Critic (SAC) algorithm to train a binary Support Vector Machine (SVM) classifier. This classifier is designed to identify valid input spaces in high-dimensional, highly constrained systems while minimizing the total runtime of offline simulations. The simulations adapt their runtime based on the likelihood that a given training input will be informative to the classifier. Furthermore, we introduce a method for using the trained SAC model to predict whether a desired system input is likely to violate constraints, along with a technique to adjust the input as necessary. Additionally, we explore the potential of this model to detect faults or adversarial attacks within the system. The effectiveness of our approach is demonstrated through various simulations of challenging classification problems and a constrained quadrotor model.

Netter, Josh [Georgia Institute of Technology, Atl↗
DOE OSTI2026

Generative models on phase space

Deep generative models such as diffusion and flow matching are powerful machine learning tools capable of learning and sampling from high-dimensional distributions. They are particularly useful when the training data appears to be concentrated on a submanifold of the data embedding space. For high-energy physics data, consisting of collections of relativistic energy-momentum 4-vectors, this submanifold can enforce extremely strong physically-motivated priors, such as energy and momentum conservation. If these constraints are learned only approximately, rather than exactly, this can inhibit the interpretability and reliability of such generative models. To remedy this deficiency, we introduce generative models which are, by construction, confined at every step of their sampling trajectory to the manifold of massless N-particle Lorentz-invariant phase space in the center-of-momentum frame. In the case of diffusion models, the "pure noise" forward process endpoint corresponds to the uniform distribution on phase space, which provides a clear starting point from which to identify how correlations among the particles emerge during the reverse (de-noising) process. We demonstrate that our models are able to learn both few-particle and many-particle distributions with various singularity structures, paving the way for future interpretability studies using generative models trained on simulated jet data.

Bogorad, Zachary [Fermilab]↗
DOE OSTI2025

Long-lived vectors from electromagnetic cascades at SHiP

We simulate dark-vector, V, production from electromagnetic cascades at the recently approved SHiP experiment. The cascades (initiated by photons from π$^{0}$ → γγ) can lead to 3–4 orders of magnitude increase of the event rate relative to using primary production alone. We provide new SHiP sensitivity projections for dark photons and electrophilic gauge bosons, which are significantly improved compared to previous literature. The main gain in sensitivity occurs for long-lived dark vectors with masses below ~ 50 − 300 MeV. The dominant production mode in this parameter space is low-energy annihilation e$^{+}$e$^{−}$ → V (γ). This motivates a detailed study of backgrounds and efficiencies in the SHiP experiment for sub-GeV signals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Naturally resonant dark matter from extra dimensions

We explore the mass-resonance structure that naturally arises in extradimensional models. The resonance can enhance both dark matter annihilation and self-interactions. We demonstrate such a resonance structure by considering the fermionic dark matter and dark photon models on an S 1 / ( Z 2 × Z 2 ′ ) orbifold. We also note that this model embeds a dark matter axial-vector coupling to the dark photon, thereby opening up the viable dark matter parameter space. We then present the unique predictions for direct-detection experiments and accelerator searches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Moments of axial-vector GPD from lattice QCD: quark helicity, orbital angular momentum, and spin-orbit correlation

In this work, we present a lattice QCD calculation of the Mellin moments of the twist-2 axial-vector generalized parton distribution (GPD), $\overset{\sim }{H}\left(x,\xi, t\right)$ , at zero skewness, ξ, with multiple values of the momentum transfer, t. Our analysis employs the short-distance factorization framework on ratio-scheme renormalized quasi-GPD matrix elements. The calculations are based on an N f = 2 + 1 + 1 twisted mass fermions ensemble with clover improvement, a lattice spacing of a = 0.093 fm, and a pion mass of m π = 260 MeV. We consider both the iso-vector and iso-scalar cases, utilizing next-to-leading-order perturbative matching while omitting the disconnected contributions and gluon mixing in the iso-scalar case. For the first time, we determine the Mellin moments of $\overset{\sim }{H}$ up to the fifth order. From these moments, we discuss the quark helicity and orbital angular momentum contributions to the nucleon spin, as well as the spin-orbit correlations of the quarks. Additionally, we perform a Fourier transform over the momentum transfer, which allows us to explore the spin structure in the impact-parameter space.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Automated and High-Throughput Phase Separation Control for Supramolecular Polymer Blends Enabled by Machine Learning

Supramolecular polymer blends (SPBs) offer tunable morphologies that dictate their macroscopic properties, yet their rational design is limited by the absence of predictive structure−morphology models. Here, we introduce a data-driven highthroughput workflow that integrates modular polymer synthesis, robotic formulation, automated morphology characterization, and machine learning (ML) for accelerated SPB discovery. Using a plug-and-play synthetic strategy, 33 hydrogen-bonding endfunctional homopolymers were prepared and orthogonally combined to generate 260 SPBs in 1 day. A fully automated atomic force microscopy (AFM) pipeline enabled systematic imaging, producing 2340 morphology data sets with minimal human intervention. Domain spacings were extracted through complementary imageprocessing methods and used to train ML models. A support vector regression (SVR) model accurately predicted target phase-separation sizes (50, 100, and 150 nm), which were experimentally validated. This work demonstrates the power of coupling high-throughput experimentation with ML to accelerate morphology discovery and provides one of the first large-scale experimental data sets for supramolecular polymer systems.

ML-guided polymer design↗