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.

At least 163 records · Page 9

Structural Dynamic Analysis in Rocket Propulsion and Launch Vehicles

Structural dynamics is one of the critical disciplines for the successful design, development, and testing of space launch vehicles. It is applied from the smallest component (turbine blades), all the way to the entire vehicle, and has to be calculated for every phase of a mission, from ascent and orbit to landing. Successful application of structural dynamics requires extensive knowledge of Fourier techniques, linear algebra, random variables, finite element modeling, and essentials of SDOF and MDOF vibration theory. Working knowledge of fluid dynamics, statistics, and data analysis also extremely useful.

Andrew M Brown↗

The algebraic theory of latent projectors in lambda matrices

Multivariable systems such as a finite-element model of vibrating structures, control systems, and large-scale systems are often formulated in terms of differential equations which give rise to lambda matrices. The present investigation is concerned with the formulation of the algebraic theory of lambda matrices and the relationship of latent roots, latent vectors, and latent projectors to the eigenvalues, eigenvectors, and eigenprojectors of the companion form. The chain rule for latent projectors and eigenprojectors for the repeated latent root or eigenvalues is given.

Denman, E. D.↗

Variable Complexity Structural Optimization of Shells

Structural designers today face both opportunities and challenges in a vast array of available analysis and optimization programs. Some programs such as NASTRAN, are very general, permitting the designer to model any structure, to any degree of accuracy, but often at a higher computational cost. Additionally, such general procedures often do not allow easy implementation of all constraints of interest to the designer. Other programs, based on algebraic expressions used by designers one generation ago, have limited applicability for general structures with modem materials. However, when applicable, they provide easy understanding of design decisions trade-off. Finally, designers can also use specialized programs suitable for designing efficiently a subset of structural problems. For example, PASCO and PANDA2 are panel design codes, which calculate response and estimate failure much more efficiently than general-purpose codes, but are narrowly applicable in terms of geometry and loading. Therefore, the problem of optimizing structures based on simultaneous use of several models and computer programs is a subject of considerable interest. The problem of using several levels of models in optimization has been dubbed variable complexity modeling. Work under NASA grant NAG1-1808 has been concerned with the development of variable complexity modeling strategies with special emphasis on response surface techniques. In addition several modeling issues for the design of shells of revolution were studied.

Haftka, Raphael T.↗

Variable Complexity Structural Optimization of Shells

Structural designers today face both opportunities and challenges in a vast array of available analysis and optimization programs. Some programs such as NASTRAN, are very general, permitting the designer to model any structure, to any degree of accuracy, but often at a higher computational cost. Additionally, such general procedures often do not allow easy implementation of all constraints of interest to the designer. Other programs, based on algebraic expressions used by designers one generation ago, have limited applicability for general structures with modem materials. However, when applicable, they provide easy understanding of design decisions trade-off. Finally, designers can also use specialized programs suitable for designing efficiently a subset of structural problems. For example, PASCO and PANDA2 are panel design codes, which calculate response and estimate failure much more efficiently than general-purpose codes, but are narrowly applicable in terms of geometry and loading. Therefore, the problem of optimizing structures based on simultaneous use of several models and computer programs is a subject of considerable interest. The problem of using several levels of models in optimization has been dubbed variable complexity modeling. Work under NASA grant NAG1-2110 has been concerned with the development of variable complexity modeling strategies with special emphasis on response surface techniques. In addition, several modeling issues for the design of shells of revolution were studied.

Haftka, Raphael T.↗

Axion domain walls, small instantons, and non-invertible symmetry breaking

Non-invertible global symmetry often predicts degeneracy in axion potentials and carries important information about the global form of the gauge group. When these symmetries are spontaneously broken they can lead to the formation of stable axion domain wall networks which support topological degrees of freedom on their worldvolume. Such non-invertible symmetries can be broken by embedding into appropriate larger UV gauge groups where small instanton contributions lift the vacuum degeneracy, and provide a possible solution to the domain wall problem. We explain these ideas in simple illustrative examples and then apply them to the Standard Model, whose gauge algebra and matter content are consistent with several possible global structures. Each possible global structure leads to different selection rules on the axion couplings, and various UV completions of the Standard Model lead to more specific relations. As a proof of principle, we also present an example of a UV embedding of the Standard Model which can solve the axion domain wall problem. The formation and annihilation of the long-lived axion domain walls can lead to observables, such as gravitational wave signals. Observing such signals, in combination with the axion coupling measurements, can provide valuable insight into the global structure of the Standard Model, as well as its UV completion.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Accelerating GNNs on GPU Sparse Tensor Cores through N:M Sparsity-Oriented Graph Reordering

Recent advancements in GPU hardware support have introduced the capability to leverage N:M sparse patterns for substantial performance gains. Graphs in Graph Neural Networks (GNNs) are typically sparse, but the sparsity is often irregular, not conforming to such sparse patterns. In this paper, we propose a novel graph reordering algorithm, the first of its kind, to reshape irregular graph data into the N:M structured sparse pattern at the tile level, allowing linear-algebra-based graph operations in GNNs to benefit from the N:M sparse hardware. The optimization is lossless, maintaining the accuracy of GNN. It can remove 98-100\% violations of the N:M sparse patterns at the vector level, and increase the proportion of conforming graphs in SuiteSparse collection from 5-9\% to 88.7-93.5\%. On A100 GPUs, the optimization accelerates Sparse Matrix Matrix (SpMM) by up to 43X (2.3X -- 7.5X on average) and speeds up the key graph operations in GNNs on real graphs by as much as 8.6X (3.5X on average).

artificial intelligence, graph neural networks↗

(SPT-)LSM theorems from projective non-invertible symmetries

Projective symmetries are ubiquitous in quantum lattice models and can be leveraged to constrain their phase diagram and entanglement structure. In this paper, we investigate the consequences of projective algebras formed by non-invertible symmetries and lattice translations in a generalized 1+1 1 + 1 D quantum XY model based on group-valued qudits. This model is specified by a finite group G G and enjoys a projective \mathsf{Rep}(G)× Z(G) 𝖱 𝖾 𝗉 ( G ) × Z ( G ) and translation symmetry, where symmetry operators obey a projective algebra in the presence of symmetry defects. For invertible symmetries, such projective algebras imply Lieb-Schultz-Mattis (LSM) anomalies. However, this is not generally true for non-invertible symmetries, and we derive a condition on G G for the existence of an LSM anomaly. When this condition is not met, we prove an SPT-LSM theorem: any unique and gapped ground state is necessarily a non-invertible weak symmetry protected topological (SPT) state with non-trivial entanglement, for which we construct an example fixed-point Hamiltonian. The projectivity also affects the dual symmetries after gauging \mathsf{Rep}(G)× Z(G) 𝖱 𝖾 𝗉 ( G ) × Z ( G ) sub-symmetries, giving rise to non-Abelian and non-invertible dipole symmetries, as well as non-invertible translations. We complement our analysis with the SymTFT, where the projectivity causes it to be a topological order non-trivially enriched by translations. Throughout the paper, we develop techniques for gauging \mathsf{Rep}(G) 𝖱 𝖾 𝗉 ( G ) symmetry and inserting its symmetry defects on the lattice, which are applicable to other non-invertible symmetries.

Pace, Salvatore D. (ORCID:0000000306093335)↗

Minimizing Weight of Structural Designs

Approximation Concepts Code for Efficient Structural Synthesis (ACCESS3) combines methods to offer structural system designer powerful, efficient tool for synthesis of minimum-weight designs. Approximation concepts convert general structural synthesis problem into sequence of explicit problems of separable algebraic form; dual method exploits separable form to construct sequence of explicit dual functions.

Schmit, L. A., Jr.↗

Simultaneous analysis and design for eigenvalue maximization

A simultaneous analysis and design approach to the maximization of buckling or vibration eigenvalues is presented. Both unimodal and bimodal optimum solutions are considered. A discretization of the structure and response is used to obtain sets of nonlinear algebraic equations which are solved numerically. The formulation is applied to the solution of the optimum design of a beam-column supported by an elastic foundation for maximum buckling load. Two cases are considered: the optimum design of the column for a given foundation and the optimum design of the foundation for a given column. Results are compared to published solutions when possible.

Plaut, Raymond H.↗

Self-dual (48,24;12) codes

Two self-dual (48,24;12) codes are constructed as 6 x 8 matrices whose columns add up to form an extended BCH-Hamming (8,4;4) code and whose rows sum to odd or even parity. The codes constructed have the identical weight structure of the extended quadratic residue code of length 48. Algebraic isomorphisms may exist between pairs of these three codes. However, because of their matrix form, the newly constructed codes are easily correctable for all five-error and many six-error patterns. The first code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix and then adjoining six dimensions to the extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. The second code comes from a slight modification in the parity (eighth) dimension of the Reed-Solomon (8,4;5) code over GF(64). Error correction in both codes uses the row sum parity information to detect errors in the correction algorithm.

Solomon, G.↗

Overview of turbulence model development and applications at Rocketdyne

This viewgraph presentation discusses turbulence modeling requirements, development philosophy, and approach; two major areas of concentration (high speed and low speed turbulence modeling); high speed turbulence modeling; compressibility effects; turbulence models adapted to USA code; M = 9.2 flat plate flow; Mach 7.05 flow over axisymmetric flare; Mach 8.6 flow over cold wall edge; low speed turbulence modeling; turbulence models being assessed; turbulence model deck structure and integration with Navier-Stokes solver; nonlinear algebraic-stress model; rotation modified k-epsilon model; and Reynolds stress model.

Hadid, A. H.↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Observer-based robust-H-infinity control laws for uncertain linear systems

Based on the algebraic Riccati equation approach, this paper presents a simple and flexible method for designing observer-based robust-H-infinity control laws for linear systems with structured parameter uncertainty. The observer-based robust-H-infinity output-feedback control law, obtained by solving three augmented algebraic Riccati equations, provides both robust stability and disturbance attenuation with H-infinity-norm bound for the closed-loop uncertain linear system. Several tuning parameters are embedded into the augmented algebraic Riccati equations so that flexibility in finding the symmetric positive-definite solutions (and hence, the robust-H-infinity control laws) is significantly increased. A benchmark problem associated with a mass-spring system, which approximates the dynamics of a flexible structure, is used to illustrate the design methodologies, and simulation results are presented.

Shieh, Leang S.↗

Modular flow in JT gravity and entanglement wedge reconstruction

It has been shown in recent works that JT gravity with matter with two boundaries has a type II ∞ algebra on each side. As the bulk spacetime between the two boundaries fluctuates in quantum nature, we can only define the entanglement wedge for each side in a pure algebraic sense. As we take the semiclassical limit, we will have a fixed long wormhole spacetime for a generic partially entangled thermal state (PETS), which is prepared by inserting heavy operators on the Euclidean path integral. Under this limit, with appropriate assumptions of the matter theory, geometric notions of the causal wedge and entanglement wedge emerge in this background. In particular, the causal wedge is manifestly nested in the entanglement wedge. Different PETS are orthogonal to each other, and thus the Hilbert space has a direct sum structure over sub-Hilbert spaces labeled by different Euclidean geometries. The full algebra for both sides is decomposed accordingly. From the algebra viewpoint, the causal wedge is dual to an emergent type III 1 subalgebra, which is generated by boundary light operators. To reconstruct the entanglement wedge, we consider the modular flow in a generic PETS for each boundary. We show that the modular flow acts locally and is the boost transformation around the global RT surface in the semiclassical limit. It follows that we can extend the causal wedge algebra to a larger type III 1 algebra corresponding to the entanglement wedge. Within each sub-Hilbert space, the original type II ∞ reduces to type III 1 .

2D Gravity↗

Semiclassical Trans-Series from the Perturbative Hopf-Algebraic Dyson-Schwinger Equations: $\phi$ 3 QFT in 6 Dimensions

We analyze the asymptotically free massless scalar $\phi$ 3 quantum field theory in 6 dimensions, using resurgent asymptotic analysis to find the trans-series solutions which yield the non-perturbative completion of the divergent perturbative solutions to the Kreimer–Connes Hopf-algebraic Dyson–Schwinger equations for the anomalous dimension. This scalar conformal field theory is asymptotically free and has a real Lipatov instanton. In the Hopf-algebraic approach we find a trans-series having an intricate Borel singularity structure, with three distinct but resonant non-perturbative terms, each repeated in an infinite series. These expansions are in terms of the renormalized coupling. The resonant structure leads to powers of logarithmic terms at higher levels of the trans-series, analogous to logarithmic terms arising from interactions between instantons and anti-instantons, but arising from a purely perturbative formalism rather than from a semi-classical analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

Computation of three dimensional turbulent boundary layers in internal flows, including turbomachinery rotor blades

A method is developed for predicting three-dimensional turbulent boundary layers occurring in internal flows, including rotor blades of turbomachinery. These boundary layers are complex, turbulent, and are subject to Coriolis and centrifugal forces. The algebraic Reynolds stress model (ARSM) developed in this paper satisfies the realizability conditions exactly and captures the changes in turbulenet structure arising from curvature and rotation. The prediction of pressure driven secondary flow agrees well with the data and all the three turbulent models (k-e, algebraic eddy viscosity, and ARSM) show the same level of agreement. The prediction of boundary layer on rotor blades shows much better agreement with the ARSM. It is essential to employ the higher order models to capture the effects of rotation and curvature and three-dimensional boundary layers in turbomachinery.

Zhang, J.↗

Shape and Stress Sensing of Multilayered Composite and Sandwich Structures Using an Inverse Finite Element Method

The marked increase in the use of composite and sandwich material systems in aerospace, civil, and marine structures leads to the need for integrated Structural Health Management systems. A key capability to enable such systems is the real-time reconstruction of structural deformations, stresses, and failure criteria that are inferred from in-situ, discrete-location strain measurements. This technology is commonly referred to as shape- and stress-sensing. Presented herein is a computationally efficient shape- and stress-sensing methodology that is ideally suited for applications to laminated composite and sandwich structures. The new approach employs the inverse Finite Element Method (iFEM) as a general framework and the Refined Zigzag Theory (RZT) as the underlying plate theory. A three-node inverse plate finite element is formulated. The element formulation enables robust and efficient modeling of plate structures instrumented with strain sensors that have arbitrary positions. The methodology leads to a set of linear algebraic equations that are solved efficiently for the unknown nodal displacements. These displacements are then used at the finite element level to compute full-field strains, stresses, and failure criteria that are in turn used to assess structural integrity. Numerical results for multilayered, highly heterogeneous laminates demonstrate the unique capability of this new formulation for shape- and stress-sensing.

Cerracchio, Priscilla↗