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

Window convolution of the galaxy clustering bispectrum

In galaxy survey analysis, the observed clustering statistics do not directly match theoretical predictions but rather have been processed by a window function that arises from the survey geometry including the sky footprint, redshift-dependent background number density and systematic weights. While window convolution of the power spectrum is well studied, for the bispectrum with a larger number of degrees of freedom, it poses a significant numerical and computational challenge. In this work, we consider the effect of the survey window in the tripolar spherical harmonic decomposition of the bispectrum and lay down a formal procedure for their convolution via a series expansion of configuration-space three-point correlation functions, which was first proposed by Sugiyama et al. (2019). We then provide a linear algebra formulation of the full window convolution, where an unwindowed bispectrum model vector can be directly premultiplied by a window matrix specific to each survey geometry. To validate the pipeline, we focus on the Dark Energy Spectroscopic Instrument (DESI) Data Release 1 (DR1) luminous red galaxy (LRG) sample in the South Galactic Cap (SGC) in the redshift bin 0.4 ≤ z ≤ 0.6. We first perform convergence checks on the measurement of the window function from discrete random catalogues, and then investigate the convergence of the window convolution series expansion truncated at a finite of number of terms as well as the performance of the window matrix. This work highlights the differences in window convolution between the power spectrum and bispectrum, and provides a streamlined pipeline for the latter for current surveys such as DESI and the Euclid mission.

79 ASTRONOMY AND ASTROPHYSICS↗
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 OSTI2021

Kink-antikink collisions and multi-bounce resonance windows in higher-order field theories

In this work, we study collisions of coherent structures in higher-order field-theoretic models, such as the Φ 8 , Φ 10 and Φ 12 ones. The main distinguishing feature, of the example models considered herein, is that the collision arises due to the long-range interacting algebraic tails of these solitary waves. We extend the approach to suitably initialize the relevant kinks, in the additional presence of finite initial velocity, in order to minimize the dispersive wave radiation potentially created by their slow spatial decay. We find that, when suitably initialized, these models still feature the multi-bounce resonance windows earlier found in models in which the kinks bear exponential tails, such as the Φ 4 and Φ 6 field theories among others. Also present is the self-similar structure of the associated windows with three- and more-bounce windows at the edges of two- and lower-bounce ones. Moreover, phenomenological but highly accurate (and predictive), scaling relations are derived for the dependence of the time between consecutive collisions and, e.g., the difference in kinetic energy between the incoming one and the critical one for one-bounces. Such scalings are traced extensively over two-bounce collision windows throughout the three models, hinting at the possibility of an analytical theory in this direction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals

We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the standard model in dimensional regularization. After highlighting issues in the textbook treatment of Landau singularities, we develop an algorithm for classifying and computing them using techniques from computational algebraic geometry. We introduce an algebraic variety called the principal Landau determinant, which captures the singularities even in the presence of massless particles or UV/IR divergences. We illustrate this for 114 example diagrams, including a cutting-edge 2-loop 5-point nonplanar QCD process with multiple mass scales. Published by the American Physical Society 2024

Physics↗
DOE OSTI2023

Anisotropic Melting of Frustrated Ising Antiferromagnets

Magnetic frustrations and dimensionality play an important role in determining the nature of the magnetic long-range order and how it melts at temperatures above the ordering transition T N . In this Letter, we use large-scale Monte Carlo simulations to study these phenomena in a class of frustrated Ising spin models in two spatial dimensions. Here we find that the melting of the magnetic long-range order into an isotropic gaslike paramagnet proceeds via an intermediate stage where the classical spins remain anisotropically correlated. This correlated paramagnet exists in a temperature range T N < T < T * , whose width increases as magnetic frustrations grow. This intermediate phase is typically characterized by short-range correlations; however, the two-dimensional nature of the model allows for an additional exotic feature—formation of an incommensurate liquidlike phase with algebraically decaying spin correlations. The two-stage melting of magnetic order is generic and pertinent to many frustrated quasi-2D magnets with large (essentially classical) spins.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Cosmology meets cohomology

The cosmological polytope and bootstrap programs have revealed interesting connections between positive geometries, modern on-shell methods and bootstrap principles studied in the amplitudes community with the wavefunction of the Universe in toy models of FRW cosmologies. To compute these FRW correlators, one often faces integrals that are too difficult to evaluate by direct integration. Borrowing from the Feynman integral community, the method of (canonical) differential equations provides an efficient alternative for evaluating these integrals. Moreover, we further develop our geometric understanding of these integrals by describing the associated relative twisted cohomology. Leveraging recent progress in our understanding of relative twisted cohomology in the Feynman integral community, we give an algorithm to predict the basis size and simplify the computation of the differential equations satisfied by FRW correlators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Reduced models for ETG transport in the tokamak pedestal

This paper reports on the development of reduced models for electron temperature gradient (ETG) driven transport in the pedestal. Model development is enabled by a set of 61 nonlinear gyrokinetic simulations with input parameters taken from pedestals in a broad range of experimental scenarios. The simulation data have been consolidated in a new database for gyrokinetic simulation data, the multiscale gyrokinetic database (MGKDB), facilitating the analysis. The modeling approach may be considered a generalization of the standard quasilinear mixing length procedure. The parameter η, the ratio of the density to temperature gradient scale length, emerges as the key parameter for formulating an effective saturation rule. With a single order-unity fitting coefficient, the model achieves an error of 15%. A similar model for ETG particle flux is also described. We also present simple algebraic expressions for the transport informed by an algorithm for symbolic regression.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

A fractional calculus framework for open quantum dynamics: From Liouville to Lindblad to memory kernels

Open quantum systems exhibit dynamics ranging from unitary evolution to irreversible dissipation. While the Gorini–Kossakowski–Sudarshan–Lindblad equation uniquely characterizes Markovian completely positive and trace-preserving (CPTP) evolution, many physical platforms display non-Markovian features such as algebraic relaxation and coherence backflow. Fractional calculus provides a natural way to model such long-memory behavior through power-law temporal kernels introduced by fractional time derivatives. Here, we develop a unified framework that embeds fractional master equations within the broader hierarchy of open-system formalisms. The fractional equation forms a structured subclass of memory-kernel models, reduces to the Lindblad form at unit order, and, through Bochner–Phillips subordination, admits a CPTP representation as an average over Lindblad semigroups. Its resolvent structure further connects fractional dynamics to established non-Markovian approaches, including Nakajima–Zwanzig kernels and hierarchical equations of motion, providing a compact surrogate for long-memory effects. This formulation positions fractional calculus as a rigorous and practical language for modeling non-Markovian quantum dynamics in chemical physics and physical chemistry, providing a CPTP-preserving, computationally efficient surrogate for structured condensed-phase environments where long-time memory and dissipation play a central role.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Partial fillings of the bosonic $E$ 8 quantum Hall state

Here, we study bosonic topological phases constructed from electrons. In addition to a bulk excitation energy gap, these bosonic phases also have a fermion energy gap, below which all local excitations in the bulk and on the edge are even combinations of electrons. We focus on chiral phases, in which all low-energy edge excitations move in the same direction, that arise from the short-range entangled $E_8$ quantum Hall state, the bosonic analog of the filled lowest Landau level of electrons. The $E_8$ edge-state theory features an $E_8$ Kac-Moody symmetry that can be decomposed into ${\cal G}_A \times {\cal G}_B$ subalgebras, such as $SU(3) \times E_6$, $SO(M) \times SO(16-M)$, and $G_2 \times F_4$. (Here, $\{SO(M) \}$, $\{SU(N)\}$, and $\{E_8, G_2, F_4 \}$ denote orthogonal, unitary, and exceptional Lie algebras.) Using these symmetry decompositions, we construct exactly solvable coupled-wire model Hamiltonians for families of long-range entangled ${\cal G}_A$ or ${\cal G}_B$ bosonic fractional quantum Hall states that "partially fill" the $E_8$ state and are pairwise related by a generalized particle-hole symmetry. These long-range entangled states feature either Abelian or non-Abelian topological order. Some support the emergence of non-local Dirac and Majorana fermions, Ising anyons, metaplectic anyons, Fibonacci anyons, as well as deconfined $\mathbb{Z}_2$ gauge fluxes and charges.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Electromagnetic Transient (EMT) Simulation Algorithm for Evaluation of Photovoltaic (PV) Generation Systems

Use of inverter-based resources facilitating renewable energy resources such as photovoltaic (PV) generation is increasing rapidly with decreasing costs and reduced emissions associated. To accommodate such rapid growth of inverter-based resources like PV systems, electromagnetic transient (EMT) simulation models of both PV systems and grids are required to analyze the interaction of PVs in the grid (like the post-event analysis). In addition, the EMT simulation would help with the planning of future power grid with a large number of PVs as well as other inverter-based distributed generation systems. In this paper, the EMT simulation models of PV systems and grids are developed based on the differential algebraic equations (DAEs) representing their EMT dynamics. Furthermore, advanced simulation algorithms including numerical stiffness-based hybrid discretization, DAE clustering and aggregation, multi-order integration, and matrix splitting approaches are applied to accelerate the EMT simulation. The proposed algorithm was applied to 125 PV inverters within 52-bus medium-voltage (MV) distribution grid.

Choi, Jongchan↗
DOE OSTI2021

Operation of Natural Gas Pipeline Networks With Storage Under Transient Flow Conditions

Here, we formulate a nonlinear optimal control problem for intraday operation of a natural gas pipeline network that includes storage reservoirs. The dynamics of compressible gas flow through pipes, compressors, reservoirs, and wells are considered. In particular, a reservoir is modeled as a rigid, hollow container that stores gas under isothermal conditions and uniform density, and a well is modeled as a vertical pipe. For each pipe, flow dynamics are described by a coupled partial differential equation (PDE) system in density and mass flux variables, with momentum dissipation modeled using the Darcy–Wiesbach friction approximation. Compressors are modeled as scaling up the pressure of gas between the inlet and outlet. The governing equations for all network components are spatially discretized and assembled into a nonlinear differential-algebraic equation (DAE) system, which synthesizes above-ground pipeline and subsurface reservoir dynamics into a single reduced-order model. We seek to maximize an objective function that quantifies economic profit and network efficiency subject to the flow equations and inequalities that represent operating limitations. The problem is solved using a primal–dual interior point solver, and the solutions are validated in computational experiments and simulations on several pipeline test networks to demonstrate the effectiveness of the proposed methodology.

03 NATURAL GAS↗
DOE OSTI2022

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗
DOE OSTI2025

Strongly nonlinear wave propagation in elasto-plastic metamaterials: Low-order dynamic modeling

Nonlinear elastic metamaterials are known to support a variety of dynamic phenomena that enhance our capacity to manipulate elastic waves. Since these properties stem from complex, subwavelength geometry, full-scale dynamic simulations are often prohibitively expensive at scales of interest. Prior studies have therefore utilized low-order effective medium models, such as discrete mass-spring lattices, to capture essential properties in the long-wavelength limit. While models of this type have been successfully implemented for a wide variety of nonlinear elastic systems, they have predominantly considered dynamics depending only on the instantaneous kinematics of the lattice, neglecting history-dependent effects, such as wear and plasticity. Here, to address this limitation, the present study develops a lattice-based modeling framework for nonlinear elastic metamaterials undergoing plastic deformation. Due to the history- and rate-dependent nature of plasticity, the framework generally yields a system of differential-algebraic equations whose computational cost is significantly greater than an elastic system of comparable size. We demonstrate the method using several models inspired by classical lattice dynamics and continuum plasticity theory and explore means to obtain empirical plasticity models for general geometries, thereby gaining insight into the influence of microstructural plasticity on effective material performance, which can be used to improve the design of nonlinear mechanical metamaterials.

Dynamic simulation↗
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Phenomena-based graph representations and applications to chemical process simulation

Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture the physical phenomena taking place in the process (e.g., material and energy conservation, phase equilibrium, reactions). In this work, we show that graph-theoretic representations of the physical phenomena within unit operations can help navigate and decompose equations to systematically identify alternative approaches for fast and robust numerical solutions. Specifically, we present a graph-theoretic abstraction that captures the connectivity between the model variables/equations and use this abstraction to group variables/equations into fundamental phenomena. We show that phenomena-based decomposition of the underlying equations can help decouple nonlinearities and enforce material/energy conservation at the process level to accelerate convergence. The proposed decomposition approach differs from the more traditional sequential modular simulation approach, in which equations are grouped and decomposed by unit operations. We implemented the phenomena-based decomposition in BioSTEAM—an open-source process simulation platform in Python—and demonstrated that this approach can converge a variety of separation process models. Compared to sequential modular simulation, the phenomena-based approach can converge idealized systems faster, but it can be slower for (or even fail to converge) highly coupled and nonideal process systems.

Convergence↗
DOE OSTI2022

Entanglement entropy and non-local duality: Quantum channels and quantum algebras

Here, we investigate the transformation of entanglement entropy under dualities, using the Kramers–Wannier duality present in the transverse field Ising model as our example. Entanglement entropy between local spin degrees of freedom is not generically preserved by the duality; instead, entangled states may be mapped to states with no local entanglement. To understand the fate of this entanglement, we consider two quantitative descriptions of degrees of freedom and their transformation under duality. The first involves Kraus operators implementing the partial trace as a quantum channel, while the second utilizes the algebraic approach to quantum mechanics, where degrees of freedom are encoded in subalgebras. Using both approaches, we show that entanglement of local degrees of freedom is not lost; instead it is transferred to non-local degrees of freedom by the duality transformation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗