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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Light-front puzzles

Abstract Light-front formulations of quantum field theories have many advantages for computing electroweak matrix elements of strongly interacting systems and other quantities that are used to study hadronic structure. The theory can be formulated in Hamiltonian form so non-perturbative calculations of the strongly interacting initial and final states are in principle reduced to linear algebra. These states are needed for calculating parton distribution functions and other types of distribution amplitudes that are used to understand the structure of hadrons. Light-front boosts are kinematic transformations so the strongly interacting states can be computed in any frame. This is useful for computing current matrix elements involving electroweak probes where the initial and final hadronic states are in different frames related by the momentum transferred by the probe. Finally in many calculations the vacuum is trivial so the calculations can be formulated in Fock space. The advantages of light front-field theory would not be interesting if the light-front formulation was not equivalent to the covariant or canonical formulations of quantum field theory. Many of the distinguishing properties of light-front quantum field theory are difficult to reconcile with canonical or covariant formulations of quantum field theory. This paper discusses the resolution of some of the apparent inconsistencies in canonical, covariant and light-front formulations of quantum field theory. The puzzles that will be discussed are (1) the problem of inequivalent representations (2) the problem of the trivial vacuum (3) the problem of ill-posed initial value problems (4) the problem of rotational covariance (5) the problem of zero modes and (6) the problem of spontaneously broken symmetries.

Physics↗
DOE OSTI2026

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗
DOE OSTI2021

Scalar fields in 3D asymptotically flat higher-spin gravity

Abstract In this work we construct a novel associative algebra and use it to define a theory of higher-spin gravity in (2 + 1)-dimensional asymptotically flat spacetimes. Our construction is based on a quotient of the universal enveloping algebra of i s l ( 2 , R ) with respect to the ideal generated by its Casimir elements, the mass squared M 2 and the three-dimensional analogue of the square of the Pauli–Lubanski vector S and propose to call the resulting associative algebra i h s ( M 2 , S ) . We provide a definition of its generators and even though we are not yet able to provide the complete set of multiplication rules of this algebra our analysis allows us to study many interesting and relevant sub-structures of i h s ( M 2 , S ) . We then show how to consistently couple a scalar field to an i h s ( M 2 , S ) higher-spin gauge theory.

Physics↗
DOE OSTI2020

A phase transition model and temporal logic specifications for smart energy systems - revisited

In this paper, we revisit the method of a phase transition model for representing hybrid systems and temporal logic specifications (TLSs) for specifying desired behaviors of systems, and discuss their usefulness for smart energy systems. On the one hand, the phase transition model incorporates the continuous model of the relay device action with a particular structural form that allows for the construction of a single, global differential-algebraic equation for hybrid systems (thus smoothed hybrid systems). On the other hand, the TLS allows sophisticated descriptions of control specifications addressing both magnitude and time simultaneously, which has recently been applied to the control strategy of several types of continuous and hybrid systems. We provide high-level descriptions of each of the two techniques and present simulation results in the context of smart energy systems.

Park, Byungkwon↗
DOE OSTI2023

Experimental Observations of the Topology of Convolutional Neural Network Activations

Topological data analysis (TDA) is a branch of computational mathematics, bridging algebraic topology and data science, that provides compact, noise-robust representations of complex structures. Deep neural networks (DNNs) learn millions of parameters associated with a series of transformations defined by the model architecture resulting in high-dimensional, difficult to interpret internal representations of input data. As DNNs become more ubiquitous across multiple sectors of our society, there is increasing recognition that mathematical methods are needed to aid analysts, researchers, and practitioners in understanding and interpreting how these models' internal representations relate to the final classification. In this paper we apply cutting edge techniques from TDA with the goal of gaining insight towards interpretability of convolutional neural networks used for image classification. We use two common TDA approaches to explore several methods for modeling hidden layer activations as high-dimensional point clouds, and provide experimental evidence that these point clouds capture valuable structural information about the model's process. First, we demonstrate that a distance metric based on persistent homology can be used to quantify meaningful differences between layers and discuss these distances in the broader context of existing representational similarity metrics for neural network interpretability. Second, we show that a mapper graph can provide semantic insight as to how these models organize hierarchical class knowledge at each layer. These observations demonstrate that TDA is a useful tool to help deep learning practitioners unlock the hidden structures of their models.

topological data analysis, deep learning↗
DOE OSTI2026

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

A T-duality of non-supersymmetric heterotic strings and an implication for Topological Modular Forms

Abstract Motivated by recent developments connecting non-supersymmetric heterotic string theory to the theory of Topological Modular Forms (TMF), we show that the worldsheet theory with central charge (17,$$ \frac{3}{2} $$ 3 2 ) obtained by fibering the (E 8 ) 1 × (E 8 ) 1 current algebra over the two$$ \mathcal{N} $$ N = (0, 1) sigma model onS 1 with antiperiodic spin structure (such that theE 8 factors are exchanged as we go around the circle), is continuously connected to the (E 8 ) 2 theory in the Gaiotto Johnson-Freyd Witten sense of going “up and down the RG trajectories”. Combined with the work of Tachikawa and Yamashita, this furnishes a physical derivation of the fact that the (E 8 ) 2 theory corresponds to the unique nontrivial torsion element [(E 8 ) 2 ] of TMF 31 with zero mod-2 elliptic genus.

Physics↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
DOE OSTI2021

Covariant color-kinematics duality

We show that color-kinematics duality is a manifest property of the equations of motion governing currents and field strengths. For the nonlinear sigma model (NLSM), this insight enables an implementation of the double copy at the level of fields, as well as an explicit construction of the kinematic algebra and associated kinematic current. As a byproduct, we also derive new formulations of the special Galileon (SG) and Born-Infeld (BI) theory. For Yang-Mills (YM) theory, this same approach reveals a novel structure — covariant color-kinematics duality — whose only difference from the conventional duality is that 1/$\square$ is replaced with covariant 1/D 2 . Remarkably, this structure implies that YM theory is itself the covariant double copy of gauged biadjoint scalar (GBAS) theory and an F 3 theory of field strengths encoding a corresponding kinematic algebra and current. Directly applying the double copy to equations of motion, we derive general relativity (GR) from the product of Einstein-YM and F 3 theory. This exercise reveals a trivial variant of the classical double copy that recasts any solution of GR as a solution of YM theory in a curved background. Covariant color-kinematics duality also implies a new decomposition of tree-level amplitudes in YM theory into those of GBAS theory. Using this representation we derive a closed-form, analytic expression for all BCJ numerators in YM theory and the NLSM for any number of particles in any spacetime dimension. By virtue of the double copy, this constitutes an explicit formula for all tree-level scattering amplitudes in YM, GR, NLSM, SG, and BI.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Hypernetwork Science: From Multidimensional Networks to Computational Topology

As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra, lattice theory, and topology. They are able to represent complex systems interactions more faithfully than graphs and networks, while also being some of the simplest classes of systems representing topological structures as collections of multidimensional objects connected in a particular pattern. In this paper we discuss the role of (undirected) hypergraphs in the science of complex networks, and provide a mathematical overview of the core concepts needed for hypernetwork modeling, including duality and the relationship to bicolored graphs, quantitative adjacency and incidence, the nature of walks in hypergraphs, and available topological relationships and properties. We close with a brief discussion of two example applications: biomedical databases for disease analysis, and domain-name system (DNS) analysis of cyber data.

Joslyn, Cliff A.↗
DOE OSTI2023

Extending PETSc's Composable Hierarchical Solvers (Final Technical Report)

This report documents research activities conducted at CU Boulder as part of Extending PETSc’s Composable Hierarchical Solvers, which has been part of a collaboration with Argonne National Laboratory (separate award). Our work has focused on performance-portable end-to-end GPU solvers demonstrated via exemplary applications in nonlinear fluid and structural mechanics. We describe advances in algorithmic composition and analysis in the context of these applications, but the implementations are fully documented and decoupled, and in use by other projects. We believe the vertical integration achieved through collaboration with ECP’s CEED and the PSAAP center at CU was necessary to take risks with data structures and algorithms.

42 ENGINEERING↗
DOE OSTI2022

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗
DOE OSTI2026

Operationally induced preferred basis in unitary quantum mechanics

The preferred-basis problem and the definite-outcome aspect of the measurement problem persist even if the detector is modeled unitarily, because experimental data are necessarily represented in a Boolean event algebra of mutually exclusive records whereas the theoretical description is naturally formulated in a noncommutative operator algebra with continuous unitary symmetry. This change of mathematical type constitutes the core of the 'cut': a structurally necessary interface from group-based kinematics to set-based counting. In the presented view the basis relevant for recorded outcomes is not determined by the system Hamiltonian alone; it is induced by the measurement mapping, i.e., by the detector channel together with the coarse-grained readout that defines an instrument. The probabilistic mapping is anchored in symmetry and measure theory: by Gleason-type uniqueness (Gleason for projections in $d>2$ and Busch's extension for Positive Operator-Valued Measures (POVMs) including $d=2$), the trace rule is the unique probability measure consistent with additivity over exclusive events and basis-independence of the unitary sector. A compact qubit--pointer model yields an induced unsharp POVM $E_\pm=\tfrac12(\id\pm η\,σ_z)$ with $η$ fixed by pointer resolution, displaying explicitly how the detector induces the relevant basis. Finally, nested-observer paradoxes are tightened into a non-composability lemma: joint assignment of outcome propositions is obstructed unless a joint instrument exists. This relocates the origin of randomness to the stochasticity of the transition rules.

Pronskikh, Vitaly [Fermilab] (ORCID:00000002518174↗
DOE OSTI2023

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2020

Controllable vortex shedding from dissipative exchange flows in ferromagnetic channels

Ferromagnetic channels subject to spin injection at one extremum sustain long-range coherent textures that carry spin currents known as dissipative exchange flows (DEFs). In the weak injection regime, spin currents carried by DEFs decay algebraically and extend through the length of the channel, a regime known as spin superfluidity. Similar to fluids, these structures are prone to phase slips that manifest as vortex-antivortex pairs. In this work, we numerically study vortex shedding from DEFs excited in a magnetic nanowire with a physical obstacle. Using micromagnetic simulations, we find regimes of laminar flow and vortex shedding as a function of obstacle position tunable by the spin injection sign and magnitude. Vortex-antivortex pairs translate forward (VF regime) or backward (VB regime) with respect to the detector's extremum, resulting in well-defined spectral features. Qualitatively similar results are obtained when temperature, anisotropy, and weak nonlocal dipole fields are included in the simulations. These results provide clear features associated with DEFs that may be detected experimentally in devices with nominally identical boundary conditions. Furthermore, our results suggest that obstacles can be considered as DEF control gates, opening an avenue to manipulate DEFs via physical defects.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗