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

Update of Euclidean windows of the hadronic vacuum polarization

We compute the standard Euclidean window of the hadronic vacuum polarization using multiple independent blinded analyses. We improve the continuum and infinite-volume extrapolations of the dominant quark-connected light-quark isospin-symmetric contribution and address additional subleading systematic effects from sea-charm quarks and residual chiral-symmetry breaking from first principles. We find 𝑎$^{W}_{μ}$ = 235.56⁢(65)⁢(50) × 10 −10 , which is in 3.8⁢𝜎 tension with the recently published dispersive result of 𝑎$^{W}_{μ}$ =229.4⁢(1.4) × 10 −10 [G. Colangelo, A. X. El-Khadra, M. Hoferichter, A. Keshavarzi, C. Lehner, P. Stoffer, and T. Teubner, Phys. Lett. B 833, 137313 (2022)] and in agreement with other recent lattice determinations. We also provide a result for the standard short-distance window. The results reported here are unchanged compared to our presentation at the Edinburgh workshop of the g-2 Theory Initiative in 2022 [C. Lehner, Talk Presented at the 5th Plenary Meeting of the g-2 Theory Initiative in Edinburgh (2022)].

Lattice QCD↗

Euclidean gravity and holography

We discuss a recent proposal that the Euclidean gravity approach to quantum gravity is correct if and only if the theory is holographic, providing several examples and general arguments to support the conjecture. This provides a natural mechanism for the low-energy gravitational effective field theory to access a host of deep ultraviolet properties, like the Bekenstein–Hawking entropy of black holes, the unitarity of black hole evaporation, and the lack of exact global symmetries.

Astronomy & Astrophysics↗

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

Euclidean neural networks (e3nn) v1.0

E(3) is the Euclidean group in dimension 3. That is the group of rotations, translations and mirror. e3nn is a pytorch library that aims to create E(3) equivariant neural networks.

Lapchevskyi, Kostiantyn↗

Building an ab initio solvated DNA model using Euclidean neural networks

Accurately modeling large biomolecules such as DNA from first principles is fundamentally challenging due to the steep computational scaling of ab initio quantum chemistry methods. This limitation becomes even more prominent when modeling biomolecules in solution due to the need to include large numbers of solvent molecules. We present a machine-learned electron density model based on a Euclidean neural network framework that includes a built-in understanding of equivariance to model explicitly solvated double-stranded DNA. By training the machine learning model using molecular fragments that sample the key DNA and solvent interactions, we show that the model predicts electron densities of arbitrary systems of solvated DNA accurately, resolves polarization effects that are neglected by classical force fields, and captures the physics of the DNA-solvent interaction at the ab initio level.

59 BASIC BIOLOGICAL SCIENCES↗

Instanton Effects in Euclidean vacuum, Real Time Production, and in the Light-front Wave Functions

Nontrivial topological structures of non-Abelian gauge fields were discovered in the 1970s. Instanton solutions, describing vacuum tunneling through topological barriers, have fermionic zero modes which are at the origin of ‘t Hooft effective Lagrangian. In the 1980s, instanton ensembles have been used to explain chiral symmetry breaking. In the 1990s, a large set of numerical simulations were performed deriving Euclidean correlation functions. The special role of scalar diquarks in nucleons and color superconductivity in dense quark matter has been elucidated. In these lectures, we discuss further developments of physics related to gauge topology. We show that the instanton–anti-instanton “streamline” configurations describe “sphaleron transitions” in high-energy collisions, which result in production of hadronic clusters with nontrivial topological/chiral charges. (They are not yet observed, but discussions of dedicated experiments at the LHC and RHIC are ongoing.) Another new direction is instanton effects in hadronic spectroscopy, both in the rest frame and on the light front. We will discuss their role in central and spin-dependent potentials, form factors and antiquark nuclear “sea”. Finally, we summarize the advances in the semiclassical theory of deconfinement, and chiral phase transitions at finite temperature, in QCD, and in some of its “deformed” versions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Euclidean controllability of linear delay systems with limited controls

For linear delay systems with limited controls the notion of a proper control system is introduced. If the uncontrolled system x(t) = Ax(t) + Bx(t - h) is uniformly asymptotically stable and the control equation x(t) = Ax(t) + Bx(t-) + Cu(t) is proper, then the control system is Euclidean null-controllable. It is noted that controllability is equivalent to the system being proper for delay systems with unlimited power.

Chukwu, E. N.↗

Numerical generation of two-dimensional orthogonal curvilinear coordinates in an Euclidean space

A noniterative method for the numerical generation of orthogonal curvilinear coordinates for plane annular regions between two arbitrary smooth closed curves was developed. The basic generating equation is the Gaussian equation for an Euclidean space which is solved analytically. The method is applied in many cases and these test results demonstrate that the proposed method can be readily applied to a wide variety of problems. The method can also be used for simply connected regions only by obtaining the solution of the linear equation under the changed boundary conditions.

Warsi, Z. U. A.↗

Observer reference triad rotation, magnetic fields, and rotation in Euclidean cosmological models

It is shown that a cosmological model with Euclidean space sections admits fluid flows if a magnetic field is present. Further, if observer reference frames spin in their response to the universe, a vorticity may exist. Limits can be set on any present intergalactic magnetic field of less than 5.38 x 10 to the -10th gauss (for a model with the chosen symmetry and choice of initial field and fluid velocity components).

Fennelly, A. J.↗

A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadrature amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis codes, is tighter than any upper bound for large constraint lengths, and predicts the asymptotic performance of TCM when the complexity of the code becomes large. The bound can be used with any code rate and any modulation scheme and shows that the free distance increases linearly with the constraint length for large values of the constraint length.

Rouanne, Marc↗

Optimal realizable filters and the minimum Euclidean distance principle

Minimizing a Euclidean distance in the complex plane optimizes a wide class of correlation metrics for filters implemented on realistic devices. The algorithm searches over no more than two real scalars (gain and phase). It unifies a variety of previous solutions for special cases (e.g., a maximum signal-to-noise ratio with colored noise and a real filter and a maximum correlation intensity with no noise and a coupled filter). It extends optimal partial information filter theory to arbitrary spatial light modulators (fully complex, coupled, discrete, finite contrast ratio, and so forth), additive input noise (white or colored), spatially nonuniform filter modulators, and additive correlation detection noise (including signal dependent noise).

Juday, Richard D.↗

Optimization of the Multi-Spectral Euclidean Distance Calculation for FPGA-based Spaceborne Systems

Due to the high quantity of operations that spaceborne processing systems must carry out in space, new methodologies and techniques are being presented as good alternatives in order to free the main processor from work and improve the overall performance. These include the development of ancillary dedicated hardware circuits that carry out the more redundant and computationally expensive operations in a faster way, leaving the main processor free to carry out other tasks while waiting for the result. One of these devices is SpaceCube, a FPGA-based system designed by NASA. The opportunity to use FPGA reconfigurable architectures in space allows not only the optimization of the mission operations with hardware-level solutions, but also the ability to create new and improved versions of the circuits, including error corrections, once the satellite is already in orbit. In this work, we propose the optimization of a common operation in remote sensing: the Multi-Spectral Euclidean Distance calculation. For that, two different hardware architectures have been designed and implemented in a Xilinx Virtex-5 FPGA, the same model of FPGAs used by SpaceCube. Previous results have shown that the communications between the embedded processor and the circuit create a bottleneck that affects the overall performance in a negative way. In order to avoid this, advanced methods including memory sharing, Native Port Interface (NPI) connections and Data Burst Transfers have been used.

Cristo, Alejandro↗

Discriminative Methodology using the Unscented Transform in Special Euclidean Group SE(3) for Autonomous GN&C

Kalman filtering techniques usually compare a known dynamic model with some process noise to an updated, noisy measurement. Both sources of noise are generally assumed to be Gaussian and are filtered to obtain a more accurate estimate of the state of the system of interest. However, these methods assume that a relatively accurate dynamical model already exists. By including discriminative methodology to interpret differences in the predictive model and the measured states over time, an incorrect model can be corrected overtime, allowing a spacecraft to learn about its environment and adapt to changing conditions. In this paper, a discriminative unscented Kalman filter (DUKF) is introduced on the special Euclidean group SE(3) formulation framework. A spacecraft is initialized near a small body with no knowledge of its parameters, and using several consecutive conditional models the environment is studied and the filter is updated. The case study of a spacecraft in a slightly elliptical, inclined, relatively tight orbit around the irregular moon Phobos is simulated and discussed. The accuracy of this approach is quantifying the differences between the true state, the UKF with a poor model, and the DUKF.

GN&C↗