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 253 records · Page 14

Logarithmic Corrections to Kerr Thermodynamics

Recent work has shown that loop corrections from massless particles generate $\frac{3}{2}$ ⁢log⁡𝑇 Hawking corrections to black hole entropy which dominate the thermodynamics of cold near-extreme charged black holes. Here we adapt this analysis to near-extreme Kerr black holes. Like AdS 2 ×𝑆 2 , the near-horizon extreme Kerr (NHEK) metric has a family of normalizable zero modes corresponding to reparametrizations of boundary time. The path integral over these zero modes leads to an infrared divergence in the one-loop approximation to the Euclidean NHEK partition function. We regulate this divergence by retaining the leading finite temperature correction in the NHEK scaling limit. This “not-NHEK” geometry lifts the eigenvalues of the zero modes, rendering the path integral infrared finite. The quantum-corrected near-extremal entropy exhibits $\frac{3}{2}$ ⁢log⁡𝑇 Hawking behavior characteristic of the Schwarzian model and predicts a lifting of the ground state degeneracy for the extremal Kerr black hole.

General relativity↗

Transverse Momentum Distributions from Lattice QCD without Wilson Lines

The transverse-momentum-dependent distributions (TMDs), which are defined by gauge-invariant 3D parton correlators with staple-shaped lightlike Wilson lines, can be calculated from quark and gluon correlators fixed in the Coulomb gauge on a Euclidean lattice. These quantities can be expressed gauge invariantly as the correlators of Coulomb-gauge-dressed fields, which reduce to the standard TMD correlators under principal-value prescription in the infinite boost limit. In the framework of large-momentum effective theory, a quasi-TMD defined from such correlators in a large-momentum hadron state can be matched to the TMD via a factorization formula, whose exact form is derived using soft collinear effective theory and verified at one-loop order. Compared to the currently used gauge-invariant correlators, this new method can substantially improve statistical precision and simplify renormalization for the time-reversal-even TMDs, which will greatly enhance the predicative power of lattice QCD in the nonperturbative region.

Effective field theory↗

Light and Strange Vector Resonances from Lattice QCD at Physical Quark Masses

We present the first ab initio calculation at physical quark masses of scattering amplitudes describing the lightest pseudoscalar mesons interacting via the strong force in the vector channel. Using lattice quantum chromodynamics, we postdict the defining parameters for two short-lived resonances, the ρ(770) and K*(892) which manifest as complex energy poles in ππ and Kπ scattering amplitudes, respectively. The calculation proceeds by first computing the finite-volume energy spectrum of the two-hadron systems and then determining the amplitudes from the energies using the Lüscher formalism. The error budget includes a data-driven systematic error, obtained by scanning possible fit ranges and fit models to extract the spectrum from Euclidean correlators, as well as the scattering amplitudes from the latter. The final results, obtained by analytically continuing multiple parametrizations into the complex energy plane, are M ρ = 796(5)(50)MeV, Γ ρ = 192(10)(31) MeV, M K* = 893(2)(54) MeV, and Γ K = 51(2)(11) MeV, where the subscript indicates the resonance and M and Γ stand for the mass and width, respectively, and where the first bracket indicates the statistical and the second bracket the systematic uncertainty.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Long-Distance Window of the Hadronic Vacuum Polarization for the Muon g − 2

We provide the first calculation of the Euclidean long-distance window of the isospin-symmetric light-quark connected contribution to the hadronic vacuum polarization for the muon g − 2 and find a μ LD , iso , conn , ud = 411.4 ( 4.3 ) ( 2.4 ) × 10 − 10 . We also provide the currently most precise calculation of the total isospin-symmetric light-quark connected contribution, a μ iso , conn , ud = 666.2 ( 4.3 ) ( 2.5 ) × 10 − 10 in the BMW20 world, which is more than 4 σ larger compared to the data-driven estimates of Boito [] and 1.7 σ larger compared to the lattice QCD result of BMW20. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Microscopic Origin of the Entropy of Black Holes in General Relativity

We construct an infinite family of microstates with geometric interiors for eternal black holes in general relativity with a negative cosmological constant in any dimension. Wormholes in the Euclidean path integral for gravity cause these states to have small, but nonzero, quantum mechanical overlaps that have a universal form. The overlaps have a dramatic consequence: The microstates span a Hilbert space of log dimension equal to the Bekenstein-Hawking entropy. The semiclassical microstates we construct contain Einstein-Rosen bridges of arbitrary size behind their horizons. Our results imply that all these bridges can be interpreted as quantum superpositions of wormholes of size at most exponential in the entropy.

Physics↗

Matrix-Model Simulations Using Quantum Computing, Deep Learning, and Lattice Monte Carlo

Matrix quantum mechanics plays various important roles in theoretical physics, such as a holographic description of quantum black holes, and it underpins the only practical numerical approach to the study of complex high-dimensional supergravity theories. Understanding quantum black holes and the role of entanglement in a holographic setup is of paramount importance for the realization of a quantum theory of gravity. Moreover, a complete numerical understanding of the holographic duality and the emergence of geometric space-time features from microscopic degrees of freedom could pave the way for new discoveries in quantum information science. Euclidean lattice Monte Carlo simulations are the de facto numerical tool for understanding the spectrum of large matrix models and have been used to test the holographic duality. However, they are not tailored to extract dynamical properties or even the quantum wave function of the ground state of matrix models. Quantum computing and deep learning provide potentially useful approaches to study the dynamics of matrix quantum mechanics. If successful in the context of matrix models, these rapidly improving numerical techniques could become the new Swiss army knife of quantum gravity practitioners. In this paper, we perform the first systematic survey for quantum computing and deep-learning approaches to matrix quantum mechanics, comparing them to lattice Monte Carlo simulations. These provide baseline benchmarks before addressing more complicated problems. In particular, we test the performance of each method by calculating the low-energy spectrum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗

Lanczos algorithm for lattice QCD matrix elements

Recent work [M. L. Wagman, Lanczos, the transfer matrix, and the signal-to-noise problem, .] found that an analysis formalism based on the Lanczos algorithm allows energy levels to be extracted from Euclidean correlation functions with faster ground-state convergence than effective masses, convergent estimators for multiple states from a single correlator, and two-sided error bounds. After filtering out spurious eigenvalues and using outlier-robust estimators within a nested bootstrap framework, Lanczos estimators behave more like multistate fit results than effective masses—but without involving statistical fitting. We extend this formalism to the determination of matrix elements from three-point correlation functions and provide a physical picture of “spurious-state filtering” involving restriction to a Hermitian subspace. We demonstrate similar advantages for matrix elements as for spectroscopy through example applications to noiseless mock-data and (bare) forward matrix elements of the strange scalar current between both ground and excited states with the quantum numbers of the nucleon.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

BraggNN : fast X-ray Bragg peak analysis using deep learning

X-ray diffraction based microscopy techniques such as high-energy diffraction microscopy (HEDM) rely on knowledge of the position of diffraction peaks with high precision. These positions are typically computed by fitting the observed intensities in detector data to a theoretical peak shape such as pseudo-Voigt. As experiments become more complex and detector technologies evolve, the computational cost of such peak-shape fitting becomes the biggest hurdle to the rapid analysis required for real-time feedback in experiments. To this end, we propose BraggNN, a deep-learning based method that can determine peak positions much more rapidly than conventional pseudo-Voigt peak fitting. When applied to a test dataset, peak center-of-mass positions obtained from BraggNN deviate less than 0.29 and 0.57 pixels for 75 and 95% of the peaks, respectively, from positions obtained using conventional pseudo-Voigt fitting (Euclidean distance). When applied to a real experimental dataset and using grain positions from near-field HEDM reconstruction as ground-truth, grain positions using BraggNN result in 15% smaller errors compared with those calculated using pseudo-Voigt. Recent advances in deep-learning method implementations and special-purpose model inference accelerators allow BraggNN to deliver enormous performance improvements relative to the conventional method, running, for example, more than 200 times faster on a consumer-class GPU card with out-of-the-box software.

36 MATERIALS SCIENCE↗

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↗

Growth functions of periodic space tessellations

This work analyzes the rules governing the growth of the numbers of vertices, edges and faces in all possible periodic tessellations of the 2D Euclidean space, and encodes those rules in several types of polynomial growth functions. These encodings map the geometric, combinatorial and topological properties of the tessellations into sets of integer coefficients. Several general statements about these encodings are given with rigorous mathematical proof. The variation of the growth functions is represented graphically and analyzed in orphic diagrams, so named because of their similarity to orphic art. Several examples of 3D space groups are included, to emphasize the complexity of the growth functions in higher dimensions. A freely available Python library is presented to facilitate the discovery of the growth functions and the generation of orphic diagrams.

Chemistry↗

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

42 ENGINEERING↗

Multi-Dimensional Scaling on Groups

Leveraging the intrinsic symmetries in data for clear and efficient analysis is an important theme in signal processing and other data-driven sciences. A basic example of this is the ubiquity of the discrete Fourier transform which arises from translational symmetry (i.e. time-delay/phase-shift). Particularly important in this area is understanding how symmetries inform the algorithms that we apply to our data. In this paper we explore the behavior of the dimensionality reduction algorithm multi-dimensional scaling (MDS) in the presence of symmetry. We show that understanding the properties of the underlying symmetry group allows us to make strong statements about the output of MDS even before applying the algorithm itself. In analogy to Fourier theory, we show that in some cases only a handful of fundamental ``frequencies'' (irreducible representations derived from the corresponding group) contribute information for the MDS Euclidean embedding.

Dimensionality reduction, Representation theory, D↗

AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

The recent development of deep learning has been mostly focusing on Euclidean data, such as images, videos, audios, etc. However, most real-world information and relation are often expressed as graphs. To efficiently learn from graph data, graph convolutional networks (GCNs) emerge as a promising approach, showing advantages in several practical applications such as social network analysis, knowledge discovery, 3D modeling, motion capturing, etc. Real-world graphs are usually extremely large and imbalanced, posting significant performance demand and design challenges on the hardware dedicated for GCN inference. In this paper, we propose an architecture design called UW-GCN to accelerate graph convolutional network inference. To tackle the major performance bottleneck from workload imbalance, we propose dynamic neighborhood stealing and remote chunk shuffling techniques, relying on hardware flexibility to achieve hardware auto-tuning under negligible area or delay overhead. Specifically, UW-GCN is able to smartly profile the sparse graph pattern while continuously adjusting the workload distribution via routing reconfiguration among parallel processing elements (PEs). The ideal configuration is then reused in the remaining iterations. To the best of our knowledge, this is the first accelerator design particularly for GCN and the first work relying on hardware auto-tuning, which is normally based on software, to achieve near-optimal workload balance in processing sparse structures.

Geng, Tong↗

Synchronization and Rebound Effects in Residential Loads

Increasing fuel prices and capacity investment deferral place an increasing demand for peak reduction from distribution level systems. Residential and commercial devices, such as HVAC systems and water heaters, are increasingly involved in load control programs, and their use may generate synchronization and rebound effects, such as artificial peaks caused by device optimization. While there have been concerns over device synchronization, few studies quantify the extent of this effect with numerical values. In this study, we attempt to investigate whether control efforts result in device synchronization or rebound effects. We focus on three clustering methods – Ward’s clustering, Euclidean K-means, and Density-based spatial clustering of applications with noise – to evaluate the extent of synchronization of a fleet of water heaters and HVAC systems in Atlanta, Georgia. Our findings show that synchronization and rebound effects are present in the neighborhood’s water heaters, but none were found in the HVAC systems. Further, high usage water heaters are more susceptible to synchronization and rebound effects.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improving the Accuracy of Clustering Electric Utility Net Load Data using Dynamic Time Warping

Identifying patterns in electric utility net load data in a time-series format is very useful in preparing the operation for next day. Machine learning algorithms have been used in other domains and those concepts are applied in this paper on real-world net load measurement data. Clustering is the practice of grouping data with similar characteristics as determined by the distance measure. The K-means clustering algorithm is utilized here with actual electric utility data. The paper uses the standard distance measure, Euclidean distance (ED), and compares its performance against the dynamic time warping (DTW) measure. An actual case study with real data is presented, and DTW distance measure-based method observed to result better accuracy compared to the ED based method for substation net load measurements predominantly with residential customers.

clustering↗

Tri-Sectional Approximation of the Shortest Path to Long-Term Voltage Stability Boundary with Distributed Energy Resources

Ensuring long-term voltage stability is critical for reliable operations of power grids. High share of distributed energy resources (DERs) can create complicated system operation modes that may invalidate the traditional long-term voltage stability analysis based on typical operation modes. To address this challenge, this paper investigates how to compute the shortest path to the voltage stability boundary in the DER aggregated load space with large dispersion. Instead of working in the Euclidean space, we establish the analysis and computations on the algebraic power flow manifold to better capture the curvature change of the shortest path along the direction of losing stability. A modified optimal control framework is presented for obtaining the ground-truth of the smooth shortest path on the manifold. To efficiently and accurately solve for the shortest path, we further leverage the geometric features of the power flow manifold and propose a tri-sectional approximation model that is scalable for large-scale systems. Several numerical examples, up to the 1354-bus system, with different DER penetration levels and high dimensional renewable power injection variations are evaluated. The simulation results demonstrate that the tri-sectional approximation achieves high accuracy and efficiency to approximate the shortest path to the voltage stability boundary.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Diffusion power spectra as a window into dynamic materials architecture

Chemical recycling of commodity and specialty polymers presents a multifaceted challenge for industrial societies. On one hand, macromolecular architectures must be engineered to yield durable products that, on the other hand, rapidly deconstruct to recyclable monomers under pre-determined conditions. Polymer deconstruction is a chemical process that requires deep understanding of molecular reactivity in heterogeneous media, where porous material architectures evolve in both space and time. To build this understanding, we develop herein experimental and analytical methods describing sets of diffusive eigenmodes that exist within time-varying, non-Euclidean boundary conditions, a situation commonly encountered in the reactive deconstruction of polymers where chain fragments splay, alter their local dynamics, and evolve in their confinement of reacting media. Diffusion power spectra, discerned experimentally by NMR, yield polymer and solvent frequency-domain velocity autocorrelation functions that are analyzed in the context of physical models for chemical reactions parameterized with fractal mathematics. The results connect local motion in polymers to chemical reactivity during acidolysis of circular elastomers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗