SEARCH · Engineering Papers

Results for “EUCLIDEAN 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Generalized fiducial inference on differentiable manifolds

We introduce a novel approach to inference on parameters that take values in a Riemannian manifold embedded in a Euclidean space. Parameter spaces of this form are ubiquitous across many fields, including chemistry, physics, computer graphics, and geology. Here, this new approach uses generalized fiducial inference (GFI) to obtain a posterior-like distribution on the manifold, without needing to know local parameterizations that map to the constrained space from an unconstrained Euclidean space. Using mathematical tools from Riemannian geometry, we construct a constrained generalized fiducial distribution (CGFD). A Bernstein-von Mises-type result for the CGFD, which provides intuition for how the desirable asymptotic qualities of the unconstrained generalized fiducial distribution are inherited by the CGFD, is provided. To illustrate the practical use of the CGFD, we provide a proof-of-concept example in the context of a linear logspline density estimation problem, and demonstrate that CGFD-based confidence sets exhibit desirable coverage properties via simulation. As an application, we fit a CGFD to COVID-19 case count data from North Carolina, USA.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

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↗

DOE OSTI2025

Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings, and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity-check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians 𝐻 0 defined by ⟦𝑁,𝐾,𝑑⟧ LDPC codes, which obey certain topological quantum order conditions: (i) code distance 𝑑 ≥ 𝑐⁢log (𝑁), implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states—these include good quantum LDPC codes and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasilocal on the interaction graph defined by 𝐻 0 and that can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the 𝑂⁡(1) smallest eigenvalues of 𝐻 0 . The band originating from the smallest eigenvalue has 2 𝐾 states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth 𝛿 =𝐶⁢𝑁⁢𝑒 −Θ⁡(𝑑) , which is tighter than the best-known bounds even in the Euclidean case. We also obtain that the new ground-state subspace is related to the initial-code subspace by a quasilocal unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

mathematical physics↗

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 OSTI2025

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↗

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 OSTI2024

Using Parameter Sweep in WaterTAP to Analyze New Water Treatment Technologies

We describe a powerful and generalized parameter sweep tool in this report that was originally developed to analyze the performance of existing and novel water treatment models being developed in WaterTAP. Since WaterTAP is built upon IDAES and Pyomo, the parameter sweep tool can be used to systematically explore and debug the behavior of most Pyomo and IDAES numerical models. In order to enable meaningful analyses, the parameter sweep tool has been designed with the following features: 1) Model flexibility: The parameter sweep tool does not enforce any restrictions on the types of models that can be used with it. As long as a Pyomo model can be solved and the parameter is active and mutable, the tool only needs functions that describe how to run the model, the sweep parameters, and the output quantities of interest. 2) Flexible sampling: The parameter sweep tool has inbuilt functions to generate samples from a random distribution or a multidimensional Euclidean space. Furthermore, the users have to ability to supply samples generated from a tool of their choice. 3) Multiple sweep types: A user can choose from one of 3 types of parameter sweeps depending on their needs. 4) Detailed outputs: Outputs generated by the parameter sweep tool can be stored in detailed H5 file or user-friendly CSV files for post processing. 5) Parallel computing: The parameter sweep supports shared and distributed memory parallel computing to enable the use of high performance computers (HPC) for large-scale analyses. 6) Modular: The parameter sweep tool is self-contained and can easily be integrated within an outer-loop analysis or as desired by the user. 7) Ease of use: The tool is well documented and a simple sweep can be easily executed by following the online documentation in a few lines of code. We demonstrate the use of the parameter sweep tool on a simple water treatment system from the WaterTAP repository and show its parallel scaling performance on an Apple laptop and NREL's Eagle HPC. The parameter sweep tool is actively being used with models currently being developed within WaterTAP and we expect its use to grow beyond it to other IDAES and Pyomo models.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

DOE OSTI2024

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)↗

DOE OSTI2025

Dynamical dark energy from lattice quantum gravity

We study the behavior of the vacuum in Euclidean dynamical triangulations (EDT). Algorithmic improvements and better lattice spacing determinations allow us to test the properties of the emergent de Sitter geometries of our simulations to higher precision than previously possible. Although the agreement with de Sitter is good, the improved precision reveals deviations that can be interpreted as nontrivial vacuum dynamics, well described by a cosmological constant that runs with scale. The simulations show that the dominant running is quadratic and that the scale can be identified with the Hubble rate. Several key cross-checks support this picture, including consistent results across multiple lattice spacings and the fact that the null energy condition is not violated. The parameters of the running are fully determined by simulations, enabling predictions when extrapolated to the scales relevant for our Universe. This leads to a model for dark energy that is compatible with current observations, but which predicts deviations from the Standard Model of cosmology at the 𝒪⁡(10 −3 ) level in observables that could be tested with future improvements in precision measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Lorentzian contours for tree-level string amplitudes

We engineer compact contours on the moduli spaces of genus-zero Riemann surfaces that achieve analytic continuation from Euclidean to Lorentzian worldsheets. These generalized Pochhammer contours are based on the combinatorics of associahedra and make the analytic properties of tree-level amplitudes entirely manifest for any number and type of external strings. We use them in practice to perform first numerical computations of open and closed string amplitudes directly in the physical kinematics for n=4,5,6,7,8,9 n = 4 , 5 , 6 , 7 , 8 , 9 . We provide a code that allows anyone to do such computations.

Physics↗

DOE OSTI2025

Cuts and contours

The traditional formulation of string amplitudes via worldsheet integrals provides a parametrization of the moduli space that fails to expose the complete singularity structure of the amplitudes. This problem is solved by the positive parametrization of string amplitudes given by surfaceology. In this work, we use this formalism to study a number of properties of string amplitudes at tree-level and one-loop. We introduce several global prescriptions for an integration contour for which the integrals are finite everywhere in kinematic space. At tree-level, this is done in two ways: one directly implements the Feynman iε to analytically continue from Euclidean to Lorentzian worldsheets; the other is a generalization of the closed Pochhammer contour to arbitrary number of points. At loop-level, we present a systematic way of extracting cuts directly from the worldsheet integrand. This provides a powerful set of unitarity constraints, which we use to test the consistency of different “stringy” UV regularizations of field theory amplitudes. In addition, we identify the massive threshold expansion of the integrand, which allows us to reduce the problem to a finite set of Feynman integrals in Schwinger parametrization and provide a straightforward contour prescription reminiscent of its field-theory version.

Bosonic Strings↗

DOE OSTI2026

The Fate of Nucleated Black Holes in de Sitter Quantum Gravity

The Euclidean Nariai geometry has long been proposed as the instanton describing the nucleation of maximal-mass black holes in de Sitter space. We place this interpretation on firmer footing by showing that, once an observer is included, the gravitational path integral produces the imaginary phase required for a transition rate. As a warmup, we revisit the Hawking-Moss instanton and, as a byproduct, find that scalar fields can enhance black-hole nucleation, suggesting a quantum-gravity bound on scalar potentials with de Sitter solutions. We then study the subsequent semiclassical evolution of the nucleated black hole. We show that the previously claimed "anti-evaporation" channel is unphysical, arising from a quantum state with singular horizons. In a smooth state, the black hole instead undergoes standard thermal Hawking evaporation. We verify explicit agreement with the no-boundary state and argue that this evaporation is not subject to large quantum-gravity corrections. The nucleated black hole thus evaporates completely back to the maximally-entropic empty de Sitter vacuum, making the full process a Boltzmann fluctuation.

FOS: Physical sciences↗

DOE OSTI2025

The origin of the Stokes–Einstein relation in simple dense liquids

Here, we investigate the origin of the universal relation between structural relaxation and diffusion in simple dense liquids, known as the Stokes–Einstein (SE) relation. The fact that this relation, originally derived from a hydrodynamic model of a macroscopic particle in a viscous medium, can describe the microscopic-scale liquid dynamics still eludes understanding. We introduce a new universal measure of structural relaxation in a system of N identical particles based on an explicit decomposition of the configuration space into N! congruent convex polyhedra. This measure makes it possible to quantify the correlation between two distinct particle configurations in terms of their minimal Euclidean distance, optimized with respect to particle permutations. Using this measure alongside a model of independent random walkers under the single-occupancy constraint, we derive a master equation that quantifies the SE relation. It allows us to demonstrate that the universal relation between structural relaxation and diffusion in simple dense liquids is caused by two conditions: (a) the confinement of the dominant density fluctuations to the first coordination shell, manifested by de Gennes narrowing, and (b) Gaussianity of the diffusion process; the former is shown to be violated in low-density fluids, and the latter is known to be violated in supercooled liquids.

Physics - Condensed matter physics↗

DOE OSTI2025

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↗

DOE OSTI2025

Static and dynamic properties of atomic nuclei with high-resolution potentials

Here, we compute ground-state and dynamical properties of 4 He and 16 O nuclei using as input high-resolution, phenomenological nucleon-nucleon and three-nucleon forces that are local in coordinate space. The nuclear Schrodinger equation for both nuclei is accurately solved employing the auxiliary-field diffusion Monte Carlo approach. For the 4 He nucleus, detailed benchmarks are carried out with the hyperspherical harmonics method. In addition to presenting results for the binding energies and radii, we also analyze the momentum distributions of these nuclei and their Euclidean response function corresponding to the isoscalar density transition. The latter quantity is particularly relevant for lepton-nucleus scattering experiments, as it paves the way to quantum Monte Carlo calculations of electroweak response functions of 16 O.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗