Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic structures”

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.

209 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

In-depth analysis on parallel processing patterns for high-performance Dataframes

The Data Science domain has expanded monumentally in both research and industry communities during the past decade, predominantly owing to the Big Data revolution. Artificial Intelligence (AI) and Machine Learning (ML) are bringing more complexities to data engineering applications, which are now integrated into data processing pipelines to process terabytes of data. Typically, a significant amount of time is spent on data preprocessing in these pipelines, and hence improving its efficiency directly impacts the overall pipeline performance. The community has recently embraced the concept of Dataframes as the de-facto data structure for data representation and manipulation. However, the most widely used serial Dataframes today (R, pandas) experience performance limitations while working on even moderately large data sets. We believe that there is plenty of room for improvement by taking a look at this problem from a high-performance computing point of view. In a prior publication, we presented a set of parallel processing patterns for distributed dataframe operators and the reference runtime implementation, Cylon. In this paper, we are expanding on the initial concept by introducing a cost model for evaluating the said patterns. Furthermore, we evaluate the performance of Cylon on the ORNL Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Coupling and recoupling coefficients for Wigner’s U(4) supermultiplet symmetry

A novel procedure for evaluating Wigner coupling coefficients and Racah recoupling coefficients for U(4) in two group–subgroup chains is presented. The canonical U(4) > U(3) > U(2) > U(1) coupling and recoupling coefficients are applicable to any system that possesses U(4) symmetry, while the physical U(4) coupling coefficients are more specific to nuclear structure studies that utilize Wigner’s supermultiplet symmetry concept. The procedure that is proposed sidesteps the use of binomial coefficients and alternating sum series and consequently enables fast and accurate computation of any and all U(4)-underpinned features. The inner multiplicity of a (S, T) pair within a single U(4) > SU S (2) Ⓧ SU T (2) irreducible representation is obtained from the dimension of the null space of the SU(2) raising generators, while the resolution for the outer multiplicity follows from the work of Alex et al. on U(N) . It is anticipated that a C++ library will ultimately be available for determining generic coupling and recoupling coefficients associated with both the canonical and the physical group–subgroup chains of U(4).

Cross-Coupling Reaction↗
DOE OSTI2022

Duality and form factors in the thermally deformed two-dimensional tricritical Ising model

The thermal deformation of the critical point action of the 2D tricritical Ising model gives rise to an exact scattering theory with seven massive excitations based on the exceptional E_7 E 7 Lie algebra. The high and low temperature phases of this model are related by duality. This duality guarantees that the leading and sub-leading magnetisation operators, \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , in either phase are accompanied by associated disorder operators, \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) . Working specifically in the high temperature phase, we write down the sets of bootstrap equations for these four operators. For \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , the equations are identical in form and are parameterised by the values of the one-particle form factors of the two lightest \mathbb{Z}_2 ℤ 2 odd particles. Similarly, the equations for \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) have identical form and are parameterised by two elementary form factors. Using the clustering property, we show that these four sets of solutions are eventually not independent; instead, the parameters of the solutions for \sigma(x)/\sigma'(x) σ ( x ) / σ ′ ( x ) are fixed in terms of those for \mu(x)/\mu'(x) μ ( x ) / μ ′ ( x ) . We use the truncated conformal space approach to confirm numerically the derived expressions of the matrix elements as well as the validity of the \Delta Δ -sum rule as applied to the off-critical correlators. We employ the derived form factors of the order and disorder operators to compute the exact dynamical structure factors of the theory, a set of quantities with a rich spectroscopy which may be directly tested in future inelastic neutron or Raman scattering experiments.

Cortes Cubero, Axel↗
DOE OSTI2020

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

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

We construct a novel flux tube entanglement entropy (FTE 2 ), defined as the excess entanglement entropy relative to the vacuum of a region of color flux stretching between a heavy quark-anti-quark pair in pure gauge Yang-Mills theory. We show that FTE 2 can be expressed in terms of correlators of Polyakov loops, is manifestly gauge-invariant, and therefore free of the ambiguities in computations of the entanglement entropy in gauge theories related to the choice of the center algebra. Employing the replica trick, we compute FTE 2 for SU(2) Yang-Mills theory in (2+1)D and demonstrate that it is finite in the continuum limit. We explore the properties of FTE 2 for a half-slab geometry, which allows us to vary the width and location of the slab, and the extent to which the slab cross-cuts the color flux tube. Following the intuition provided by computations of FTE 2 in (1+1)D, and in a thin string model, we examine the extent to which our FTE 2 results can be interpreted as the sum of an internal color entropy and a vibrational entropy corresponding to the transverse excitations of the string.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Stringy canonical forms

Canonical forms of positive geometries play an important role in revealing hidden structures of scattering amplitudes, from amplituhedra to associahedra. In this paper, we introduce “stringy canonical forms”, which provide a natural definition and extension of canonical forms for general polytopes, deformed by a parameter α'. They are defined by real or complex integrals regulated with polynomials with exponents, and are meromorphic functions of the exponents, sharing various properties of string amplitudes. As α'→ 0, they reduce to the usual canonical form of a polytope given by the Minkowski sum of the Newton polytopes of the regulating polynomials, or equivalently the volume of the dual of this polytope, naturally determined by tropical functions. At finite α', they have simple poles corresponding to the facets of the polytope, with the residue on the pole given by the stringy canonical form of the facet. There is the remarkable connection between the α'→ 0 limit of tree-level string amplitudes, and scattering equations that appear when studying the α'→ ∞ limit. We show that there is a simple conceptual understanding of this phenomenon for any stringy canonical form: the saddle-point equations provide a diffeomorphism from the integration domain to the interior of the polytope, and thus the canonical form can be obtained as a pushforward via summing over saddle points. When the stringy canonical form is applied to the ABHY associahedron in kinematic space, it produces the usual Koba-Nielsen string integral, giving a direct path from particle to string amplitudes without an a priori reference to the string worldsheet. We also discuss a number of other examples, including stringy canonical forms for finite-type cluster algebras (with type A corresponding to usual string amplitudes), and other natural integrals over the positive Grassmannian.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Algebraic Theory of Patterns as Generalized Symmetries

We generalize the exact predictive regularity of symmetry groups to give an algebraic theory of patterns, building from a core principle of future equivalence. For topological patterns in fully-discrete one-dimensional systems, future equivalence uniquely specifies a minimal semiautomaton. We demonstrate how the latter and its semigroup algebra generalizes translation symmetry to partial and hidden symmetries. This generalization is not as straightforward as previously considered. Here, though, we clarify the underlying challenges. A stochastic form of future equivalence, known as predictive equivalence, captures distinct statistical patterns supported on topological patterns. Finally, we show how local versions of future equivalence can be used to capture patterns in spacetime. As common when moving to higher dimensions, there is not a unique local approach, and we detail two local representations that capture different aspects of spacetime patterns. A previously developed local spacetime variant of future equivalence captures patterns as generalized symmetries in higher dimensions, but we show that this representation is not a faithful generator of its spacetime patterns. This motivates us to introduce a local representation that is a faithful generator, but we demonstrate that it no longer captures generalized spacetime symmetries. Taken altogether, building on future equivalence, the theory defines and quantifies patterns present in a wide range of classical field theories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Machine learning for nonintrusive model order reduction of the parametric inviscid transonic flow past an airfoil

Fluid flow in the transonic regime finds relevance in aerospace engineering, particularly in the design of commercial air transportation vehicles. Computational fluid dynamics models of transonic flow for aerospace applications are computationally expensive to solve because of the high degrees of freedom as well as the coupled nature of the conservation laws. While these issues pose a bottleneck for the use of such models in aerospace design, computational costs can be significantly minimized by constructing special, structure-preserving surrogate models called reduced-order models. In this work, we propose a machine learning method to construct reduced-order models via deep neural networks and we demonstrate its ability to preserve accuracy with a significantly lower computational cost. In addition, our machine learning methodology is physics-informed and constrained through the utilization of an interpretable encoding by way of proper orthogonal decomposition. Application to the inviscid transonic flow past the RAE2822 airfoil under varying freestream Mach numbers and angles of attack, as well as airfoil shape parameters with a deforming mesh, shows that the proposed approach adapts to high-dimensional parameter variation well. Notably, the proposed framework precludes the knowledge of numerical operators utilized in the data generation phase, thereby demonstrating its potential utility in the fast exploration of design space for diverse engineering applications. Comparison against a projection-based nonintrusive model order reduction method demonstrates that the proposed approach produces comparable accuracy and yet is orders of magnitude computationally cheap to evaluate, despite being agnostic to the physics of the problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A collinear perspective on the Regge limit

The high energy (Regge) limit provides a playground for understanding all loop structures of scattering amplitudes, and plays an important role in the description of many phenomenologically relevant cross-sections. While well understood in the planar limit, the structure of non-planar corrections introduces many fascinating complexities, for which a general organizing principle is still lacking. We study the structure of multi-reggeon exchanges in the context of the effective field theory for forward scattering, and derive their factorization into collinear operators (impact factors) and soft operators. We derive the structure of the renormalization group consistency equations in the effective theory, showing how the anomalous dimensions of the soft operators are related to those of the collinear operators, allowing us to derive renormalization group equations in the Regge limit purely from a collinear perspective. The rigidity of the consistency equations provides considerable insight into the all orders organization of Regge amplitudes in the effective theory, as well as its relation to other approaches. Along the way we derive a number of technical results that improve the understanding of the effective theory. We illustrate this collinear perspective by re-deriving all the standard BFKL equations for two-Glauber exchange from purely collinear calculations, and we show that this perspective provides a number of conceptual and computational advantages as compared to the standard view from soft or Glauber physics. We anticipate that this formulation in terms of collinear operators will enable a better understanding of the relation between BFKL and DGLAP in gauge theories, and facilitate the analysis of renormalization group evolution equations describing Reggeization beyond next-to-leading order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗