Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Hidden zeros of the cosmological wavefunction

Motivated by the recent discovery of hidden zeros in particle and string amplitudes, we characterize zeros of individual graph contributions to the cosmological wavefunction of a scalar field theory. We demonstrate that these contributions factorize near these zeros for all tree graphs and provide evidence that this extends to loop graphs as well. We explicitly construct polytopal realizations of the relevant graph associahedra and show that the cosmological zeros have natural geometric and physical interpretations. As a byproduct, we establish an equivalence between the wavefunction coefficients of chain graphs and flat-space Tr(ϕ 3 ) amplitudes, enabling us to leverage the cosmological zeros to uncover the recently discovered hidden zeros of colored amplitudes.

Cosmological models↗
DOE OSTI2025

Differential equations for cosmological correlators

Cosmological fluctuations retain a memory of the physics that generated them in their spatial correlations. The strength of correlations varies smoothly as a function of external kinematics, which is encoded in differential equations satisfied by cosmological correlation functions. In this work, we provide a broader perspective on the origin and structure of these differential equations. As a concrete example, we study conformally coupled scalar fields in a power-law cosmology. The wavefunction coefficients in this model have integral representations, with the integrands being the product of the corresponding flat-space results and “twist factors” that depend on the cosmological evolution. Similar twisted integrals arise for loop amplitudes in dimensional regularization, and their recent study has led to the discovery of rich mathematical structures and powerful new tools for computing multi-loop Feynman integrals in quantum field theory. The integrals of interest in cosmology are also part of a finite-dimensional basis of master integrals, which satisfy a system of first-order differential equations. We develop a formalism to derive these differential equations for arbitrary tree graphs. The results can be represented in graphical form by associating the singularities of the differential equations with a set of graph tubings. Upon differentiation, these tubings grow in a local and predictive fashion. In fact, a few remarkably simple rules allow us to predict — by hand — the equations for all tree graphs. While the rules of this “kinematic flow” are defined purely in terms of data on the boundary of the spacetime, they reflect the physics of bulk time evolution. We also study the analogous structures in tr ϕ 3 theory, and see some glimpses of hidden structure in the sum over planar graphs. This suggests that there is an autonomous combinatorial or geometric construction from which cosmological correlations, and the associated spacetime, emerge.

Cosmological models↗
DOE OSTI2021

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗
DOE OSTI2022

Novel Solver Algorithms for Nearly Singular Linear Systems Arising in Combustion Modelling

Direct Numerical Simulations of realistic combustion devices are extremely challenging due to the wide separation of scales in the simulation, for example an internal combustion (IC) engine chamber, and the flame thickness of a high-pressure flame. The PeleLMeX solver uses adaptive mesh refinement (AMR) to evolve multi-species reacting flows in the low Mach number limit at the Exascale and relies on an embedded boundary (EB) approach to represent complex geometries. In that framework, the EB geometries often give rise to very small cut-cells along the boundary, which translate into extreme ill-conditioning of the pressure-projection, with eigenvalues that span 15-16 orders of magnitude. In this talk, we focus on the case of a typical IC piston bowl geometry for which we present on a novel approach towards solving these nearly singular linear systems with ILU-based, C-AMG smoothers on massively parallel architectures. In particular, we use scaling and equilibration algorithms to handle the non-normality of the upper triangular factors. This enables us to approximate the highly sequential triangular solve algorithm, embedded in the AMG smoothing-solve phase, with Jacobi iterations. This approximation can be written as a convergent Neumann series whose terms are composed of highly parallel sparse matrix vector multiplications. The result is an algorithm that substantially decreases setup and solve time, compared to state-of-the-art, for these challenging linear systems.

combustion modelling↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗
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 OSTI2021

An Algebra of Machine Learners with Applications

Machine learning (ML) methods are increasingly being applied to solve complex, data-driven problems in diverse areas, by exploiting the physical laws derived from first principles such as thermal hydraulics and the abstract laws developed recently for data and computing infrastructures. These physical and abstract laws encapsulate, typically in compact algebraic forms, the critical knowledge that complements data-driven ML models. We present a unified perspective of these laws and ML methods using an abstract algebra (A;⊕,Ⓧ), wherein the performance estimation and classification tasks are characterized by the additive ⊕ operations, and the diagnosis, reconstruction, and optimization tasks are characterized by the difference Ⓧ operations. This abstraction provides ML codes and their performance characterizations that are transferable across different areas. We describe practical applications of these abstract operations using examples of throughput profile estimation tasks in data transport infrastructures, and power-level and sensor error estimation tasks in nuclear reactor systems.

Rao, Nageswara↗
DOE OSTI2026

BoBa

BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.

Yao, Jin [Lawrence Livermore National Laboratory (↗
DOE OSTI2021

pnnl/neural_ODE_ICLR2020

We show how to model discrete ordinary differential equations (ODE) with algebraic nonlinearities as deep neural networks with varying degrees of prior knowledge. We derive the stability guarantees of the network layers based on the implicit constraints imposed on the weight's eigenvalues. Moreover, we show how to use barrier methods to generically handle additional inequality constraints. We demonstrate the prediction accuracy of learned neural ODEs evaluated on open-loop simulations compared to ground truth dynamics with bi-linear terms.

Tuor, Aaron↗
DOE OSTI2026

ssys

`ssys` is a Python toolkit for exact algebraic transformation of ordinary differential equation (ODE) models into canonical S-system or Generalized Mass Action (GMA) form. Given a model in Antimony or SBML format, `ssys` produces a mathematically equivalent representation. The transformation introduces auxiliary variables as needed to decompose a broad class of nonlinearities into products of power-law terms. The recast is exact: the original and transformed systems have identical dynamics on the invariant constraint manifold defined by auxiliary variable definitions, given consistent initial conditions.

Hlavacek, William [Los Alamos National Laboratory]↗
DOE OSTI2022

Singularity-EOS XCAP Report

Solving the Euler equations is a fundamental component of simulating many physical phenomena ranging from high explosives to astrophysics. An equation of state (EOS) is a required piece that relates any two thermodynamic quantities to all other thermodynamic values. The presence of multiple materials within a control volume further complicates the solution requiring additional equations to describe the interaction of materials at a sub-grid level. Equations of state themselves can also come in many forms ranging from simple algebraic relations to more complicated differential equation models that describe material interactions over a broad range of physical conditions. In the latter case, the EOS is often pre-computed at a given set of grid points and provided in a tabular form where additional properties can be derived from the interpolation functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗
DOE OSTI2023

A symmetry algebra in double-scaled SYK

The double-scaled limit of the Sachdev-Ye-Kitaev (SYK) model takes the number of fermions and their interaction number to infinity in a coordinated way. In this limit, two entangled copies of the SYK model have a bulk description of sorts known as the “chord Hilbert space”. We analyze a symmetry algebra acting on this Hilbert space, generated by the two Hamiltonians together with a two-sided operator known as the chord number. This algebra is a deformation of the JT gravitational algebra, and it contains a subalgebra that is a deformation of the \mathfrak{sl}_2 𝔰 𝔩 2 near-horizon symmetries. The subalgebra has finite-dimensional unitary representations corresponding to matter moving around in a discrete Einstein-Rosen bridge. In a semiclassical limit the discreteness disappears and the subalgebra simplifies to \mathfrak{sl}_2 𝔰 𝔩 2 , but with a non-standard action on the boundary time coordinate. One can make the action of \mathfrak{sl}_2 𝔰 𝔩 2 algebra more standard at the cost of extending the boundary circle to include some “fake” portions. Such fake portions also accommodate certain subtle states that survive the semi-classical limit, despite oscillating on the scale of discreteness. We discuss applications of this algebra, including sub-maximal chaos, the traversable wormhole protocol, and a two-sided OPE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Linear Solvers for Collector Systems of Generalized Large-scale Inverter-Based Resources

Collector systems for inverter-based resources (IBRs) are typically represented by equivalent circuits for electromagnetic transient (EMT) simulations. Recent studies have revealed that modeling a detailed collector system is essential to accurately represent the behavior of IBRs, especially when dealing with partial tripping during external disturbances. However, there are several challenges in simulating a detailed EMT model of a collector system due to the time required to simulate such systems. Thus, this paper investigates the modeling of a detailed collector system, taking into account its configuration and components as defined in IEEE standard 2800. The configurations include the collector systems of generalized large-scale IBR plants. The components include the main IBR transformer, collector bus, and feeders with lines and/or cables. The EMT model of the collector system is represented by differential algebraic equations (DAEs) that are discretized to form linear equations that are solved using linear solvers. In this paper, linear solvers are proposed based on the Schur complement method, which are utilized for simulation of the EMT model of collector systems of generalized large-scale IBRs to accelerate simulation speed while maintaining the accuracy of the results. The proposed solvers are verified by comparing the performance to that of linear solvers provided in MATLAB.

Choi, Jongchan↗
DOE OSTI2020

A simple and effective five-equation two-phase numerical model for liquid-vapor phase transition in cavitating flows

Numerical difficulties, notably the non-monotonic behavior of the Wood speed of sound and the volume fraction positivity, associated with the reduced five-equation two-phase flow model of Kapila et al. (2001) [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, 2001. Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10), 3002–3024] have been resolved in the past through the introduction of a frozen speed of sound and an algebraic approach for mechanical relaxation afforded by a pressure non-equilibrium six-equation model proposed by [R. Saurel, F. Petitpas, R.A. Berry, 2009. Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixture, J. Comput. Phys. 228, 1678–1712]. By contrast, it is explored and demonstrated in this work that these difficulties can in fact still be resolved within the numerical scheme for solving the reduced five-equation model by numerically replacing the Wood speed of sound for the estimates of wave speeds in the approximate Riemann solver HLLC with the monotonic mixture speed of sound for a transport five-equation model. For shock interface (artificial mixture separating pure or nearly pure fluids) interaction problems, with the apparent advantage of monotonic behavior of the speed of sound in the interface, the effect of the numerical replacement is also confined to the interface. Differences other than the behavior of the speed of sound within the interface in the solutions due to the replacement diminish with increasing resolution when reasonable solution can be obtained with Wood speed of sound. For cavitating/expansion problems in physical fluid mixture, it is pointed out and explained why acoustics in the numerical solutions still propagate at the Wood speed of sound (therefore consistent with the reduced five-equation model) even though in some cases a much higher speed of sound like the numerical replacement above for solving the reduced five-equation model or the frozen speed of sound for solving a six-equation model is used for the estimates of wave speeds in the HLLC scheme. A variant of the five-equation two-phase flow model by Saurel et al. (2008) [R. Saurel, F. Petitpas, R. Abgrall, 2008. Modelling phase transition in metastable liquids: application to cavitating and flashing flows, J. Fluid Mech. 607, 313–350] is then constructed for liquid-vapor phase transition in cavitating flows. The relaxation toward thermo-chemical equilibrium during phase transition is achieved by solving a simple system of algebraic equations for the equilibrium state variables for better efficiency, following Pelanti and Shyue (2014) [M. Pelanti, K.-M. Shyue, 2014. A mixture-energy-consistent six-equation two-phase numerical model for fluid with interfaces, cavitation and evaporation waves. J. Comput. Phys. 259, 331–357]. Therefore, the current model retains both the simplicity afforded by the five-equation model and the efficiency of the algebraic relaxation solver. An alternative algebraic approach for handling the non-conservative term (the so-called K∇ · u term) in the reduced five-equation model for mechanical equilibrium of a liquid-vapor mixture is also explored by enforcing the thermal equilibrium at the same time. Finally, numerical results of sample tests in both one and two dimensions in the literature as well as that in three dimensions demonstrate the effectiveness and ability of the proposed model to simulate cavitating flows. An interesting mechanism of shock generation by acoustics in water due to phase transition is then found by the numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Moonshine, superconformal symmetry, and quantum error correction

Special conformal field theories can have symmetry groups which are interesting sporadic finite simple groups. Famous examples include the Monster symmetry group of a c = 24 twodimensional conformal field theory (CFT) constructed by Frenkel, Lepowsky and Meurman, and the Conway symmetry group of a c = 12 CFT explored in detail by Duncan and Mack-Crane. The Mathieu moonshine connection between the K3 elliptic genus and the Mathieu group M24 has led to the study of K3 sigma models with large symmetry groups. A particular K3 CFT with a maximal symmetry group preserving (4, 4) superconformal symmetry was studied in beautiful work by Gaberdiel, Taormina, Volpato, and Wendland [41]. The present paper shows that in both the GTVW and c = 12 theories the construction of superconformal generators can be understood via the theory of quantum error correcting codes. The automorphism groups of these codes lift to symmetry groups in the CFT preserving the superconformal generators. In the case of the N = 1 supercurrent of the GTVW model our result, combined with a result of T. Johnson-Freyd implies the symmetry group is the maximal subgroup of M24 known as the sextet group. (The sextet group is also known as the holomorph of the hexacode.) Building on [41] the Ramond-Ramond sector of the GTVW model is related to the Miracle Octad Generator which in turn leads to a role for the Golay code as a group of symmetries of RR states. Moreover, (4, 1) superconformal symmetry suffices to define and decompose the elliptic genus of a K3 sigma model into characters of the N = 4 superconformal algebra. The symmetry group preserving (4, 1) is larger than that preserving (4, 4).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

LieART 2.0 – A Mathematica application for Lie Algebras and Representation Theory

In this paper, we present LieART 2.0 which contains substantial extensions to the Mathematica application LieART (Lie Algebras and Representation Theory) for computations frequently encountered in Lie algebras and representation theory, such as tensor product decomposition and subalgebra branching of irreducible representations. The basic procedure is unchanged—it computes root systems of Lie algebras, weight systems and several other properties of irreducible representations, but new features and procedures have been included to allow the extensions to be seamless. The new version of LieART continues to be user friendly. New extended tables of properties, tensor products and branching rules of irreducible representations are included in the supplementary material for use without Mathematica software. LieART 2.0 now includes the branching rules to special subalgebras for all classical and exceptional Lie algebras up to and including rank 15.

97 MATHEMATICS AND COMPUTING↗