Search NASA⌕ Search

SEARCH · Search NASA

Results for “Euclidean”

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 181 records · Page 10

SO(3)-invariance of informed-graph-based deep neural network for anisotropic elastoplastic materials

This work examines the frame-invariance (and the lack thereof) exhibited in simulated anisotropic elasto-plastic responses generated from supervised machine learning of classical multi-layer and informed-graph-based neural networks, and proposes different remedies to fix this drawback. The inherent hierarchical relations among physical quantities and state variables in an elasto-plasticity model are first represented as informed, directed graphs, where three variations of the graph are tested. While feed-forward neural networks are used to train path-independent constitutive relations (e.g., elasticity), recurrent neural networks are used to replicate responses that depends on the deformation history, i.e. or path dependent. In dealing with the objectivity deficiency, we use the spectral form to represent tensors and, subsequently, three metrics, the Euclidean distance between the Euler Angles, the distance from the identity matrix, and geodesic on the unit sphere in Lie algebra, can be employed to constitute objective functions for the supervised machine learning. In this, the aim is to minimize the measured distance between the true and the predicted 3D rotation entities. Following this, we conduct numerical experiments on how these metrics, which are theoretically equivalent, may lead to differences in the efficiency of the supervised machine learning as well as the accuracy and robustness of the resultant models. Neural network models trained with tensors represented in component form for a given Cartesian coordinate system are used as a benchmark. Our numerical tests show that, even given the same amount of information and data, the quality of the anisotropic elasto-plasticity model is highly sensitive to the way tensors are represented and measured. The results reveal that using a loss function based on geodesic on the unit sphere in Lie algebra together with an informed, directed graph yield significantly more accurate rotation prediction than the other tested approaches.

42 ENGINEERING↗

Data-driven surrogates for high dimensional models using Gaussian process regression on the Grassmann manifold

This paper introduces a surrogate modeling scheme based on Grassmannian manifold learning to be used for cost-efficient predictions of high-dimensional stochastic systems. The method exploits subspace-structured features of each solution by projecting it onto a Grassmann manifold. This point-wise linear dimensionality reduction harnesses the structural information to assess the similarity between solutions at different points in the input parameter space. The method utilizes a solution clustering approach in order to identify regions of the parameter space over which solutions are sufficiently similarly such that they can be interpolated on the Grassmannian. In this clustering, the reduced-order solutions are partitioned into disjoint clusters on the Grassmann manifold using the eigen-structure of properly defined Grassmannian kernels and, the Karcher mean of each cluster is estimated. Then, the points in each cluster are projected onto the tangent space with origin at the corresponding Karcher mean using the exponential mapping. For each cluster, a Gaussian process regression model is trained that maps the input parameters of the system to the reduced solution points of the corresponding cluster projected onto the tangent space. Using this Gaussian process model, the full-field solution can be efficiently predicted at any new point in the parameter space. In certain cases, the solution clusters will span disjoint regions of the parameter space. In such cases, for each of the solution clusters we utilize a second, density-based spatial clustering to group their corresponding input parameter points in the Euclidean space. The proposed method is applied to two numerical examples. Here, the first is a nonlinear stochastic ordinary differential equation with uncertain initial conditions where the surrogate is used to predict the time history solution. The second involves modeling of plastic deformation in a model amorphous solid using the Shear Transformation Zone theory of plasticity, where the proposed surrogate is used to predict the full strain field of a material specimen under large shear strains.

42 ENGINEERING↗

Geometric learning for computational mechanics Part II: Graph embedding for interpretable multiscale plasticity

The history-dependent behaviors of classical plasticity models are often driven by internal variables evolved according to phenomenological laws. The difficulty to interpret how these internal variables represent a history of deformation, the lack of direct measurement of these internal variables for calibration and validation, and the weak physical underpinning of those phenomenological laws have long been criticized as barriers to creating realistic models. In this work, geometric machine learning on graph data (e.g. finite element solutions) is used as a means to establish a connection between nonlinear dimensional reduction techniques and plasticity models. Geometric learning-based encoding on graphs allows the embedding of rich time-history data onto a low-dimensional Euclidean space such that the evolution of plastic deformation can be predicted in the embedded feature space. Finally, a corresponding decoder can then convert these low-dimensional internal variables back into a weighted graph such that the dominating topological features of plastic deformation can be observed and analyzed.

42 ENGINEERING↗

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↗

Rethinking the ill-posedness of the spectral function reconstruction — Why is it fundamentally hard and how Artificial Neural Networks can help

Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a Källen–Lehmann (KL) spectral representation, the reconstruction is observed to be ill-posed in practice. It is usually ascribed to the fewer observation points compared to the number of points in the spectral function. In this paper, by solving the eigenvalue problem of continuous KL convolution, we show analytically that the ill-posedness of the inversion is fundamental and it exists even for continuous correlation functions. We discussed how to introduce regulators to alleviate the predicament, in which include the Artificial Neural Networks (ANNs) representations recently proposed by the Authors in another study. The uniqueness of solutions using ANNs representations is manifested analytically and validated numerically. Reconstructed spectral functions using different regularization schemes are also demonstrated, together with their eigen-mode decomposition. We observe that components with large eigenvalues can be reliably reconstructed by all methods, whereas those with low eigenvalues need to be constrained by regulators.

97 MATHEMATICS AND COMPUTING↗

Neural operators for stochastic modeling of nonlinear structural system response to natural hazards

Traditionally, neural networks have been employed to learn the mapping between finite-dimensional Euclidean spaces. However, recent research has opened up new horizons, focusing on the utilization of deep neural networks to learn operators capable of mapping infinite-dimensional function spaces. Here, in this work, we employ two state-of-the-art neural operators, the deep operator network (DeepONet) and the Fourier neural operator (FNO) for the prediction of the nonlinear time history response of structural systems exposed to natural hazards, such as earthquakes and windstorms. Specifically, we propose two architectures, a self-adaptive FNO and a fast Fourier transform-based DeepONet (DeepFNOnet), where we employ a FNO beyond the DeepONet to learn the discrepancy between the ground truth and the solution predicted by the DeepONet. To demonstrate the efficiency and applicability of the architectures, two problems are considered. In the first, we use the proposed model to predict the seismic nonlinear dynamic response of a six-story shear building subject to stochastic ground motions. In the second problem, we employ the operators to predict the wind-induced nonlinear dynamic response of a high-rise building while explicitly accounting for the stochastic nature of the wind excitation. In both cases, the trained metamodels achieve high accuracy while being orders of magnitude faster than their corresponding high-fidelity models.

DeepONet↗

Machine learning magnetism classifiers from atomic coordinates

The determination of magnetic structure poses a long-standing challenge in condensed matter physics and materials science. Experimental techniques such as neutron diffraction are resource-limited and require complex structure refinement protocols, while computational approaches such as first-principles density functional theory (DFT) need additional semi-empirical correction, and reliable prediction is still largely limited to collinear magnetism. Here, we present a machine learning model that aims to classify the magnetic structure by inputting atomic coordinates containing transition metal and rare earth elements. By building a Euclidean equivariant neural network that preserves the crystallographic symmetry, the magnetic structure (ferromagnetic, antiferromagnetic, and nonmagnetic) and magnetic propagation vector (zero or non-zero) can be predicted with an average accuracy of 77.8% and 73.6%. In particular, a 91% accuracy is reached when predicting no magnetic ordering even if the structure contains magneticelement(s). Ourworkrepresents onestepforwardtosolvingthegrand challenge of full magnetic structure determination.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Jacobian-scaled K-means clustering for physics-informed segmentation of reacting flows

This work introduces Jacobian-scaled K-means (JSK-means) clustering, which is a physicsinformed clustering strategy centered on the K-means framework. The method allows for the injection of underlying physical knowledge into the clustering procedure through a distance function modification: instead of leveraging conventional Euclidean distance vectors, the JSKmeans procedure operates on distance vectors scaled by matrices obtained from dynamical system Jacobians evaluated at the cluster centroids. The goal of this work is to show how the JSKmeans algorithm - without modifying the input dataset - produces clusters that capture regions of dynamical similarity, in that the clusters are redistributed towards high-sensitivity regions in phase space and are described by similarity in the source terms of samples instead of the samples themselves. The algorithm is demonstrated on a complex reacting flow simulation dataset (a channel detonation configuration), where the dynamics in the thermochemical composition space are known through the highly nonlinear and stiff Arrhenius-based chemical source terms. Interpretations of cluster partitions in both physical space and composition space reveal how JSK-means shifts clusters produced by standard K-means towards regions of high chemical sensitivity (e.g., towards regions of peak heat release rate near the detonation reaction zone). Furthermore, the findings presented here illustrate the benefits of utilizing Jacobian-scaled distances in clustering techniques, and the JSK-means method in particular displays promising potential for improving former partition-based modeling strategies in reacting flow (and other multi-physics) applications.

Clustering↗

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↗

On the connection between perturbation theory and new semiclassical expansion in quantum mechanics

Here, it is shown that for the one-dimensional anharmonic oscillator with potential V(x) = ax 2 + bgx 3 + ... = $\frac{1}{g^2}$ $\hat{V}$ (gx), as well as for the radial oscillator V(r) = $\frac{1}{g^2}$ $\hat{V}$ (gr) and for the perturbed Coulomb problem V(r) = $\frac{a}{r}$ + βgr + ... = g $\tilde{V}$ (gr), the Perturbation Theory in powers of the coupling constant g (weak coupling regime) and the semiclassical expansion in powers of $\hbar$ 1/2 for the energies coincide. This is related to the fact that the dynamics developed in two spaces: x (r)-space and gx (gr)-space, lead to the same energy spectra. The equations which govern dynamics in these two spaces, the Riccati-Bloch equation and the Generalized Bloch equation, respectively, are presented. It is shown that the perturbation theory for the logarithmic derivative of the wavefunction in - space leads to (true) semiclassical expansion in powers of $\hbar$ 1/2 ; for the one-dimensional case this corresponds to the flucton calculus for the density matrix in the path integral formalism in Euclidean (imaginary) time proposed by one of the authors. Matching the perturbation theory in powers of g and the semiclassical expansion in powers of $\hbar$ 1/2 for the wavefunction leads to a highly accurate local approximation in the entire coordinate space, its expectation value for the Hamiltonian provides a prescription for the summation of the perturbative (trans)-series.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entanglement entropy of a color flux tube in (1+1)D Yang–Mills theory

In recent work Amorosso et al. (2024), we computed a novel flux tube entanglement entropy (FTE) of the color flux tube stretched between a heavy quark-antiquark pair on a Euclidean lattice in (2+1)D Yang–Mills theory. Our numerical results suggested that FTE can be partitioned into an internal color entanglement entropy and a vibrational entropy corresponding to the transverse excitations of a QCD string, with the latter described by a thin string model. Since the color flux tube does not have transverse excitations in (1+1)D Yang–Mills theory, we use this simpler framework to perform an exact analytical computation of the contribution of the internal color degrees of freedom to FTE. For the multipartite partitioning of the color flux tube, we find the remarkable result that FTE depends only on the dimension of the color group representation and the number of times the flux tube crosses the boundary between the traced and untraced spatial regions but not on the string length. Our proof is independent of whether the replica and region boundaries on the lattice are placed on vertices or in plaquette centers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ice Phase Classification Made Easy with Score-Based Denoising

Accurate identification of ice phases is essential for understanding various physicochemical phenomena. However, such classification for structures simulated with molecular dynamics is complicated by the complex symmetries of ice polymorphs and thermal fluctuations. For this purpose, both traditional order parameters and data-driven machine learning approaches have been employed, but they often rely on expert intuition, specific geometric information, or large training data sets. In this work, we present an unsupervised phase classification framework that combines a score-based denoiser model with a subsequent model-free classification method to accurately identify ice phases. Further, the denoiser model is trained on perturbed synthetic data of ideal reference structures, eliminating the need for large data sets and labeling efforts. The classification step utilizes the smooth overlap of atomic position (SOAP) descriptors as the atomic fingerprint, ensuring Euclidean symmetries and transferability to various structural systems. Our approach achieves a remarkable 100% accuracy in distinguishing ice phases of test trajectories using only seven ideal reference structures of ice phases as model inputs. This demonstrates the generalizability of the score-based denoiser model in facilitating phase identification for complex molecular systems. The proposed classification strategy can be broadly applied to investigate structural evolution and phase identification for a wide range of materials, offering new insights into the fundamental understanding of water and other complex systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comparative Evaluation of the Ability of the MYNN‐EDMF PBL Scheme in WRF Model to Reproduce Near Surface Wind Speed Over Different Topographical Types

Abstract This study systematically evaluates the performance of the Mellor‐Yamada‐Nakanishi‐Niino‐Eddy‐Diffusion‐Mass‐Flux planetary boundary layer (PBL) scheme within the Weather Research and Forecasting (WRF) model in simulating near‐surface wind speeds across various topographies in New York State (NYS). Simulated wind speeds are compared with in‐situ measurements from 22 surface sites, grouped into six topographic categories: continental plain (CT), lakeside (LS), river valley (RV), Long Island (LI), Block Island (BI), and offshore ocean (OO). A quantitative evaluation based on Relative Euclidean Distance shows that wind speeds at the OO site are the most accurately reproduced, followed by those at LI sites, while the model performs less accurately for the remaining topographic groups. Wind speeds over CT sites tend to be overestimated by approximately 1 m/s, although their diurnal variability (DV) is well captured. In contrast, the model underestimates wind DV at LS, RV, LI, and BI sites, with the largest biases occurring at LI and BI, resulting in underestimated daytime wind speed and/or overestimated nighttime wind speed. The OO winds exhibit minimal diurnal variation, accurately captured by our WRF model. The surface wind diurnal variation is closely linked to PBL development. Among the indicators of PBL development, surface potential temperature biases most strongly correlate with wind speed biases. Our WRF model faces challenges in capturing the distinctions between winds influenced by local circulations and those over continental plains, and the significantly stronger winds at OO compared to BI. Potential causes for these biases are discussed, offering pathways for improving surface wind simulations in future.

54 ENVIRONMENTAL SCIENCES↗

Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning

Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.

Krajewski, Adam M. (ORCID:0000000222660099)↗

Shedding light on thermal photon and dilepton production

Electromagnetic radiation from the quark-gluon plasma (QGP) is an important observable to be considered in heavy ion collision experiments. I will provide an update on recent advancements from perturbation theory and quenched lattice simulations. The resummed next-to-leading order (NLO) emission rate has recently been decomposed into transverse and longitudinal components, and extended to non-zero baryon chemical potential. The associated spectral function has also been tested against the Euclidean correlator, for continuum-extrapolated lattice data (at μ B = 0).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quarkonium suppression in strongly coupled plasmas

Suppression of open heavy quarks and quarkonia in heavy-ion collisions are among the most informative probes of quark-gluon plasma (QGP). Interpreting the full wealth of data obtained from the collision events requires a precise theoretical understanding of the evolution of heavy quarks and quarkonia as they propagate through a strongly coupled plasma. Such calculations require the evaluation of a gauge-invariant correlator of chromoelectric fields. This chromoelectric correlator encodes all the characteristics of QGP that the dissociation and recombination dynamics of quarkonium are sensitive to, which is to say can in principle measure. We review its distinctive qualitative features at weak coupling in QCD up to next-to-leading order and at strong coupling in N = 4 SYM using the AdS/CFT correspondence, as well as its formulation in Euclidean QCD. Furthermore, we report on recent progress in applying our results to the calculation of the final quarkonium abundances after propagating through a cooling droplet of QGP, which illustrates how we may learn about QGP from quarkonium measurements. We devote special attention to how the presence of a strongly coupled plasma modifies the transport description of quarkonium, in comparison to approaches that rely on weak coupling approximations to describe quarkonium dissociation and recombination.

Scheihing-Hitschfeld, Bruno [University of Califor↗

Generalized Grad–Shafranov equation for non-axisymmetric MHD equilibria

The structure of static MHD equilibria that admit continuous families of Euclidean symmetries is well understood. Such field configurations are governed by the classical Grad–Shafranov equation, which is a single elliptic partial differential equation in two space dimensions. By revealing a hidden symmetry, here we show that in fact all smooth solutions of the equilibrium equations with non-vanishing pressure gradients away from the magnetic axis satisfy a generalization of the Grad–Shafranov equation. In contrast to solutions of the classical Grad–Shafranov equation, solutions of the generalized equation are not automatically equilibria, but instead only satisfy force balance averaged over the one-parameter hidden symmetry. We then explain how the generalized Grad–Shafranov equation can be used to reformulate the problem of finding exact three-dimensional smooth solutions of the equilibrium equations as finding an optimal volume-preserving symmetry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gauge-invariant perturbation expansion in powers of electric charge for the density-of-states of a network model for charged-particle motion in a uniform background magnetic flux density

An explicitly gauge-invariant expansion in powers of e/$\hbar$ times the magnetic flux density is formally obtained for the density of states [as characterized by the trace of the resolvent $\hat{G}$ = (ω-$\hat{ℎ}$)-1] of a charged particle moving on a Hermitian quantum network that is embedded in a Euclidean background that supports a uniform magnetic flux density. The explicit expressions, given here up to third order in the flux density, are also valid for the “local trace” (the trace of $\hat{P}_i\hat{G}$ , where $\hat{P}_i$ is the projector on a network node) and do not appear to have been previously given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗